Sciweavers

20 search results - page 4 / 4
» Indexing DNA Sequences Using q-Grams
Sort
View
CIKM
2009
Springer
13 years 9 months ago
Suffix trees for very large genomic sequences
A suffix tree is a fundamental data structure for string searching algorithms. Unfortunately, when it comes to the use of suffix trees in real-life applications, the current metho...
Marina Barsky, Ulrike Stege, Alex Thomo, Chris Upt...
BMCBI
2006
145views more  BMCBI 2006»
13 years 5 months ago
Fast-Find: A novel computational approach to analyzing combinatorial motifs
Background: Many vital biological processes, including transcription and splicing, require a combination of short, degenerate sequence patterns, or motifs, adjacent to defined seq...
Micah Hamady, Erin Peden, Rob Knight, Ravinder Sin...
FSTTCS
2000
Springer
13 years 8 months ago
Text Sparsification via Local Maxima
In this paper we investigate some properties and algorithms related to a text sparsification technique based on the identification of local maxima in the given string. As the numb...
Pierluigi Crescenzi, Alberto Del Lungo, Roberto Gr...
BMCBI
2005
60views more  BMCBI 2005»
13 years 5 months ago
PHACCS, an online tool for estimating the structure and diversity of uncultured viral communities using metagenomic information
Background: Phages, viruses that infect prokaryotes, are the most abundant microbes in the world. A major limitation to studying these viruses is the difficulty of cultivating the...
Florent Angly, Beltran Rodriguez-Brito, David Bang...
BMCBI
2005
127views more  BMCBI 2005»
13 years 5 months ago
Genomes are covered with ubiquitous 11 bp periodic patterns, the "class A flexible patterns"
Background: The genomes of prokaryotes and lower eukaryotes display a very strong 11 bp periodic bias in the distribution of their nucleotides. This bias is present throughout a g...
Etienne Larsabal, Antoine Danchin