65 search results - page 7 / 13 » On the Kolmogorov-Chaitin Complexity for short sequences |
BMCBI
2006
14 years 10 months ago
2006
Background: The problem of finding a Shortest Common Supersequence (SCS) of a set of sequences is an important problem with applications in many areas. It is a key problem in biol...
124
click to vote
FPL
2010
Springer
14 years 8 months ago
2010
Springer
We demonstrate how Field Programmable Gate Arrays (FPGAs) may be used to address the computing challenges associated with assembling genome sequences from recent ultra-high-through...
121
click to vote
BMCBI
2011
14 years 5 months ago
2011
Background: Computational analysis of metagenomes requires the taxonomical assignment of the genome contigs assembled from DNA reads of environmental samples. Because of the diver...
BMCBI
2008
14 years 10 months ago
2008
Background: Occult organizational structures in DNA sequences may hold the key to understanding functional and evolutionary aspects of the DNA molecule. Such structures can also p...
RECOMB
2004
Springer
15 years 10 months ago
2004
Springer
The challenge of similarity search in massive DNA sequence databases has inspired major changes in BLAST-style alignment tools, which accelerate search by inspecting only pairs of...