300 related articles for article (PubMed ID: 17048466)
1. 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]
2. Efficient FPT Algorithms for (Strict) Compatibility of Unrooted Phylogenetic Trees.
Baste J; Paul C; Sau I; Scornavacca C
Bull Math Biol; 2017 Apr; 79(4):920-938. PubMed ID: 28247121
[TBL] [Abstract][Full Text] [Related]
3. Using max cut to enhance rooted trees consistency.
Snir S; Rao S
IEEE/ACM Trans Comput Biol Bioinform; 2006; 3(4):323-33. PubMed ID: 17085842
[TBL] [Abstract][Full Text] [Related]
4. Fixed-parameter tractability of the maximum agreement supertree problem.
Guillemot S; Berry V
IEEE/ACM Trans Comput Biol Bioinform; 2010; 7(2):342-53. PubMed ID: 20431153
[TBL] [Abstract][Full Text] [Related]
5. The Kernel of Maximum Agreement Subtrees.
Swenson KM; Chen E; Pattengale ND; Sankoff D
IEEE/ACM Trans Comput Biol Bioinform; 2012; 9(4):1023-31. PubMed ID: 22231622
[TBL] [Abstract][Full Text] [Related]
6. Fixed-parameter algorithms in phylogenetics.
Gramm J; Nickelsen A; Tantau T
Methods Mol Biol; 2008; 452():507-35. PubMed ID: 18566780
[TBL] [Abstract][Full Text] [Related]
7. 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]
8. Molecular clock fork phylogenies: closed form analytic maximum likelihood solutions.
Chor B; Snir S
Syst Biol; 2004 Dec; 53(6):963-7. PubMed ID: 15764563
[TBL] [Abstract][Full Text] [Related]
9. COSPEDTree: COuplet Supertree by Equivalence Partitioning of Taxa Set and DAG Formation.
Bhattacharyya S; Mukherjee J
IEEE/ACM Trans Comput Biol Bioinform; 2015; 12(3):590-603. PubMed ID: 26357270
[TBL] [Abstract][Full Text] [Related]
10. Analytic solutions of maximum likelihood on forks of four taxa.
Chor B; Snir S
Math Biosci; 2007 Aug; 208(2):347-58. PubMed ID: 17664091
[TBL] [Abstract][Full Text] [Related]
11. 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]
12. Transforming rooted agreement into unrooted agreement.
Przytycka TM
J Comput Biol; 1998; 5(2):335-49. PubMed ID: 9672836
[TBL] [Abstract][Full Text] [Related]
13. Upper bounds on maximum likelihood for phylogenetic trees.
Hendy MD; Holland BR
Bioinformatics; 2003 Oct; 19 Suppl 2():ii66-72. PubMed ID: 14534174
[TBL] [Abstract][Full Text] [Related]
14. Reconstructing phylogeny by quadratically approximated maximum likelihood.
Woodhams MD; Hendy MD
Bioinformatics; 2004 Aug; 20 Suppl 1():i348-54. PubMed ID: 15262819
[TBL] [Abstract][Full Text] [Related]
15. Invariant transformers of Robinson and Foulds distance matrices for Convolutional Neural Network.
Tahiri N; Veriga A; Koshkarov A; Morozov B
J Bioinform Comput Biol; 2022 Aug; 20(4):2250012. PubMed ID: 35798684
[TBL] [Abstract][Full Text] [Related]
16. URec: a system for unrooted reconciliation.
Górecki P; Tiuryn J
Bioinformatics; 2007 Feb; 23(4):511-2. PubMed ID: 17182699
[TBL] [Abstract][Full Text] [Related]
17. Reconstruction of ancestral genomic sequences using likelihood.
Elias I; Tuller T
J Comput Biol; 2007 Mar; 14(2):216-37. PubMed ID: 17456016
[TBL] [Abstract][Full Text] [Related]
18. Anomalous unrooted gene trees.
Degnan JH
Syst Biol; 2013 Jul; 62(4):574-90. PubMed ID: 23576318
[TBL] [Abstract][Full Text] [Related]
19. 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]
20. Computing the hybridization number of two phylogenetic trees is fixed-parameter tractable.
Bordewich M; Semple C
IEEE/ACM Trans Comput Biol Bioinform; 2007; 4(3):458-466. PubMed ID: 17666765
[TBL] [Abstract][Full Text] [Related]
[Next] [New Search]
