Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

25

BIRD
2008
Springer

favoriteEmaildiscussreport

221views Bioinformatics» more BIRD 2008»

Comparison of Exact String Matching Algorithms for Biological Sequences

13 years 6 months ago

Comparison of Exact String Matching Algorithms for Biological Sequences

Download www.cs.hut.fi

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 addition, we introduce new variations of earlier algorithms. The results of the comparison show that the new algorithms are efficient in practice.

Petri Kalsi, Hannu Peltola, Jorma Tarhio

Real-time Traffic

Amino Acid Sequences | Bioinformatics | BIRD 2008 | Earlier Algorithms | Exact Matching |

claim paper

Related Content

» An Efficient Matching Algorithm for Encoded DNA Sequences and Binary Strings

» RMESH Algorithms for Parallel String Matching

» Spatial Representation for Efficient Sequence Classification

» SeqAn An efficient generic C library for sequence analysis

» Space Efficient Computation of Rare Maximal Exact Matches between Multiple Sequences

» Fast Motif Selection for Biological Sequences

» Survey of Biological High Performance Computing Algorithms Implementations and Outlook Res...

» A Fast Algorithm for Approximate String Matching on Gene Sequences

» Exact match search in sequence data using suffix trees

Post Info
More Details (n/a)

Added	18 Oct 2010
Updated	18 Oct 2010
Type	Conference
Year	2008
Where	BIRD
Authors	Petri Kalsi, Hannu Peltola, Jorma Tarhio

Comments (0)