181 related articles for article (PubMed ID: 23702562)
1. 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]
2. 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]
3. Hamiltonian walks of phylogenetic treespaces.
Gordon K; Ford E; St John K
IEEE/ACM Trans Comput Biol Bioinform; 2013; 10(4):1076-9. PubMed ID: 24334399
[TBL] [Abstract][Full Text] [Related]
4. 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]
5. Progressive tree neighborhood applied to the maximum parsimony problem.
Goëffon A; Richer JM; Hao JK
IEEE/ACM Trans Comput Biol Bioinform; 2008; 5(1):136-45. PubMed ID: 18245882
[TBL] [Abstract][Full Text] [Related]
6. 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]
7. 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]
8. 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]
9. Computing nearest neighbour interchange distances between ranked phylogenetic trees.
Collienne L; Gavryushkin A
J Math Biol; 2021 Jan; 82(1-2):8. PubMed ID: 33492606
[TBL] [Abstract][Full Text] [Related]
10. The prevalence of multifurcations in tree-space and their implications for tree-search.
Whelan S; Money D
Mol Biol Evol; 2010 Dec; 27(12):2674-7. PubMed ID: 20584772
[TBL] [Abstract][Full Text] [Related]
11. 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]
12. morePhyML: improving the phylogenetic tree space exploration with PhyML 3.
Criscuolo A
Mol Phylogenet Evol; 2011 Dec; 61(3):944-8. PubMed ID: 21925283
[TBL] [Abstract][Full Text] [Related]
13. 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]
14. Spaces of phylogenetic networks from generalized nearest-neighbor interchange operations.
Huber KT; Linz S; Moulton V; Wu T
J Math Biol; 2016 Feb; 72(3):699-725. PubMed ID: 26037483
[TBL] [Abstract][Full Text] [Related]
15. The gene-duplication problem: near-linear time algorithms for NNI-based local searches.
Bansal MS; Eulenstein O; Wehe A
IEEE/ACM Trans Comput Biol Bioinform; 2009; 6(2):221-31. PubMed ID: 19407347
[TBL] [Abstract][Full Text] [Related]
16. The Space of Tree-Based Phylogenetic Networks.
Fischer M; Francis A
Bull Math Biol; 2020 Jun; 82(6):70. PubMed ID: 32500263
[TBL] [Abstract][Full Text] [Related]
17. 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]
18. Phylogenetic identification of lateral genetic transfer events.
Beiko RG; Hamilton N
BMC Evol Biol; 2006 Feb; 6():15. PubMed ID: 16472400
[TBL] [Abstract][Full Text] [Related]
19. Efficient error correction algorithms for gene tree reconciliation based on duplication, duplication and loss, and deep coalescence.
Chaudhary R; Burleigh JG; Eulenstein O
BMC Bioinformatics; 2012 Jun; 13 Suppl 10(Suppl 10):S11. PubMed ID: 22759416
[TBL] [Abstract][Full Text] [Related]
20. A topological transformation in evolutionary tree search methods based on maximum likelihood combining p-ECR and neighbor joining.
Guo MZ; Li JF; Liu Y
BMC Bioinformatics; 2008 May; 9 Suppl 6(Suppl 6):S4. PubMed ID: 18541057
[TBL] [Abstract][Full Text] [Related]
[Next] [New Search]
