Sciweavers

431 search results - page 31 / 87
» Drawing Phylogenetic Trees
Sort
View
JCB
1998
105views more  JCB 1998»
14 years 11 months ago
Constructing and Counting Phylogenetic Invariants
Abstract. The method of invariants is an approach to the problem of reconstructing the phylogenetic tree of a collection of m taxa using nucleotide sequence data. Models for the re...
Steven N. Evans, Xiaowen Zhou
TCBB
2010
166views more  TCBB 2010»
14 years 10 months ago
Approximate Maximum Parsimony and Ancestral Maximum Likelihood
— We explore the maximum parsimony (MP) and ancestral maximum likelihood (AML) criteria in phylogenetic tree reconstruction. Both problems are NP hard, so we seek approximate sol...
Noga Alon, Benny Chor, Fabio Pardi, Anat Rapoport
WABI
2010
Springer
168views Bioinformatics» more  WABI 2010»
14 years 9 months ago
The Complexity of Inferring a Minimally Resolved Phylogenetic Supertree
Abstract. A recursive algorithm by Aho, Sagiv, Szymanski, and Ullman [1] forms the basis for many modern rooted supertree methods employed in Phylogenetics. However, as observed by...
Jesper Jansson, Richard S. Lemence, Andrzej Lingas
ALMOB
2008
85views more  ALMOB 2008»
14 years 12 months ago
Noisy: Identification of problematic columns in multiple sequence alignments
Motivation: Sequence-based methods for phylogenetic reconstruction from (nucleic acid) sequence data are notoriously plagued by two effects: homoplasies and alignment errors. Larg...
Andreas W. M. Dress, Christoph Flamm, Guido Fritzs...
77
Voted
BMCBI
2007
147views more  BMCBI 2007»
14 years 12 months ago
MaxAlign: maximizing usable data in an alignment
Background: The presence of gaps in an alignment of nucleotide or protein sequences is often an inconvenience for bioinformatical studies. In phylogenetic and other analyses, for ...
Rodrigo Gouveia-Oliveira, Peter Wad Sackett, Ander...