Skip to main content
SpringerLink
Log in

Indexed Approximate String Matching

  • Reference work entry
  • First Online:
Book cover Encyclopedia of Algorithms

  • 132 Accesses

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

Access this chapter

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 1,599.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 1,999.99
Price excludes VAT (USA)
  • Durable hardcover 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

Institutional subscriptions

Recommended Reading

  1. Amir A, Keselman D, Landau GM, Lewenstein M, Lewenstein N, Rodeh M (2000) Indexing and dictionary matching with one error. J Algorithms, 37(2):309–325

    Article  MathSciNet  MATH  Google Scholar 

  2. Belazzougui D (2009) Faster and space-optimal edit distance “1” dictionary. In: Proceedings of the 20th annual symposium on combinatorial pattern matching (CPM), Lille, pp 154–167

    Google Scholar 

  3. Belazzougui D (2014) Improved space-time tradeoffs for approximate full-text indexing with one edit error. Algorithmica. doi:10.1007/s00453-014-9873-9

    MathSciNet  MATH  Google Scholar 

  4. Buchsbaum AL, Goodrich MT, Westbrook JR (2000) Range searching over tree cross products. In: Proceedings of European symposium on algorithms, Saarbrücken, pp 120–131

    MATH  Google Scholar 

  5. Chan H-L, Lam T-W, Sung W-K, Tam S-L, Wong S-S (2011) A linear size index for approximate pattern matching. J Discr Algorithms 9(4):358–364

    Article  MathSciNet  MATH  Google Scholar 

  6. Chan H-L, Lam T-W, Sung W-K, Tam S-L, Wong S-S (2010) Compressed indexes for approximate string matching. Algorithmica 58(2):263–281

    Article  MathSciNet  MATH  Google Scholar 

  7. Navarro G, Chávez E (2006) A metric index for approximate string matching. Theor Comput Sci 352(1–3):266–279

    Article  MathSciNet  MATH  Google Scholar 

  8. Cobbs A (1995) Fast approximate matching using suffix trees. In: Proceedings of symposium on combinatorial pattern matching, Espoo, pp 41–54

    Google Scholar 

  9. Coelho LP, Oliveira AL (2006) Dotted suffix trees: a structure for approximate text indexing. In: SPIRE, Glasgow, pp 329–336

    Google Scholar 

  10. Cole R, Gottlieb LA, Lewenstein M (2004) Dictionary matching and indexing with errors and don’t cares. In: Proceedings of symposium on theory of computing, Chicago, pp 91–100

    MATH  Google Scholar 

  11. Epifanio C, Gabriele A, Mignosi F, Restivo A, Sciortino M (2007) Languages with mismatches. Theor Comput Sci 385(1–3):152–166

    Article  MathSciNet  MATH  Google Scholar 

  12. Gabriele A, Mignosi F, Restivo A, Sciortino M (2003) Indexing structures for approximate string matching. In: Proceedings of the 5th Italian conference on algorithms and complexity (CIAC), Rome, pp 140–151

    Google Scholar 

  13. Huynh TND, Hon WK, Lam TW, Sung WK (2006) Approximate string matching using compressed suffix arrays. Theor Comput Sci 352(1–3):240–249

    Article  MathSciNet  MATH  Google Scholar 

  14. Lam TW, Sung WK, Wong SS (2008) Improved approximate string matching using compressed suffix data structures. Algorithmica 51(3): 298–314

    Article  MathSciNet  MATH  Google Scholar 

  15. Maaß MG, Nowak J (2007) Text indexing with errors. J Discr Algorithms 5(4):662–681

    Article  MathSciNet  MATH  Google Scholar 

  16. Myers EG (1994) A sublinear algorithm for approximate keyword searching. Algorithmica 12: 345–374

    Article  MathSciNet  MATH  Google Scholar 

  17. Navarro G, Baeza-Yates R (2000) A hybrid indexing method for approximate string matching. J Discr Algorithms 1(1):205–209

    MathSciNet  Google Scholar 

  18. Navarro G, Baeza-Yates RA, Sutinen E, Tarhio J (2001) Indexing methods for approximate string matching. IEEE Data Eng Bull 24(4):19–27

    Google Scholar 

  19. Tsur D (2010) Fast index for approximate string matching. J Discr Algorithms 8(4):339–345

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, National University of Singapore, Singapore, Singapore

    Wing-Kin Sung

Authors
  1. Wing-Kin Sung
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Wing-Kin Sung .

Editor information

Editors and Affiliations

  1. Department of Electrical Engineering and Computer Science, Northwestern University, Evanston, IL, USA

    Ming-Yang Kao

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer Science+Business Media New York

About this entry

Cite this entry

Sung, WK. (2016). Indexed Approximate String Matching. In: Kao, MY. (eds) Encyclopedia of Algorithms. Springer, New York, NY. https://doi.org/10.1007/978-1-4939-2864-4_188

Download citation

Publish with us

Policies and ethics

Search

Navigation