Sciweavers

3 search results - page 1 / 1
» Haplotype Inferring Via Galled-Tree Networks Is NP-Complete
Sort
View
COCOON
2008
Springer
13 years 6 months ago
Haplotype Inferring Via Galled-Tree Networks Is NP-Complete
The problem of determining haplotypes from genotypes has gained considerable prominence in the research community since the beginning of the HapMap project. Here the focus is on de...
Arvind Gupta, Ján Manuch, Ladislav Stacho, ...
ISBRA
2007
Springer
13 years 11 months ago
Algorithm for Haplotype Inferring Via Galled-Tree Networks with Simple Galls
Arvind Gupta, Ján Manuch, Ladislav Stacho, ...
SP
2008
IEEE
122views Security Privacy» more  SP 2008»
13 years 4 months ago
Large-scale phylogenetic analysis on current HPC architectures
Abstract. Phylogenetic inference is considered a grand challenge in Bioinformatics due to its immense computational requirements. The increasing popularity and availability of larg...
Michael Ott, Jaroslaw Zola, Srinivas Aluru, Andrew...