163 related articles for article (PubMed ID: 19204804)
21. Exact median-tree inference for unrooted reconciliation costs.
Górecki P; Markin A; Eulenstein O
BMC Evol Biol; 2020 Oct; 20(Suppl 1):136. PubMed ID: 33115401
[TBL] [Abstract][Full Text] [Related]
22. 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]
23. 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]
24. A strict upper bound for the partition distance and the cluster distance of phylogenetic trees for each fixed pair of topological trees.
Middendorf M; Wieseke N
PLoS One; 2018; 13(9):e0204907. PubMed ID: 30265723
[TBL] [Abstract][Full Text] [Related]
25. 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]
26. Polynomial-time metrics for attributed trees.
Torsello A; Hidović-Rowe D; Pelillo M
IEEE Trans Pattern Anal Mach Intell; 2005 Jul; 27(7):1087-99. PubMed ID: 16013756
[TBL] [Abstract][Full Text] [Related]
27. A clique-based method for the edit distance between unordered trees and its application to analysis of glycan structures.
Fukagawa D; Tamura T; Takasu A; Tomita E; Akutsu T
BMC Bioinformatics; 2011 Feb; 12 Suppl 1(Suppl 1):S13. PubMed ID: 21342542
[TBL] [Abstract][Full Text] [Related]
28. 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]
29. Unrooted unordered homeomorphic subtree alignment of RNA trees.
Milo N; Zakov S; Katzenelson E; Bachmat E; Dinitz Y; Ziv-Ukelson M
Algorithms Mol Biol; 2013 Apr; 8(1):13. PubMed ID: 23590940
[TBL] [Abstract][Full Text] [Related]
30. 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]
31. Genomic duplication problems for unrooted gene trees.
Paszek J; Górecki P
BMC Genomics; 2016 Jan; 17 Suppl 1(Suppl 1):15. PubMed ID: 26818591
[TBL] [Abstract][Full Text] [Related]
32. Improving the efficiency of SPR moves in phylogenetic tree search methods based on maximum likelihood.
Hordijk W; Gascuel O
Bioinformatics; 2005 Dec; 21(24):4338-47. PubMed ID: 16234323
[TBL] [Abstract][Full Text] [Related]
33. Faster Exact Computation of rSPR Distance via Better Approximation.
Chen ZZ; Harada Y; Nakamura Y; Wang L
IEEE/ACM Trans Comput Biol Bioinform; 2018 Oct; ():. PubMed ID: 30387740
[TBL] [Abstract][Full Text] [Related]
34. Leaping through Tree Space: Continuous Phylogenetic Inference for Rooted and Unrooted Trees.
Penn MJ; Scheidwasser N; Penn J; Donnelly CA; Duchêne DA; Bhatt S
Genome Biol Evol; 2023 Dec; 15(12):. PubMed ID: 38085949
[TBL] [Abstract][Full Text] [Related]
35. Calculating SPR distances between trees.
Goloboff PA
Cladistics; 2008 Aug; 24(4):591-597. PubMed ID: 34879631
[TBL] [Abstract][Full Text] [Related]
36. Improved Fixed-Parameter Algorithm for the Tree Containment Problem on Unrooted Phylogenetic Network.
Shi F; Li H; Rong G; Zhang Z; Wang J
IEEE/ACM Trans Comput Biol Bioinform; 2022; 19(6):3539-3552. PubMed ID: 34506290
[TBL] [Abstract][Full Text] [Related]
37. 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]
38. Quantifying MCMC exploration of phylogenetic tree space.
Whidden C; Matsen FA
Syst Biol; 2015 May; 64(3):472-91. PubMed ID: 25631175
[TBL] [Abstract][Full Text] [Related]
39. 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]
40. 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]
[Previous] [Next] [New Search]
