199 related articles for article (PubMed ID: 18428706)
1. What if I don't have a tree? Split decomposition and related models.
Huson DH
Curr Protoc Bioinformatics; 2003 May; Chapter 6():Unit 6.7. PubMed ID: 18428706
[TBL] [Abstract][Full Text] [Related]
2. SplitsTree: analyzing and visualizing evolutionary data.
Huson DH
Bioinformatics; 1998; 14(1):68-73. PubMed ID: 9520503
[TBL] [Abstract][Full Text] [Related]
3. Constructing splits graphs.
Dress AW; Huson DH
IEEE/ACM Trans Comput Biol Bioinform; 2004; 1(3):109-15. PubMed ID: 17048386
[TBL] [Abstract][Full Text] [Related]
4. Computing recombination networks from binary sequences.
Huson DH; Kloepper TH
Bioinformatics; 2005 Sep; 21 Suppl 2():ii159-65. PubMed ID: 16204096
[TBL] [Abstract][Full Text] [Related]
5. DupTree: a program for large-scale phylogenetic analyses using gene tree parsimony.
Wehe A; Bansal MS; Burleigh JG; Eulenstein O
Bioinformatics; 2008 Jul; 24(13):1540-1. PubMed ID: 18474508
[TBL] [Abstract][Full Text] [Related]
6. Drawing rooted phylogenetic networks.
Huson DH
IEEE/ACM Trans Comput Biol Bioinform; 2009; 6(1):103-9. PubMed ID: 19179703
[TBL] [Abstract][Full Text] [Related]
7. Reconstructing recombination network from sequence data: the small parsimony problem.
Nguyen CT; Nguyen NB; Sung WK; Zhang L
IEEE/ACM Trans Comput Biol Bioinform; 2007; 4(3):394-402. PubMed ID: 17666759
[TBL] [Abstract][Full Text] [Related]
8. Getting a tree fast: Neighbor Joining, FastME, and distance-based methods.
Desper R; Gascuel O
Curr Protoc Bioinformatics; 2006 Oct; Chapter 6():Unit 6.3. PubMed ID: 18428768
[TBL] [Abstract][Full Text] [Related]
9. Introduction to inferring evolutionary relationships.
Page RD
Curr Protoc Bioinformatics; 2003 Feb; Chapter 6():Unit 6.1. PubMed ID: 18428703
[TBL] [Abstract][Full Text] [Related]
10. From a phylogenetic tree to a reticulated network.
Makarenkov V; Legendre P
J Comput Biol; 2004; 11(1):195-212. PubMed ID: 15072696
[TBL] [Abstract][Full Text] [Related]
11. IQPNNI: moving fast through tree space and stopping in time.
Vinh le S; Von Haeseler A
Mol Biol Evol; 2004 Aug; 21(8):1565-71. PubMed ID: 15163768
[TBL] [Abstract][Full Text] [Related]
12. 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]
13. Phylocomposer and phylodirector: analysis and visualization of transducer indel models.
Holmes I
Bioinformatics; 2007 Dec; 23(23):3263-4. PubMed ID: 17804439
[TBL] [Abstract][Full Text] [Related]
14. 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]
15. Tracing evolutionary pressure.
Ye K; Vriend G; IJzerman AP
Bioinformatics; 2008 Apr; 24(7):908-15. PubMed ID: 18304936
[TBL] [Abstract][Full Text] [Related]
16. 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]
17. Approximate maximum parsimony and ancestral maximum likelihood.
Alon N; Chor B; Pardi F; Rapoport A
IEEE/ACM Trans Comput Biol Bioinform; 2010; 7(1):183-7. PubMed ID: 20150680
[TBL] [Abstract][Full Text] [Related]
18. Optimizing phylogenetic networks for circular split systems.
Phipps P; Bereg S
IEEE/ACM Trans Comput Biol Bioinform; 2012; 9(2):535-47. PubMed ID: 21788677
[TBL] [Abstract][Full Text] [Related]
19. 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]
20. Data structures for parsimony correlation and biosequence co-evolution.
Hochberg R; Milam TL
J Comput Biol; 2014 Apr; 21(4):361-9. PubMed ID: 19563266
[TBL] [Abstract][Full Text] [Related]
[Next] [New Search]
