scientific article; zbMATH DE number 1893562

MaRDI QIDQ4801183zbMATH OpenFDO

Authors Erik D. Demaine, J. Ian Munro, Alejandro Lopez-Ortiz

Publication date 7 April 2003

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

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20) Computing methodologies and applications (68U99)

Recommendations

• An experimental investigation of set intersection algorithms for text searching
• Efficient set intersection counting algorithm for text similarity measures
• scientific article; zbMATH DE number 1975035

Cited in

(8)

• scientific article; zbMATH DE number 2119687 (Why is no real title available?)
• scientific article; zbMATH DE number 1445373 (Why is no real title available?)
• An experimental investigation of set intersection algorithms for text searching
• Efficient optimally lazy algorithms for minimal-interval semantics
• Adaptive searching in succinctly encoded binary relations and tree-structured documents
• Trie-compressed adaptive set intersection
• Efficient set intersection counting algorithm for text similarity measures
• Combinatorial Pattern Matching

This page was built for publication:

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