47 search results - page 2 / 10 » Compressed Pattern Matching in DNA Sequences |
BMCBI
2007
13 years 5 months ago
2007
Background: Computational methods to predict transcription factor binding sites (TFBS) based on exhaustive algorithms are guaranteed to find the best patterns but are often limite...
WALCOM
2007
IEEE
13 years 6 months ago
2007
IEEE
In this paper, we consider the pattern matching problem in DNA and RNA sequences where either the pattern or the text can be degenerate i.e. contain sets of characters. We present ...
CPM
1999
Springer
13 years 9 months ago
1999
Springer
We address the problem of string matching on Ziv-Lempel compressed text. The goal is to search a pattern in a text without uncompressing it. This is a highly relevant issue to keep...
BIRD
2008
Springer
13 years 7 months ago
2008
Springer
Exact matching of single patterns in DNA and amino acid sequences is studied. We performed an extensive experimental comparison of algorithms presented in the literature. In additi...
FPL
2003
Springer
13 years 10 months ago
2003
Springer
With an aim to understand the information encoded by DNA sequences, databases containing large amount of DNA sequence information are frequently compared and searched for matching ...