• Documents
  • Authors
  • Tables
  • Other Seers ▼
    RefSeer AckSeer CollabSeer SeerSeer
  • Log in
  • Sign up
  • MetaCart

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations | Disambiguate

Text indexing with errors (2005)

Cached

  • Download as a PDF

Download Links

  • [www14.in.tum.de]
  • [wwwmayr.informatik.tu-muenchen.de]
  • [www14.informatik.tu-muenchen.de]
  • [wwwmayr.in.tum.de]
  • [wwwmayr.informatik.tu-muenchen.de]

  • Other Repositories/Bibliography

  • DBLP
  • Save to List
  • Add to Collection
  • Correct Errors
  • Monitor Changes
by Moritz G. Maaß , Johannes Nowak
Citations:5 - 0 self
  • Summary
  • Active Bibliography
  • Co-citation
  • Clustered Documents
  • Version History

BibTeX

@TECHREPORT{Maaß05textindexing,
    author = {Moritz G. Maaß and Johannes Nowak},
    title = {Text indexing with errors},
    institution = {},
    year = {2005}
}

Bookmark

citeulike Connotea Bibsonomy Del.icio.us Digg Reddit

OpenURL

 

Abstract

Citations

851 Binary codes capable of correcting deletions, insertions, and reversals. Soviet Physics Doklady 10: 707–710 - Levenshtein - 1966
773 Algorithms on Strings, Trees and Sequences - Gusfield - 1997
560 G: Suffix arrays: a new method for on-line string searches - Manber, Myers - 1993
493 A space-economical suffix tree construction algorithm - MCCREIGHT - 1976
306 A guided tour to approximate string matching - Navarro
275 Error detecting and error correcting codes - Hamming - 1950
269 On-line construction of suffix trees - Ukkonen - 1995
179 Average Case Analysis of Algorithms on Sequences - Szpankowski - 2001
172 Compressed suffix arrays and suffix trees with applications to text indexing and string matching - GROSSI, S
156 Algorithms for approximate string matching - Ukkonen - 1985
146 Scaling and related techniques for geometry problems - Gabow, Bentley, et al. - 1984
142 G: Opportunistic data structures with applications - Ferragina, Manzini
118 Optimal suffix tree construction with large alphabets - Farach - 1997
89 A sublinear algorithm for approximate keyword searching - Myers - 1994
63 Nearest neighbors in high-dimensional spaces - Indyk - 2004
56 Sublinear approximate string matching and biological applications - Chang, Lawler - 1994
53 Approximate string-matching over suffix trees - Ukkonen - 1993
52 Asymptotical growth of a class of random trees - Pittel - 1985
47 Lower bounds for highdimensional nearest neighbor search and related problems - Borodin, Ostrovsky, et al. - 1999
46 Efficient algorithms for document retrieval problems - Muthukrishnan
46 A hybrid indexing method for approximate string matching - Navarro, Baeza-Yates
42 Dictionary matching and indexing with errors and don’t cares - Cole, Gottlieb, et al.
36 Fast approximate matching using suffix trees - Cobbs - 1995
36 Asymptotic properties of data compression and suffix trees - Szpankowski - 1993
34 Optimal exact string matching based on suffix arrays - Abouelhoda, Ohlebusch, et al. - 2002
18 Text indexing and dictionary matching with one error - Amir, Keselman, et al. - 2000
18 Range searching over tree cross products - Buchsbaum, Goodrich, et al. - 2000
18 Time-space tradeoffs, multiparty communication complexity, and nearest neighbor problems - Beame, Vee
16 A metric index for approximate string matching - Navarro, Chávez
16 A linear lower bound on index size for text retrieval - Demaine, López-Ortiz - 1975
14 Dictionary look-up with one error - Yao, Yao - 1997
10 Tighter bounds for nearest neighbor search and related problems in the cell probe model - BARKOL, RABANI - 2000
6 A new method for approximate indexing and dictionary lookup with one error - Maas, Nowak - 2005
4 Stølting Brodal and Leszek G¸asieniec. Approximate dictionary queries - Gerth - 1996
3 Indexing structures for approximate string matching - Gabriele, Mignosi, et al. - 2003
3 Erkki Sutinen, and Jorma Tarhio. Indexing methods for approximate string matching - Navarro, Baeza-Yates - 2001
3 Dictionary look-up with small errors - Yao, Yao - 1995
2 Apostolico and Wojciech Szpankowski. Self-alignments in words and their applications - Alberto - 1992
2 Linear-time construction of suffix arrays (extended abstract - Kim, Sim, et al. - 2003
2 Linear pattern matching - Weiner - 1973
1 Stølting Brodal and Srinivasan Venkatesh. Improved bounds for dictionary lookup with one error - Gerth - 2000
1 ärkk äinen and Peter Sanders. Simple linear work suffix array construction - Juha - 2003
1 Average-case analysis of approximate trie search - Maaß - 2004
1 A new indexing method for approximate pattern matching with one mismatch. Master’s thesis, Fakult ät f ür Informatik, Technische Universit ät M ünchen, Boltzmannstr - Nowak - 2004
The National Science Foundation
  • About CiteSeerX
  • Submit Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2010 The Pennsylvania State University