Sciweavers

4 search results - page 1 / 1
» Efficient Exact Pattern-Matching in Proteomic Sequences
Sort
View
IWANN
2009
Springer
13 years 11 months ago
Efficient Exact Pattern-Matching in Proteomic Sequences
Abstract. This paper proposes a novel algorithm for complete exact patternmatching focusing the specificities of protein sequences (alphabet of 20 symbols) but, also highly efficie...
Sérgio A. D. Deusdado, Paulo M. M. Carvalho
CSB
2004
IEEE
177views Bioinformatics» more  CSB 2004»
13 years 8 months ago
Compressed Pattern Matching in DNA Sequences
We propose derivative Boyer-Moore (d-BM), a new compressed pattern matching algorithm in DNA sequences. This algorithm is based on the BoyerMoore method, which is one of the most ...
Lei Chen, Shiyong Lu, Jeffrey L. Ram
ICDE
2006
IEEE
178views Database» more  ICDE 2006»
14 years 6 months ago
Declarative Querying for Biological Sequences
The ongoing revolution in life sciences research is producing vast amounts of genetic and proteomic sequence data. Scientists want to pose increasingly complex queries on this dat...
Sandeep Tata, Jignesh M. Patel, James S. Friedman,...
BMCBI
2002
120views more  BMCBI 2002»
13 years 4 months ago
tacg - a grep for DNA
Background: Pattern matching is the core of bioinformatics; it is used in database searching, restriction enzyme mapping, and finding open reading frames. It is done repeatedly ov...
Harry Mangalam