37
views
0
recommends
+1 Recommend
0 collections
    0
    shares
      • Record: found
      • Abstract: not found
      • Book Chapter: not found
      Combinatorial Pattern Matching 

      Linear-Time Construction of Suffix Arrays

      other
      , , ,
      Springer Berlin Heidelberg

      Read this book at

      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 references18

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

          Suffix Arrays: A New Method for On-Line String Searches

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

            On-line construction of suffix trees

            E Ukkonen (1995)
              Bookmark
              • Record: found
              • Abstract: not found
              • Article: not found

              Fast Algorithms for Finding Nearest Common Ancestors

                Bookmark

                Author and book information

                Book Chapter
                2003
                May 27 2003
                : 186-199
                10.1007/3-540-44888-8_14
                cc6986e6-e06d-47d5-9ffb-33880bc5db1e
                History

                Comments

                Comment on this book

                Book chapters

                Similar content3,600

                Cited by18