EXPERIMENTAL RESULTS ON MULTIPLE PATTERN MATCHING ALGORITHMS FOR BIOLOGICAL SEQUENCES

Charalampos S. Kouzinopoulos, Panagiotis D. Michailidis, Konstantinos G. Margaritis

Abstract

With the remarkable increase in the number of DNA and proteins sequences, it is very important to study the performance of multiple pattern matching algorithms when querying sequence patterns in biological sequence databases. In this paper, we present a performance study of the running time of well known multiple pattern matching algorithms on widely used biological sequence databases containing the building blocks of nucleotides (in the case of nucleic acid sequence databases) and amino acids (in the case of protein sequence databases).

References

  1. Brudno, M. and Morgenstern, B. (2002). Fast and sensitive alignment of large genomic sequences. In IEEE Computer Society Bioinformatics Conference, volume 1, pages 138-147.
  2. Brudno, M., Steinkamp, R., and Morgenstern, B. (2004). The chaos/dialign www server for multiple alignment of genomic sequences. Nucleic Acids Research, 32:41-44.
  3. Buhler, J., Keich, U., and Sun, Y. (2005). Designing seeds for similarity search in genomic dna. Journal of Computer and System Sciences, 70(3):342-363.
  4. Hyyro, H., Juhola, M., and Vihinen, M. (2005). On exact string matching of unique oligonucleotides. Computers in Biology and Medicine, 35(2):173-181.
  5. Jaffe, J., Berg, H., and Church, G. (2004). Proteogenomic mapping as a complementary method to perform genome annotation. Proteomics, 4(1):59-77.
  6. Kalsi, P., Peltola, H., and Tarhio, T. (2008). Comparison of exact string matching algorithms for biological sequences. Communications in Computer and Information Science, pages 417-426.
  7. Kouzinopoulos, C. S. and Margaritis, K. G. (2010). Algorithms for multiple keyword matching: Survey and experimental results. Technical report.
  8. Michael, M., Dieterich, C., and Vingron, M. (2005). Siteblast-rapid and sensitive local alignment of genomic sequences employing motif anchors. Bioinformatics, 21(9):2093-2094.
  9. Navarro, G. and Raffinot, M. (2002). Flexible pattern matching in strings: practical on-line search algorithms for texts and biological sequences. Cambridge University Press.
  10. Sheik, S., Aggarwal, S. K., Poddar, A., Sathiyabhama, B., Balakrishna, N., and Sekar, K. (2005). Analysis of string-searching algorithms on biological sequence databases. Current Science, 89(2):368-374.
Download


Paper Citation


in Harvard Style

S. Kouzinopoulos C., D. Michailidis P. and G. Margaritis K. (2011). EXPERIMENTAL RESULTS ON MULTIPLE PATTERN MATCHING ALGORITHMS FOR BIOLOGICAL SEQUENCES . In Proceedings of the International Conference on Bioinformatics Models, Methods and Algorithms - Volume 1: BIOINFORMATICS, (BIOSTEC 2011) ISBN 978-989-8425-36-2, pages 274-277. DOI: 10.5220/0003133202740277


in Bibtex Style

@conference{bioinformatics11,
author={Charalampos S. Kouzinopoulos and Panagiotis D. Michailidis and Konstantinos G. Margaritis},
title={EXPERIMENTAL RESULTS ON MULTIPLE PATTERN MATCHING ALGORITHMS FOR BIOLOGICAL SEQUENCES},
booktitle={Proceedings of the International Conference on Bioinformatics Models, Methods and Algorithms - Volume 1: BIOINFORMATICS, (BIOSTEC 2011)},
year={2011},
pages={274-277},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0003133202740277},
isbn={978-989-8425-36-2},
}


in EndNote Style

TY - CONF
JO - Proceedings of the International Conference on Bioinformatics Models, Methods and Algorithms - Volume 1: BIOINFORMATICS, (BIOSTEC 2011)
TI - EXPERIMENTAL RESULTS ON MULTIPLE PATTERN MATCHING ALGORITHMS FOR BIOLOGICAL SEQUENCES
SN - 978-989-8425-36-2
AU - S. Kouzinopoulos C.
AU - D. Michailidis P.
AU - G. Margaritis K.
PY - 2011
SP - 274
EP - 277
DO - 10.5220/0003133202740277