198 search results - page 5 / 40 » Efficient computation of absent words in genomic sequences |
101
click to vote
BMCBI
2010
15 years 1 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...
111
click to vote
BMCBI
2006
15 years 1 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...
113
click to vote
CEC
2007
IEEE
15 years 5 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...
115
click to vote
RECOMB
2004
Springer
16 years 1 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...
102
click to vote
JCB
2007
15 years 1 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...