TY - GEN

T1 - Property matching and weighted matching

AU - Amir, Amihood

AU - Chencinski, Eran

AU - Iliopoulos, Costas

AU - Kopelowitz, Tsvi

AU - Zhang, Hui

PY - 2006

Y1 - 2006

N2 - Pattern Matching with Properties (Property Matching, for short), involves a string matching between the pattern and the text, and the requirement that the text part satisfies some property. It is straightforward to do sequential matching in a text with properties. However, indexing in a text with properties becomes difficult if we desire the time to be output dependent. We present an algorithm for indexing a text with properties in O(nlog |∑| + n log log n) time for preprocessing and O(|P| log |∑| + toccπ) per query, where n is the length of the text, P is the sought pattern, ∑ is the alphabet, and toccπ is the number of occurrences of the pattern that satisfy some property π. As a practical use of Property Matching we show how to solve Weighted Matching problems using techniques from Property Matching, Weighted sequences have been introduced as a tool to handle a set of sequences that are not identical but have many local similarities. The weighted sequence is a "statistical image" of this set, where we are given the probability of every symbol's occurrence at every text location, Weighted matching problems are pattern matching problems where the given text is weighted. We present a reduction from Weighted Matching to Property Matching that allows off-the-shelf solutions to numerous weighted matching problems including indexing, swapped matching, parameterized matching, approximate matching, and many more. Assuming that one seeks the occurrence of pattern P with probability ε in weighted text T of length n, we reduce the problem to a property matching problem of pattern P in text T′ of length O(n(1/ε)2 log 1/ε).

AB - Pattern Matching with Properties (Property Matching, for short), involves a string matching between the pattern and the text, and the requirement that the text part satisfies some property. It is straightforward to do sequential matching in a text with properties. However, indexing in a text with properties becomes difficult if we desire the time to be output dependent. We present an algorithm for indexing a text with properties in O(nlog |∑| + n log log n) time for preprocessing and O(|P| log |∑| + toccπ) per query, where n is the length of the text, P is the sought pattern, ∑ is the alphabet, and toccπ is the number of occurrences of the pattern that satisfy some property π. As a practical use of Property Matching we show how to solve Weighted Matching problems using techniques from Property Matching, Weighted sequences have been introduced as a tool to handle a set of sequences that are not identical but have many local similarities. The weighted sequence is a "statistical image" of this set, where we are given the probability of every symbol's occurrence at every text location, Weighted matching problems are pattern matching problems where the given text is weighted. We present a reduction from Weighted Matching to Property Matching that allows off-the-shelf solutions to numerous weighted matching problems including indexing, swapped matching, parameterized matching, approximate matching, and many more. Assuming that one seeks the occurrence of pattern P with probability ε in weighted text T of length n, we reduce the problem to a property matching problem of pattern P in text T′ of length O(n(1/ε)2 log 1/ε).

UR - http://www.scopus.com/inward/record.url?scp=33746098933&partnerID=8YFLogxK

U2 - 10.1007/11780441_18

DO - 10.1007/11780441_18

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:33746098933

SN - 3540354557

SN - 9783540354550

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 188

EP - 199

BT - Combinatorial Pattern Matching - 17th Annual Symposium, CPM 2006, Proceedings

PB - Springer Verlag

T2 - 17th Annual Symposium on Combinatorial Pattern Matching, CPM 2006

Y2 - 5 July 2006 through 7 July 2006

ER -