87 related articles for article (PubMed ID: 8634902)
1. A simplified proof of the NP- and MAX SNP-hardness of multiple sequence tree alignment.
Wareham HT
J Comput Biol; 1995; 2(4):509-14. PubMed ID: 8634902
[TBL] [Abstract][Full Text] [Related]
2. On the complexity of multiple sequence alignment.
Wang L; Jiang T
J Comput Biol; 1994; 1(4):337-48. PubMed ID: 8790475
[TBL] [Abstract][Full Text] [Related]
3. Settling the intractability of multiple alignment.
Elias I
J Comput Biol; 2006 Sep; 13(7):1323-39. PubMed ID: 17037961
[TBL] [Abstract][Full Text] [Related]
4. Ancestral maximum likelihood of evolutionary trees is hard.
Addario-Berry L; Chor B; Hallett M; Lagergren J; Panconesi A; Wareham T
J Bioinform Comput Biol; 2004 Jun; 2(2):257-71. PubMed ID: 15297981
[TBL] [Abstract][Full Text] [Related]
5. Seeded tree alignment.
Lozano A; Pinter RY; Rokhlenko O; Valiente G; Ziv-Ukelson M
IEEE/ACM Trans Comput Biol Bioinform; 2008; 5(4):503-13. PubMed ID: 18989038
[TBL] [Abstract][Full Text] [Related]
6. Computational complexity of multiple sequence alignment with SP-score.
Just W
J Comput Biol; 2001; 8(6):615-23. PubMed ID: 11747615
[TBL] [Abstract][Full Text] [Related]
7. A short proof that phylogenetic tree reconstruction by maximum likelihood is hard.
Roch S
IEEE/ACM Trans Comput Biol Bioinform; 2006; 3(1):92-4. PubMed ID: 17048396
[TBL] [Abstract][Full Text] [Related]
8. Class of multiple sequence alignment algorithm affects genomic analysis.
Blackburne BP; Whelan S
Mol Biol Evol; 2013 Mar; 30(3):642-53. PubMed ID: 23144040
[TBL] [Abstract][Full Text] [Related]
9. A polynomial time solvable formulation of multiple sequence alignment.
Sze SH; Lu Y; Yang Q
J Comput Biol; 2006 Mar; 13(2):309-19. PubMed ID: 16597242
[TBL] [Abstract][Full Text] [Related]
10. Ancestral sequence alignment under optimal conditions.
Hudek AK; Brown DG
BMC Bioinformatics; 2005 Nov; 6():273. PubMed ID: 16293191
[TBL] [Abstract][Full Text] [Related]
11. On the quality of tree-based protein classification.
Lazareva-Ulitsky B; Diemer K; Thomas PD
Bioinformatics; 2005 May; 21(9):1876-90. PubMed ID: 15647305
[TBL] [Abstract][Full Text] [Related]
12. Finding a most parsimonious or likely tree in a network with respect to an alignment.
Kelk S; Pardi F; Scornavacca C; van Iersel L
J Math Biol; 2019 Jan; 78(1-2):527-547. PubMed ID: 30121824
[TBL] [Abstract][Full Text] [Related]
13. Hetero: a program to simulate the evolution of DNA on a four-taxon tree.
Jermiin LS; Ho SY; Ababneh F; Robinson J; Larkum AW
Appl Bioinformatics; 2003; 2(3):159-63. PubMed ID: 15130802
[TBL] [Abstract][Full Text] [Related]
14. Bayesian coestimation of phylogeny and sequence alignment.
Lunter G; Miklós I; Drummond A; Jensen JL; Hein J
BMC Bioinformatics; 2005 Apr; 6():83. PubMed ID: 15804354
[TBL] [Abstract][Full Text] [Related]
15. Optimal, efficient reconstruction of phylogenetic networks with constrained recombination.
Gusfield D; Eddhu S; Langley C
J Bioinform Comput Biol; 2004 Mar; 2(1):173-213. PubMed ID: 15272438
[TBL] [Abstract][Full Text] [Related]
16. Reconstructing ancestral genomic sequences by co-evolution: formal definitions, computational issues, and biological examples.
Tuller T; Birin H; Kupiec M; Ruppin E
J Comput Biol; 2010 Sep; 17(9):1327-44. PubMed ID: 20874411
[TBL] [Abstract][Full Text] [Related]
17. 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]
18. Towards integration of multiple alignment and phylogenetic tree construction.
Vingron M; von Haeseler A
J Comput Biol; 1997; 4(1):23-34. PubMed ID: 9109035
[TBL] [Abstract][Full Text] [Related]
19. Representation in stochastic search for phylogenetic tree reconstruction.
Weber G; Ohno-Machado L; Shieber S
J Biomed Inform; 2006 Feb; 39(1):43-50. PubMed ID: 16359929
[TBL] [Abstract][Full Text] [Related]
20. Maximum likelihood of phylogenetic networks.
Jin G; Nakhleh L; Snir S; Tuller T
Bioinformatics; 2006 Nov; 22(21):2604-11. PubMed ID: 16928736
[TBL] [Abstract][Full Text] [Related]
[Next] [New Search]
