Abstract
This paper proposes a novel algorithm for complete exact pattern-matching focusing the specificities of protein sequences (alphabet of 20 symbols) but, also highly efficient considering larger alphabets. The searching strategy uses large search windows allowing multiple alignments per iteration. A new filtering heuristic, named compatibility rule, contributed decisively to the efficiency improvement. The new algorithm’s performance is, on average, superior in comparison with its best-rated competitors.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Knuth, D.E., Morris, J.H., Pratt, V.R.: Fast pattern matching in strings. SIAM J. Comput. 6(2), 323–350 (1977)
Boyer, R.S., Moore, J.S.: A fast string searching algorithm. Commun. Assoc. Comput. Mach. 20(10), 762–772 (1977)
Horspool, R.N.: Practical fast searching in strings. Software - Practice & Experience 10(6), 501–506 (1980)
Sunday, D.M.: A very fast substring search algorithm. Commun. Assoc. Comput. Mach. 33(8), 132–142 (1990)
Kim, S.: A new string-pattern matching algorithm using partitioning and hashing efficiently. Journal of Experimental Algorithmics (JEA) 4(2) (1999)
Crochemore, M., Czumaj, A., Gasieniec, L., Jarominek, S., Lecroq, T., Plandowski, W., Rytter, W.: Speeding up Two String Matching Algorithms. Algorithmica 12(4/5), 247–267 (1994)
Baeza-Yates, R.A., Gonnet, G.H.: A new approach to text searching. Commun. ACM 35(10), 74–82 (1992)
Karp, R.M., Rabin, M.O.: Efficient randomized pattern-matching algorithms. IBM J. Res. Dev. 31(2), 249–260 (1987)
Franek, F., Jennings, C.G., Smyth, W.F.: A Simple Fast Hybrid Pattern-Matching Algorithm. In: Apostolico, A., Crochemore, M., Park, K. (eds.) CPM 2005. LNCS, vol. 3537, pp. 288–297. Springer, Heidelberg (2005)
Navarro, G., Raffinot, M.: Fast and Flexible String Matching by Combining Bitparallelism and Suffix automata. ACM Journal of Experimental Algorithms 5(4), 1–36 (2000)
Crochemore, M., Rytter, W.: Text algorithms. Oxford University Press, Oxford (1994)
Peltola, H., Tarhio, J.: Alternative Algorithms for Bit-Parallel String Matching. In: Nascimento, M.A., de Moura, E.S., Oliveira, A.L. (eds.) SPIRE 2003. LNCS, vol. 2857, pp. 80–93. Springer, Heidelberg (2003)
Lecroq, T.: Fast exact string matching algorithms. Information Processing Letters 102, 229–235 (2007)
Wu, S., Manber, U.: A fast algorithm for multi-pattern searching. TR-94-17, Department of Computer Science, University of Arizona, Tucson (1994)
Michailidis, P.D., Maragaritis, K.G.: On-line String Matching Algorithms: Survey and Experimental Results. International Journal of Computer Mathematics 76(4), 411–434 (2001)
Lecroq, T.: Experimental Results on String Matching Algorithms. Software - Pratice and Experience 25(7), 727–765 (1995)
Smyth, B.: Computing Patterns in Strings. Pearson Addison-Wesley, London (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Deusdado, S., Carvalho, P. (2009). Efficient Exact Pattern-Matching in Proteomic Sequences. In: Omatu, S., et al. Distributed Computing, Artificial Intelligence, Bioinformatics, Soft Computing, and Ambient Assisted Living. IWANN 2009. Lecture Notes in Computer Science, vol 5518. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02481-8_178
Download citation
DOI: https://doi.org/10.1007/978-3-642-02481-8_178
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-02480-1
Online ISBN: 978-3-642-02481-8
eBook Packages: Computer ScienceComputer Science (R0)