Sciweavers

2 search results - page 1 / 1
» Counting Parameterized Border Arrays for a Binary Alphabet
Sort
View
LATA
2009
Springer
13 years 11 months ago
Counting Parameterized Border Arrays for a Binary Alphabet
The parameterized pattern matching problem is a kind of pattern matching problem, where a pattern is considered to occur in a text when there exists a renaming bijection on the alp...
Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayu...
MST
2006
149views more  MST 2006»
13 years 4 months ago
Parameterized Intractability of Distinguishing Substring Selection
A central question in computational biology is the design of genetic markers to distinguish between two given sets of (DNA) sequences. This question is formalized as the NP-comple...
Jens Gramm, Jiong Guo, Rolf Niedermeier