Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPrague Stringology Conference 2006: Prague, Czech Republic
- Jan Holub, Jan Zdárek:
Proceedings of the Prague Stringology Conference, Prague, Czech Republic, August 28-30, 2006. Department of Computer Science and Engineering, Faculty of Electrical Engineering, Czech Technical University 2006, ISBN 80-01-03533-6
Invited Talk
- Gad M. Landau:
Can dist tables be merged in linear time - An Open Problem. 1
Regular Contributions
- Frantisek Franek, Qian Yang:
An asymptotic lower bound for the maximal-number-of-runs function. 3-8 - Giuseppe Lancia, Franca Rinaldi, Romeo Rizzi:
Flipping letters to minimize the support of a string. 9-17 - Jan Supol, Borivoj Melichar:
Two-dimensional bitwise memory matrix: A tool for optimal parallel approximate pattern matching. 18-28 - Kimmo Fredriksson, Szymon Grabowski:
Efficient algorithms for (delta, gamma, alpha)-matching. 29-40 - Manolis Christodoulakis, Costas S. Iliopoulos, Mohammad Sohel Rahman, William F. Smyth:
Song classifications for dancing. 41-48 - Domenico Cantone, Salvatore Cristofaro, Simone Faro:
On some combinatorial problems concerning the harmonic structure of musical chord sequences. 49-64 - Srecko Brlek, Xavier Provençal:
On the problem of deciding if a polyomino tiles the plane by translation. 65-76 - Daniel Prusa, Václav Hlavác:
2D context-free grammars: Mathematical formulae recognition. 77-89 - Tinus Strauss, Derrick G. Kourie, Bruce W. Watson:
A concurrent specification of Brzozowski's DFA construction algorithm. 90-99 - Bruce W. Watson, Derrick G. Kourie, Ernest Ketcha Ngassam, Tinus Strauss, Loek G. Cleophas:
Efficient automata constructions and approximate automata. 100-107 - Ernest Ketcha Ngassam, Derrick G. Kourie, Bruce W. Watson:
On implementation and performance of table-driven DFA-based string processors. 108-122 - Christelle Melo de Lima, Laurent Guéguen, Christian Gautier, Didier Piau:
A Markovian approach for the analysis of the gene structure. 123-136 - Corné de Ridder, Derrick G. Kourie, Bruce W. Watson:
FireµSat: An algorithm to detect microsatellites in DNA. 137-150 - Ehud S. Conley, Shmuel Tomi Klein
:
Using alignment for multilingual text compression. 151-161 - Shmuel Tomi Klein, Tamar C. Serebro, Dana Shapira:
Modeling delta encoding of compressed files. 162-170 - Miri Ben-Nissan, Shmuel Tomi Klein:
Working with compressed concordances. 171-181 - Pierre Peterlongo, Julien Allali, Marie-France Sagot:
The gapped-factor tree. 182-196 - Shunsuke Inenaga, Masayuki Takeda:
Sparse compact directed acyclic word graphs. 197-211 - Yasuto Higa, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda:
Reachability on suffix tree graphs. 212-225 - Rafal Przywarski, Szymon Grabowski, Gonzalo Navarro, Alejandro Salinger:
FM-KZ: An even simpler alphabet-independent FM-index. 226-241
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-04-18 20:18 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
