367 related articles for article (PubMed ID: 18474508)
21. 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]
22. VariScan: Analysis of evolutionary patterns from large-scale DNA sequence polymorphism data.
Vilella AJ; Blanco-Garcia A; Hutter S; Rozas J
Bioinformatics; 2005 Jun; 21(11):2791-3. PubMed ID: 15814564
[TBL] [Abstract][Full Text] [Related]
23. QuickJoin--fast neighbour-joining tree reconstruction.
Mailund T; Pedersen CN
Bioinformatics; 2004 Nov; 20(17):3261-2. PubMed ID: 15201185
[TBL] [Abstract][Full Text] [Related]
24. Tracing evolutionary pressure.
Ye K; Vriend G; IJzerman AP
Bioinformatics; 2008 Apr; 24(7):908-15. PubMed ID: 18304936
[TBL] [Abstract][Full Text] [Related]
25. Automatic genome-wide reconstruction of phylogenetic gene trees.
Wapinski I; Pfeffer A; Friedman N; Regev A
Bioinformatics; 2007 Jul; 23(13):i549-58. PubMed ID: 17646342
[TBL] [Abstract][Full Text] [Related]
26. CAFE: a computational tool for the study of gene family evolution.
De Bie T; Cristianini N; Demuth JP; Hahn MW
Bioinformatics; 2006 May; 22(10):1269-71. PubMed ID: 16543274
[TBL] [Abstract][Full Text] [Related]
27. Inferring horizontal transfers in the presence of rearrangements by the minimum evolution criterion.
Birin H; Gal-Or Z; Elias I; Tuller T
Bioinformatics; 2008 Mar; 24(6):826-32. PubMed ID: 18203769
[TBL] [Abstract][Full Text] [Related]
28. 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]
29. 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]
30. In silico sequence evolution with site-specific interactions along phylogenetic trees.
Gesell T; von Haeseler A
Bioinformatics; 2006 Mar; 22(6):716-22. PubMed ID: 16332711
[TBL] [Abstract][Full Text] [Related]
31. PhyloGena--a user-friendly system for automated phylogenetic annotation of unknown sequences.
Hanekamp K; Bohnebeck U; Beszteri B; Valentin K
Bioinformatics; 2007 Apr; 23(7):793-801. PubMed ID: 17332025
[TBL] [Abstract][Full Text] [Related]
32. Using median sets for inferring phylogenetic trees.
Bernt M; Merkle D; Middendorf M
Bioinformatics; 2007 Jan; 23(2):e129-35. PubMed ID: 17237080
[TBL] [Abstract][Full Text] [Related]
33. 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]
34. Inferring evolutionary trees with PAUP*.
Wilgenbusch JC; Swofford D
Curr Protoc Bioinformatics; 2003 Feb; Chapter 6():Unit 6.4. PubMed ID: 18428704
[TBL] [Abstract][Full Text] [Related]
35. Interactive visualization software for exploring phylogenetic trees and clades.
Derthick M
Bioinformatics; 2008 Mar; 24(6):868-9. PubMed ID: 18263642
[TBL] [Abstract][Full Text] [Related]
36. Efficient inference of bacterial strain trees from genome-scale multilocus data.
Than C; Sugino R; Innan H; Nakhleh L
Bioinformatics; 2008 Jul; 24(13):i123-31. PubMed ID: 18586704
[TBL] [Abstract][Full Text] [Related]
37. 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]
38. 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]
39. Paloverde: an OpenGL 3D phylogeny browser.
Sanderson MJ
Bioinformatics; 2006 Apr; 22(8):1004-6. PubMed ID: 16500938
[TBL] [Abstract][Full Text] [Related]
40. 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]
[Previous] [Next] [New Search]
