4759 search results - page 9 / 952 » Parallelizing the Phylogeny Problem |
IWANN
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. ZARAMIT is an information system capable of fully automated phylogeny reconstruction. Methods have been tailored to mitochondrial DNA sequences, with focus on subproblem ...
ISAAC
2003
Springer
14 years 27 days ago
2003
Springer
In this paper some of the most fundamental problems in computational biology are proved intractable. The following problems are shown NP-hard for all binary or larger alphabets und...
CORR
2011
Springer
13 years 2 months ago
2011
Springer
Historical linguistics aims at inferring the most likely language phylogenetic tree starting from information concerning the evolutionary relatedness of languages. The available i...
CPM
2009
Springer
14 years 2 months ago
2009
Springer
The haplotype inference problem (HIP) asks to find a set of haplotypes which resolve a given set of genotypes. This problem is of enormous importance in many practical fields, su...
ICCS
2001
Springer
14 years 5 days ago
2001
Springer
Abstract. Phylogeny reconstruction from molecular data poses complex optimization problems: almost all optimization models are NP-hard and thus computationally intractable. Yet app...