198 search results - page 5 / 40 » Efficient computation of absent words in genomic sequences |
78
Voted
BMCBI
2010
14 years 9 months ago
2010
Background: Protein-coding gene detection in prokaryotic genomes is considered a much simpler problem than in intron-containing eukaryotic genomes. However there have been reports...
BMCBI
2006
14 years 9 months ago
2006
Background: Genome sequences vary strongly in their repetitiveness and the causes for this are still debated. Here we propose a novel measure of genome repetitiveness, the index o...
79
Voted
CEC
2007
IEEE
15 years 1 months ago
2007
IEEE
Abstract-- Shotgun sequencing is the state-of-the-art to decode genome sequence. However this technique needs a lot of fragments. Combining those fragments correctly requires enorm...
RECOMB
2004
Springer
15 years 10 months ago
2004
Springer
An efficient algorithm is presented for detecting approximate tandem repeats in genomic sequences. The algorithm is based on a flexible statistical model which allows a wide range...
76
Voted
JCB
2007
14 years 9 months ago
2007
The understanding of genome rearrangements is an important endeavor in comparative genomics. A major computational problem in this field is finding a shortest sequence of genome...