140 related articles for article (PubMed ID: 23368759)
1. A practical O(n log2 n) time algorithm for computing the triplet distance on binary trees.
Sand A; Brodal GS; Fagerberg R; Pedersen CN; Mailund T
BMC Bioinformatics; 2013; 14 Suppl 2(Suppl 2):S18. PubMed ID: 23368759
[TBL] [Abstract][Full Text] [Related]
2. An Efficient Algorithm for the Rooted Triplet Distance Between Galled Trees.
Jansson J; Rajaby R; Sung WK
J Comput Biol; 2019 Sep; 26(9):893-907. PubMed ID: 30990336
[No Abstract] [Full Text] [Related]
3. tqDist: a library for computing the quartet and triplet distances between binary or general trees.
Sand A; Holt MK; Johansen J; Brodal GS; Mailund T; Pedersen CN
Bioinformatics; 2014 Jul; 30(14):2079-80. PubMed ID: 24651968
[TBL] [Abstract][Full Text] [Related]
4. Algorithms for computing the triplet and quartet distances for binary and general trees.
Sand A; Holt MK; Johansen J; Fagerberg R; Brodal GS; Pedersen CN; Mailund T
Biology (Basel); 2013 Sep; 2(4):1189-209. PubMed ID: 24833220
[TBL] [Abstract][Full Text] [Related]
5. A polynomial-time algorithm computing lower and upper bounds of the rooted subtree prune and regraft distance.
Kannan L; Li H; Mushegian A
J Comput Biol; 2011 May; 18(5):743-57. PubMed ID: 21166560
[TBL] [Abstract][Full Text] [Related]
6. Fast calculation of the quartet distance between trees of arbitrary degrees.
Christiansen C; Mailund T; Pedersen CN; Randers M; Stissing MS
Algorithms Mol Biol; 2006 Sep; 1():16. PubMed ID: 16999860
[TBL] [Abstract][Full Text] [Related]
7. QDist--quartet distance between evolutionary trees.
Mailund T; Pedersen CN
Bioinformatics; 2004 Jul; 20(10):1636-7. PubMed ID: 14962942
[TBL] [Abstract][Full Text] [Related]
8. A More Practical Algorithm for the Rooted Triplet Distance.
Jansson J; Rajaby R
J Comput Biol; 2017 Feb; 24(2):106-126. PubMed ID: 27983874
[TBL] [Abstract][Full Text] [Related]
9. A sub-cubic time algorithm for computing the quartet distance between two general trees.
Nielsen J; Kristensen AK; Mailund T; Pedersen CN
Algorithms Mol Biol; 2011 Jun; 6():15. PubMed ID: 21639882
[TBL] [Abstract][Full Text] [Related]
10. Trying out a million genes to find the perfect pair with RTIST.
Zhelezov G; Degnan JH
Bioinformatics; 2022 Jul; 38(14):3565-3573. PubMed ID: 35641003
[TBL] [Abstract][Full Text] [Related]
11. Fast Algorithms for Computing Path-Difference Distances.
Wang BF; Li CY
IEEE/ACM Trans Comput Biol Bioinform; 2019; 16(2):569-582. PubMed ID: 29993953
[TBL] [Abstract][Full Text] [Related]
12. SPR distance computation for unrooted trees.
Hickey G; Dehne F; Rau-Chaplin A; Blouin C
Evol Bioinform Online; 2008 Feb; 4():17-27. PubMed ID: 19204804
[TBL] [Abstract][Full Text] [Related]
13. Counting glycans revisited.
Böcker S; Wagner S
J Math Biol; 2014 Oct; 69(4):799-816. PubMed ID: 23974240
[TBL] [Abstract][Full Text] [Related]
14. A fast tool for minimum hybridization networks.
Chen ZZ; Wang L; Yamanaka S
BMC Bioinformatics; 2012 Jul; 13():155. PubMed ID: 22748099
[TBL] [Abstract][Full Text] [Related]
15. A practical method for exact computation of subtree prune and regraft distance.
Wu Y
Bioinformatics; 2009 Jan; 25(2):190-6. PubMed ID: 19019848
[TBL] [Abstract][Full Text] [Related]
16. Fast local search for unrooted Robinson-Foulds supertrees.
Chaudhary R; Burleigh JG; Fernández-Baca D
IEEE/ACM Trans Comput Biol Bioinform; 2012; 9(4):1004-13. PubMed ID: 22431553
[TBL] [Abstract][Full Text] [Related]
17. Fast computation of distance estimators.
Elias I; Lagergren J
BMC Bioinformatics; 2007 Mar; 8():89. PubMed ID: 17355623
[TBL] [Abstract][Full Text] [Related]
18. constNJ: an algorithm to reconstruct sets of phylogenetic trees satisfying pairwise topological constraints.
Matsen FA
J Comput Biol; 2010 Jun; 17(6):799-818. PubMed ID: 20500096
[TBL] [Abstract][Full Text] [Related]
19. Transforming rooted agreement into unrooted agreement.
Przytycka TM
J Comput Biol; 1998; 5(2):335-49. PubMed ID: 9672836
[TBL] [Abstract][Full Text] [Related]
20. Quartet MaxCut: a fast algorithm for amalgamating quartet trees.
Snir S; Rao S
Mol Phylogenet Evol; 2012 Jan; 62(1):1-8. PubMed ID: 21762785
[TBL] [Abstract][Full Text] [Related]
[Next] [New Search]
