Circuit Complexity of Regular Languages
- 作者Michal Koucký
- 卷第45卷
- 期第4期
- 印刷ISSN1432-4350
- 电子ISSN1433-0490
- 文件大小315.90KB
- 发表时间2009-11
- DOI10.1007/s00224-009-9180-z
- 页码865-879
Faster index for property matchingCostas S. Iliopoulos; M. Sohel Rahman · 2008
Indexing Factors with GapsCostas S. Iliopoulos; M. Sohel Rahman · 2009
Optimal prefix and suffix queries on textsMaxime Crochemore; Costas S. Iliopoulos; M. Sohel Rahman · 2008
New efficient algorithms for the LCS and constrained LCS problemsCostas S. Iliopoulos; M. Sohel Rahman · 2008
Algorithms for computing variants of the longest common subsequence problemCostas S. Iliopoulos; M. Sohel Rahman · 2008
Improved algorithms for the range next value problem and applicationsMaxime Crochemore; Costas S. Iliopoulos; Marcin Kubica; M. Sohel Rahman; German Tischler; Tomasz Waleń · 2012
A New Approach to Pattern Matching in Degenerate DNA/RNA Sequences and Distributed Pattern MatchingCostas S. Iliopoulos; Laurent Mouchard; M. Sohel Rahman · 2008