Combinatorial Pattern Matching
From MaRDI portal
Publication:5315348
DOI10.1007/B98377zbMATH Open1103.68485MaRDI QIDQ5315348FDOQ5315348
Authors: Ricardo Baeza-Yates 
Publication date: 7 September 2005
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Recommendations
Cited In (27)
- An output sensitive solution to the set union and intersection problem
- Dynamic set intersection
- Title not available (Why is that?)
- Fast Intersection Algorithms for Sorted Sequences
- Irredundant Set Faster Than O(2 n )
- Alternation and redundancy analysis of the intersection problem
- From time to space: fast algorithms that yield small and fast data structures
- Set intersection and sequence matching with mismatch counting
- New algorithms on wavelet trees and applications to information retrieval
- Title not available (Why is that?)
- Fast set intersection and two-patterns matching
- An efficient method to evaluate intersections on big data sets
- Fast Evaluation of Union-Intersection Expressions
- An experimental investigation of set intersection algorithms for text searching
- Algorithms and Computation
- Fast set intersection and two-patterns matching
- Adaptive searching in succinctly encoded binary relations and tree-structured documents
- Efficient optimally lazy algorithms for minimal-interval semantics
- \(k\)-difference matching in amortized linear time for all the words in a text
- Stochastic Algorithms: Foundations and Applications
- Trie-compressed adaptive set intersection
- Efficient set intersection counting algorithm for text similarity measures
- A fast algorithm for finding interlocking sets
- Intersection in integer inverted indices
- Finding and enumerating large intersections
- Intersection reporting on two collections of disjoint sets
- Evaluation of General Set Expressions
This page was built for publication: Combinatorial Pattern Matching
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5315348)
