Sciweavers

4 search results - page 1 / 1
» Conservation of Combinatorial Structures in Evolution Scenar...
Sort
View
RECOMB
2004
Springer
14 years 4 months ago
Conservation of Combinatorial Structures in Evolution Scenarios
Sèverine Bérard, Anne Bergeron, Cedr...
WABI
2005
Springer
132views Bioinformatics» more  WABI 2005»
13 years 10 months ago
Perfect Sorting by Reversals Is Not Always Difficult
—We propose new algorithms for computing pairwise rearrangement scenarios that conserve the combinatorial structure of genomes. More precisely, we investigate the problem of sort...
Sèverine Bérard, Anne Bergeron, Cedr...
COCOON
2006
Springer
13 years 8 months ago
Reconstructing Evolution of Natural Languages: Complexity and Parameterized Algorithms
In a recent article, Nakhleh, Ringe and Warnow introduced perfect phylogenetic networks--a model of language evolution where languages do not evolve via clean speciation--and form...
Iyad A. Kanj, Luay Nakhleh, Ge Xia
BMCBI
2007
137views more  BMCBI 2007»
13 years 4 months ago
Bayesian refinement of protein functional site matching
Background: Matching functional sites is a key problem for the understanding of protein function and evolution. The commonly used graph theoretic approach, and other related appro...
Kanti V. Mardia, Vysaul B. Nyirongo, Peter J. Gree...