103 related articles for article (PubMed ID: 20671326)
1. On the complexity of uSPR distance.
Bonet ML; St John K
IEEE/ACM Trans Comput Biol Bioinform; 2010; 7(3):572-6. PubMed ID: 20671326
[TBL] [Abstract][Full Text] [Related]
2. Walks on SPR neighborhoods.
Caceres AJ; Castillo J; Lee J; St John K
IEEE/ACM Trans Comput Biol Bioinform; 2013; 10(1):236-9. PubMed ID: 23702562
[TBL] [Abstract][Full Text] [Related]
3. On Hill et al's conjecture for calculating the subtree prune and regraft distance between phylogenies.
Linz S
BMC Evol Biol; 2010 Oct; 10():334. PubMed ID: 21034464
[TBL] [Abstract][Full Text] [Related]
4. 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]
5. Calculating the Unrooted Subtree Prune-and-Regraft Distance.
Whidden C; Matsen F
IEEE/ACM Trans Comput Biol Bioinform; 2018 Feb; ():. PubMed ID: 29994585
[TBL] [Abstract][Full Text] [Related]
6. Lost in space? Generalising subtree prune and regraft to spaces of phylogenetic networks.
Bordewich M; Linz S; Semple C
J Theor Biol; 2017 Jun; 423():1-12. PubMed ID: 28414085
[TBL] [Abstract][Full Text] [Related]
7. 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]
8. Matching split distance for unrooted binary phylogenetic trees.
Bogdanowicz D; Giaro K
IEEE/ACM Trans Comput Biol Bioinform; 2012; 9(1):150-60. PubMed ID: 21383415
[TBL] [Abstract][Full Text] [Related]
9. Consistency of topological moves based on the balanced minimum evolution principle of phylogenetic inference.
Bordewich M; Gascuel O; Huber KT; Moulton V
IEEE/ACM Trans Comput Biol Bioinform; 2009; 6(1):110-7. PubMed ID: 19179704
[TBL] [Abstract][Full Text] [Related]
10. Approximating subtree distances between phylogenies.
Bonet ML; St John K; Mahindru R; Amenta N
J Comput Biol; 2006 Oct; 13(8):1419-34. PubMed ID: 17061919
[TBL] [Abstract][Full Text] [Related]
11. Minimum-flip supertrees: complexity and algorithms.
Chen D; Eulenstein O; Fernandez-Baca D; Sanderson M
IEEE/ACM Trans Comput Biol Bioinform; 2006; 3(2):165-73. PubMed ID: 17048402
[TBL] [Abstract][Full Text] [Related]
12. Algorithms for efficient near-perfect phylogenetic tree reconstruction in theory and practice.
Sridhar S; Dhamdhere K; Blelloch G; Halperin E; Ravi R; Schwartz R
IEEE/ACM Trans Comput Biol Bioinform; 2007; 4(4):561-71. PubMed ID: 17975268
[TBL] [Abstract][Full Text] [Related]
13. On the fixed parameter tractability of agreement-based phylogenetic distances.
Bordewich M; Scornavacca C; Tokac N; Weller M
J Math Biol; 2017 Jan; 74(1-2):239-257. PubMed ID: 27221239
[TBL] [Abstract][Full Text] [Related]
14. Improved parameterized complexity of the maximum agreement subtree and maximum compatible tree problems.
Berry V; Nicolas F
IEEE/ACM Trans Comput Biol Bioinform; 2006; 3(3):289-302. PubMed ID: 17048466
[TBL] [Abstract][Full Text] [Related]
15. Hybridization in nonbinary trees.
Linz S; Semple C
IEEE/ACM Trans Comput Biol Bioinform; 2009; 6(1):30-45. PubMed ID: 19179697
[TBL] [Abstract][Full Text] [Related]
16. Neighborhoods of trees in circular orderings.
Bastkowski S; Moulton V; Spillner A; Wu T
Bull Math Biol; 2015 Jan; 77(1):46-70. PubMed ID: 25477080
[TBL] [Abstract][Full Text] [Related]
17. 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]
18. Exploring the Tiers of Rooted Phylogenetic Network Space Using Tail Moves.
Janssen R; Jones M; Erdős PL; van Iersel L; Scornavacca C
Bull Math Biol; 2018 Aug; 80(8):2177-2208. PubMed ID: 29948885
[TBL] [Abstract][Full Text] [Related]
19. Unrooted tree reconciliation: a unified approach.
Górecki P; Eulenstein O; Tiuryn J
IEEE/ACM Trans Comput Biol Bioinform; 2013; 10(2):522-36. PubMed ID: 23929875
[TBL] [Abstract][Full Text] [Related]
20. Improved Practical Algorithms for Rooted Subtree Prune and Regraft (rSPR) Distance and Hybridization Number.
Yamada K; Chen ZZ; Wang L
J Comput Biol; 2020 Sep; 27(9):1422-1432. PubMed ID: 32048865
[TBL] [Abstract][Full Text] [Related]
[Next] [New Search]
