Skip to main content
SpringerLink
Log in
Book cover

International Symposium on String Processing and Information Retrieval

SPIRE 2004: String Processing and Information Retrieval pp 72–73Cite as

Permuted and Scaled String Matching

  • Conference paper

  • 717 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 3246))

Abstract

The goal of scaled permuted string matching is to find all occurrences of a pattern in a text, in all possible scales and permutations. Given a text of length n and a pattern of length m we present an O(n) algorithm.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Author information

Authors and Affiliations

  1. Holon Academic Institute of Technology, Israel

    Ayelet Butman

  2. Dept. of Computer Science, University of Haifa, Mount Carmel, Haifa, 31905, Israel

    Revital Eres & Gad M. Landau

Authors
  1. Ayelet Butman
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Revital Eres
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Gad M. Landau
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Georgia Institute of Technology and Università di Padova,  

    Alberto Apostolico

  2. Department of Information Engineering, University of Padova,  

    Massimo Melucci

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Butman, A., Eres, R., Landau, G.M. (2004). Permuted and Scaled String Matching. In: Apostolico, A., Melucci, M. (eds) String Processing and Information Retrieval. SPIRE 2004. Lecture Notes in Computer Science, vol 3246. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30213-1_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-30213-1_9

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-23210-0

  • Online ISBN: 978-3-540-30213-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation