Sciweavers

136 search results - page 6 / 28
» The ed-tree: An Index for Large DNA Sequence Databases
Sort
View
PADL
2009
Springer
14 years 8 months ago
Using Bloom Filters for Large Scale Gene Sequence Analysis in Haskell
Analysis of biological data often involves large data sets and computationally expensive algorithms. Databases of biological data continue to grow, leading to an increasing demand ...
Ketil Malde, Bryan O'Sullivan
BMCBI
2010
121views more  BMCBI 2010»
13 years 5 months ago
A grammar-based distance metric enables fast and accurate clustering of large sets of 16S sequences
Background: We propose a sequence clustering algorithm and compare the partition quality and execution time of the proposed algorithm with those of a popular existing algorithm. T...
David J. Russell, Samuel F. Way, Andrew K. Benson,...
CIKM
2009
Springer
13 years 11 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...
DATESO
2007
157views Database» more  DATESO 2007»
13 years 9 months ago
Index-Based Approach to Similarity Search in Protein and Nucleotide Databases
When searching databases of nucleotide or protein sequences, finding a local alignment of two sequences is one of the main tasks. Since the sizes of available databases grow const...
David Hoksza, Tomás Skopal
BMCBI
2006
86views more  BMCBI 2006»
13 years 7 months ago
MCALIGN2: Faster, accurate global pairwise alignment of non-coding DNA sequences based on explicit models of indel evolution
Background: Non-coding DNA sequences comprise a very large proportion of the total genomic content of mammals, most other vertebrates, many invertebrates, and most plants. Unravel...
Jun Wang, Peter D. Keightley, Toby Johnson