Abstract
The increase in huge amount of data is seen clearly in present days because of requirement for storing more information. To extract certain data from this large database is a very difficult task, including text processing, information retrieval, text mining, pattern recognition and DNA sequencing. So we need concurrent events and high performance computing models for extracting the data. This will create a challenge to the researchers. One of the solutions is parallel algorithms for string matching on computing models. This work reviews typical algorithms and profiles their performance under various situations to study the influence of the number, the length, and the character distribution. This paper provides various available techniques that are suggested by several authors with its merits and demerits. In this we say that this survey will help the researchers to develop a better.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Grabowski, K.S.: Average-Optimal String Matching. Journal of Discrete Algorithms, 579–594 (2009)
Russo, L.L., Navarro, G., Oliveira, A., Morales, P.: Approximate String Matching with Compressed Indexes Algorithm, pp. 1105–1136 (2009)
Ilie, L., Navarro, G., Tinta, L.: The Longest Common Extension Problem, Revisited and Applications to Approximate String Searching. Journal of Discrete Algorithms, 418–428 (2010)
Fredriksson, K., Grabowski, S.: Average-Optimal String Matching. Journal of Discrete Algorithms, 579–594 (2009)
Bertsekas, D.P., Tsitsiklis, J.N.: Parallel and Distributed Computation. Numerical Methods. Prentice-Hall
Mohr, B.: Introduction to Parallel Computing. John von Neumann Institute for Computing (2006)
Kang, H.K.S.: A Pattern Group Partitioning for Parallel String Matching using a Pattern Grouping Metric. IEEE Communications Letters, 878–880 (2010)
Kim, H.J., Kim, H.S., Kang, S.: A Memory-Efficient Bit-Split Parallel String Matching Using Pattern Dividing for Intrusion Detection Systems. IEEE Transactions on Parallel and Distributed Systems (2011)
Viswanadha, R.S., Vinayababu, A.: Optimal Parallel algorithm for String Matching on Mesh Network Structure (2006)
Viswanadha, R.S., Babu, V.A., Mrudula, M.: Backend Engine for Parallel String Matching Using Boolean Matrix. In: IEEE on PAR ELEC, pp. 281–283 (2006)
Peltola, H., Tarhio, J.: Alternative Algorithms for Bit-Parallel String Matching, Finland (2001)
Viswanadha, R.S., Mantena, A.S.R., Babu, V., Raju, G.V.S.: Efficient Parallel Pattern Matching using Partition Method (2006)
Viswanadha, R.S., Babu, V.A., Raju, G.V.S., Madhavi, K.R.: W-Period Technique for Parallel String Matching (2007)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Someswararao, C., Raju, K.B., Appaji, S.V., Raju, S.V., Reddy, K.K.V.V.V.S. (2012). Recent Advancements in Parallel Algorithms for String Matching on Computing Models – A Survey and Experimental Results. In: Thilagam, P.S., Pais, A.R., Chandrasekaran, K., Balakrishnan, N. (eds) Advanced Computing, Networking and Security. ADCONS 2011. Lecture Notes in Computer Science, vol 7135. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-29280-4_32
Download citation
DOI: https://doi.org/10.1007/978-3-642-29280-4_32
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-29279-8
Online ISBN: 978-3-642-29280-4
eBook Packages: Computer ScienceComputer Science (R0)