Search data structures for skewed strings

DOI10.1007/3-540-44867-5_7MaRDI QIDQ4426347zbMATH OpenFDO

Authors Pierluigi Crescenzi, Roberto Grossi, Giuseppe F. Italiano

Publication date 16 September 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2647/26470081.htm

Mathematics Subject Classification ID

Data structures (68P05) Searching and sorting (68P10) Computing methodologies for text processing; mathematical typography (68U15)

Recommendations

• Data structures and algorithms for the string statistics problem
• A time and space efficient data structure for string searching on large texts
• Data structures and algorithms for approximate string matching
• scientific article; zbMATH DE number 2092676
• Indexing structures for approximate string matching
• Data structures for efficient string algorithms.
• Fast Searching in Packed Strings
• Fast searching in packed strings
• Construction of Fundamental Data Structures for Strings
• String searching algorithms revisited

This page was built for publication: Search data structures for skewed strings

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4426347)