Name
Title | ||
|---|---|---|
Parameterized Searching with Mismatches for Run-Length Encoded Strings - (Extended Abstract) |
Abstract | ||
|---|---|---|
Two strings y and y′ of equal length over respective alphabets Σ
y
and Σ
y′ are said to parameterized match if there exists a bijection π: Σ
y
→Σ
y′ such that π(y ) = y′ , i.e., renaming each character of y according to its corresponding element under π yields y′. (Here we assume that all symbols of both alphabets are used somewhere.) Two natural problems are then parameterized matching, which consists of finding all positions of some text x where a pattern y parameterized matches a substring of x , and approximate parameterized matching, which seeks, at each location of x , a bijection π maximizing the number of parameterized matches at that location.
|
Year | DOI | Venue |
|---|---|---|
2010 | 10.1007/978-3-642-16321-0_38 | SPIRE |
Keywords | Field | DocType |
run length encoding | Parameterized complexity,Computer science,Theoretical computer science | Conference |
Citations | PageRank | References |
0 | 0.34 | 8 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Alberto Apostolico | 1 | 1441 | 182.20 |
| Péter L. Erdös | 2 | 267 | 46.75 |
| Alpár Jüttner | 3 | 422 | 25.50 |