35 citations · 113 across the 47 of their papers we have counts for
Showing 2006Show all
3 papers · 1 filter
cs.DS2006
Improved Approximate String Matching and Regular Expression Matching on Ziv-Lempel Compressed Texts
Philip Bille, Rolf Fagerberg, Inge Li Goertz
We study the approximate string matching and regular expression matching problem for the case when the text to be searched is compressed with the Ziv-Lempel adaptive dictionary com…
cs.DS2006★ 2 cited
The Tree Inclusion Problem: In Linear Space and Faster
Philip Bille, Inge Li Goertz
Given two rooted, ordered, and labeled trees and the tree inclusion problem is to determine if can be obtained from by deleting nodes in . This problem has recen…
cs.DS2006★ 6 cited
New Algorithms for Regular Expression Matching
Philip Bille
In this paper we revisit the classical regular expression matching problem, namely, given a regular expression and a string , decide if matches one of the strings specif…