Abstract
We describe a substring search problem that arises in group presentation simplification processes. We suggest a two-level searching model: skip and match levels. We give two timestamp algorithms which skip searching parts of the text where there are no matches at all and prove their correctness. At the match level, we consider Harrison signature, Karp-Rabin fingerprint, Bloom filter and automata based matching algorithms and present experimental performance figures.
Partially supported by the Australian Research Council.
Partially supported by an Australian Overseas Postgraduate Research Scholarship.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Alfred V. Aho (1990): Algorithms for finding patterns in strings, in Handbook of theoretical computer science, Volume A (Jan van Leeuwen, ed.), 256–300, Elsevier.
Alfred V. Aho and Margaret J. Corasick (1975): Efficient string matching: An aid to bibliographic search, Comm. ACM 18, 333–340.
Alfred V. Aho, John E. Hopcroft and Jeffrey D. Ullman (1974): The Design and Analysis of Computer Algorithms, Addison-Wesley.
Burton H. Bloom (1970): Space/time tradeoffs in hash coding with allowable errors, Comm. ACM 13, 422–426.
John Cannon and George Havas (1992): Algorithms for groups, Austral. Comp. J. 24, 51–60.
G.H. Gonnet and R. Baeza-Yates (1991): Handbook of algorithms and data structures, Addison-Wesley.
Malcolm C. Harrison (1971): Implementation of the substring test by hashing, Comm. ACM 14, 777–779.
George Havas (1974): A Reidemeister-Schreier Program, in Proc. Second Internat. Conf. Theory of Groups (M.F. Newman, ed.) [Lecture Notes in Mathematics 372], 347–356, Springer-Verlag.
George Havas, P.E. Kenne, J.S. Richardson and E.F.Robertson (1984): A Tietze transformation program, in Computational Group Theory (Michael D. Atkinson, ed.), 67–71, Academic Press
George Havas and M.F. Newman (1980): Application of computers to questions like those of Burnside, in Burnside Groups (J.L. Mennicke, ed.) [Lecture Notes in Mathematics 806], 211–230, Springer-Verlag.
George Havas and Mark Ollila (1993): Application of substring searching methods to group presentations, Australian Computer Science Communications 15, 587–593.
George Havas, J.S. Richardson and L.S. Sterling (1979): The last of the Fibonacci groups, Proc. Roy. Soc. Edinburgh 83A, 199–203.
Richard M. Karp and Michael O. Rabin (1987): Efficient randomized pattern matching algorithms, IBM J. Res. Develop. 31, 249–260.
W. Magnus, A. Karrass and D. Solitar (1966): Combinatorial group theory: presentations of groups in terms of generators and relations, Interscience.
M.F. Newman (1990): Proving a group infinite, Arch. Math. 54, 209–211.
Chris H. Perleberg (1993): Three Longest Substring Algorithms, in First South American Workshop on String Processing, (Ricardo Baeza-Yates and Nivio Ziviani, eds), 135–149, Universidade Federal de Minas Gerais, Belo Horizonte, Brazil.
E.F. Roberston (1988): Tietze transformations with weighted substring search, J. Symbolic Computation 6, 59–64.
M. Schönert et al (1993): GAP — Groups, Algorithms, and Programming, Lehrstuhl D für Mathematik, Rheinisch-Westfälische Technische Hochschule, Aachen, Germany.
Charles C. Sims (1994): Computation with finitely presented groups, Cambridge University Press.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Havas, G., Lian, J.X. (1994). A new problem in string searching. In: Du, DZ., Zhang, XS. (eds) Algorithms and Computation. ISAAC 1994. Lecture Notes in Computer Science, vol 834. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58325-4_235
Download citation
DOI: https://doi.org/10.1007/3-540-58325-4_235
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58325-7
Online ISBN: 978-3-540-48653-4
eBook Packages: Springer Book Archive