Publications
Preprints
About UCL Open: Env.
Aims and Scope
Editorial Board
Indexing
APCs
How to cite
Publishing policies
Editorial policy
Peer review policy
Equality, Diversity & Inclusion
About UCL Press
Contact us
Information for authors
How it works
Benefits of publishing with us
Submit
How to submit
Preparing your manuscript
Article types
Open Data
ORCID
APCs
Contributor agreement
Information for reviewers
Review process
How to peer review
Peer review policy
Register Dashboard
Search

Browse
Publications
Preprints
About
About UCL Open: Env.
Aims and Scope
Editorial Board
Indexing
APCs
How to cite
Publishing policies
Editorial policy
Peer review policy
Equality, Diversity & Inclusion
About UCL Press
Contact us
For authors
Information for authors
How it works
Benefits of publishing with us
Submit
How to submit
Preparing your manuscript
Article types
Open Data
ORCID
APCs
Contributor agreement
For reviewers
Information for reviewers
Review process
How to peer review
Peer review policy
My ScienceOpen

Register Dashboard
Search
22
views
20
references
 Top references
cited by
16
    
0 reviews
 Review
0
comments
 Comment
0
recommends
+1 Recommend
0 collections
    0
    shares
      2,127
      similar
       All similar
      • Record: found
      • Abstract: not found
      • Book Chapter: not found
      Graph-Theoretic Concepts in Computer Science : 24th International Workshop, WG’98, Smolenice Castle, Slovak Republic, June 18-20, 1998. Proceedings 

      Finding Maximal Quasiperiodicities in Strings

      other
      Author(s): ,
      Publication date (Online):
      Publisher: Springer Berlin Heidelberg

      Read this book at

      Publisher
      Buy book
      Bookmark
          There is no author summary for this book yet. Authors can add summaries to their books on ScienceOpen to make them more accessible to a non-specialist audience.

          Related collections

          Most cited references20

          • Record: found
          • Abstract: not found
          • Article: not found

          On-line construction of suffix trees

          E Ukkonen (1995)
          Article 0 comments Cited 158 times – based on 0 reviews     Review now
          Article has an altmetric score of 6
            Bookmark
            • Record: found
            • Abstract: not found
            • Conference Proceedings: not found

            Linear pattern matching algorithms

            Peter Weiner (1973)
            Article 0 comments Cited 149 times – based on 0 reviews
            Article has an altmetric score of 3
              Bookmark
              • Record: found
              • Abstract: not found
              • Book: not found

              Algorithms on Strings, Trees, and Sequences

              Dan Gusfield (1997)
              Book 0 comments Cited 52 times – based on 0 reviews
              Article has an altmetric score of 25
                Bookmark
                All references

                Author and book information

                Book Chapter
                Publication date (Print): 2000
                Publication date (Online): November 7 2002
                Pages: 397-411
                DOI: 10.1007/3-540-45123-4_33
                SO-VID: ac5d8ee7-a8c6-4af4-b2a3-9cf98f8cb088
                History

                Data availability:

                Comments

                Comment on this book

                Book chapters

                Similar content2,127

                See all similar

                Cited by16

                See all cited by