Sciweavers

77 search results - page 4 / 16
» Reconstructing Phylogenetic Networks Using Maximum Parsimony
Sort
View
BIBE
2005
IEEE
13 years 10 months ago
Improved Phylogenetic Motif Detection Using Parsimony
We have recently demonstrated (La et al, Proteins, 58:2005) that sequence fragments approximating the overall familial phylogeny, called phylogenetic motifs (PMs), represent a pro...
Usman Roshan, Dennis R. Livesay, David La
CCECE
2006
IEEE
13 years 10 months ago
Dynamic and Parallel Approaches to Optimal Evolutionary Tree Construction
Phylogenetic trees are commonly reconstructed based on hard optimization problems such as Maximum parsimony (MP) and Maximum likelihood (ML). Conventional MP heuristics for produc...
Anupam Bhattacharjee, Kazi Zakia Sultana, Zalia Sh...
IJCBDD
2008
113views more  IJCBDD 2008»
13 years 4 months ago
Parsimony accelerated Maximum Likelihood searches
: Phylogenetic search is a key tool used in a variety of biological research endeavors. However, this search problem is known to be computationally difficult, due to the astronomic...
Kenneth Sundberg, Timothy O'Connor, Hyrum Carroll,...
CORR
2007
Springer
165views Education» more  CORR 2007»
13 years 4 months ago
Comparison of Tree-Child Phylogenetic Networks
Abstract—Phylogenetic networks are a generalization of phylogenetic trees that allow for the representation of non-treelike evolutionary events, like recombination, hybridization...
Gabriel Cardona, Francesc Rosselló, Gabriel...
BIBM
2008
IEEE
134views Bioinformatics» more  BIBM 2008»
13 years 10 months ago
New Approaches to Compare Phylogenetic Search Heuristics
We present new and novel insights into the behavior of two maximum parsimony heuristics for building evolutionary trees of different sizes. First, our results show that the heuris...
Seung-Jin Sul, Suzanne Matthews, Tiffani L. Willia...