198 search results - page 35 / 40 » Efficient computation of absent words in genomic sequences |
RECOMB
2003
Springer
14 years 8 months ago
2003
Springer
A few models have appeared in recent years that consider not only the way substitutions occur through evolutionary history at each site of a genome, but also the way the process c...
BMCBI
2007
13 years 8 months ago
2007
Background: Maximum parsimony phylogenetic tree reconstruction from genetic variation data is a fundamental problem in computational genetics with many practical applications in p...
JBI
2002
13 years 8 months ago
2002
Rapid advances in genome sequencing and gene expression microarray technologies are providing unprecedented opportunities to identify specific genes involved in complex biological...
TCS
2008
13 years 8 months ago
2008
The longest common subsequence(LCS) problem is one of the classical and wellstudied problems in computer science. The computation of the LCS is a frequent task in DNA sequence ana...
RECOMB
2000
Springer
14 years 4 days ago
2000
Springer
In physical mapping, one orders a set of genetic landmarks or a library of cloned fragments of DNA according to their position in the genome. Our approach to physical mapping divi...