Abstract
A string SāāāĪ£m can be viewed as a set of pairs \(\{ (s_i , i) \mid s_i\in S,\ i\in \{ 0,\ldots, m-1\} \}\). We follow the recent work on pattern matching with address errors and consider approximate pattern matching problems arising from the setting where errors are introduced to the location component (i), rather than the more traditional setting, where errors are introduced to the content itself (s i ). Specifically, we continue the work on string matching in the presence of address bit errors. In this paper, we consider the case where bits of i may be stuck, either in a consistent or transient manner. We formally define the corresponding approximate pattern matching problems, and provide efficient algorithms for their resolution.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Amir, A.: Asynchronous pattern matching. In: Lewenstein, M., Valiente, G. (eds.) CPM 2006. LNCS, vol.Ā 4009, pp. 1ā10. Springer, Heidelberg (2006) (invited talk)
Amir, A., Aumann, Y., Benson, G., Levy, A., Lipsky, O., Porat, E., Skiena, S., Vishne, U.: Pattern matching with address errors: Rearrangement distances. In: Proc. 17th ACM-SIAM Symp. on Discrete Algorithms, SODA (2006)
Amir, A., Aumann, Y., Benson, G., Levy, A., Lipsky, O., Porat, E., Skiena, S., Vishne, U.: Pattern matching with address errors: Rearrangement distances. Journal of Computer and System SciencesĀ 75(6), 359ā370 (2009)
Amir, A., Aumann, Y., Indyk, P., Levy, A., Porat, E.: Efficient computations of ā1 and āāāā rearrangement distances. Theoretical Computer ScienceĀ 410(43), 4382ā4390 (2009)
Amir, A., Aumann, Y., Kapah, O., Levy, A., Porat, E.: Approximate string matching with address bit errors. In: Ferragina, P., Landau, G.M. (eds.) CPM 2008. LNCS, vol.Ā 5029, pp. 118ā129. Springer, Heidelberg (2008)
Amir, A., Aumann, Y., Kapah, O., Levy, A., Porat, E.: Approximate string matching with address bit errors. Theoretical Computer ScienceĀ 410(51), 5334ā5346 (2009); Special Issue of CPM 2008 Best Papers
Amir, A., Cole, R., Hariharan, R., Lewenstein, M., Porat, E.: Overlap matching. Information and ComputationĀ 181(1), 57ā74 (2003)
Amir, A., Eisenberg, E., Porat, E.: Swap and mismatch edit distance. AlgorithmicaĀ 45(1), 109ā120 (2006)
Amir, A., Hartman, T., Kapah, O., Levy, A., Porat, E.: On the cost of interchange rearrangement in strings. SIAM Journal on ComputingĀ 39(4), 1444ā1461 (2009)
Amir, A., Levy, A.: String rearrangement metrics: A survey. In: Algorithms and Applications, pp. 1ā33 (2010)
Amir, A., Lewenstein, M., Porat, E.: Approximate swapped matching. Information Processing LettersĀ 83(1), 33ā39 (2002)
Bafna, V., Pevzner, P.A.: Sorting by transpositions. SIAM J. on Discrete MathematicsĀ 11, 221ā240 (1998)
Berman, P., Hannenhalli, S.: Fast sorting by reversal. In: Hirschberg, D.S., Myers, E.W. (eds.) CPM 1996. LNCS, vol.Ā 1075, pp. 168ā185. Springer, Heidelberg (1996)
Carpara, A.: Sorting by reversals is difficult. In: Proc. 1st Annual Intl. Conf. on Research in Computational Biology (RECOMB), pp. 75ā83. ACM Press, New York (1997)
Christie, D.A.: Sorting by block-interchanges. Information Processing LettersĀ 60, 165ā169 (1996)
Goldberg, A., Rao, S.: Beyond the flow decomposition barrier. J. of the ACMĀ 45(5), 783ā797 (1998)
Hennessy, J.L., Patterson, D.A.: Computer Architecture: A Quantitative Approach, 3rd edn. Morgan Kaufmann, San Francisco (2002)
Hopcroft, J., Karp, R.: An n 5/2 algorithm for maximum matchings in bipartite graphs. SIAM J. ComputingĀ 2(4), 225ā231 (1973)
Kapah, O., Landau, G.M., Levy, A., Oz, N.: Interchange rearrangement: The element-cost model. Theoretical Computer ScienceĀ 410(43), 4315ā4326 (2009)
Lowrance, R., Wagner, R.A.: An extension of the string-to-string correction problem. J. of the ACM, 177ā183 (1975)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
Ā© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Amir, A., Eisenberg, E., Keller, O., Levy, A., Porat, E. (2010). Approximate String Matching with Stuck Address Bits. In: Chavez, E., Lonardi, S. (eds) String Processing and Information Retrieval. SPIRE 2010. Lecture Notes in Computer Science, vol 6393. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-16321-0_41
Download citation
DOI: https://doi.org/10.1007/978-3-642-16321-0_41
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-16320-3
Online ISBN: 978-3-642-16321-0
eBook Packages: Computer ScienceComputer Science (R0)