default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheoretical Computer Science, Volume 710
Volume 710, February 2018
- Maxime Crochemore, Solon P. Pissis
:
Advances in Algorithms & Combinatorics on Strings (Honoring 60th birthday for Prof. Costas S. Iliopoulos). 1 - Amihood Amir, Mika Amit, Gad M. Landau, Dina Sokol:
Period recovery of strings over the Hamming and edit distances. 2-18 - Salvatore Aronica, Alessio Langiu, Francesca Marzi, Salvatore Mazzola, Filippo Mignosi:
On optimal parsing for LZ78-like compressors. 19-28 - Sang Won Bae, Inbok Lee:
On finding a longest common palindromic subsequence. 29-34 - Sukhyeun Cho, Joong Chae Na, Jeong Seop Sim:
An O(n2logm)-time algorithm for the boxed-mesh permutation pattern matching problem. 35-43 - Jacqueline W. Daykin, Frantisek Franek, Jan Holub, A. S. M. Sohidull Islam, W. F. Smyth:
Reconstructing a string from its Lyndon arrays. 44-51 - Jacqueline W. Daykin, Richard Groult, Yannick Guesnet, Thierry Lecroq, Arnaud Lefebvre, Martine Léonard, Élise Prieur-Gaston:
A survey of string orderings and their application to the Burrows-Wheeler transform. 52-65 - Pawel Gawrychowski, Gad M. Landau, Shay Mozes, Oren Weimann:
The nearest colored node in a tree. 66-73 - Roberto Grossi, Giulia Menconi, Nadia Pisanti, Roberto Trani, Søren Vind:
Motif trie: An efficient text index for pattern discovery with don't cares. 74-87 - Joel Helling, Patrick J. Ryan, W. F. Smyth, Michael Soltys:
Constructing an indeterminate string from its associated graph. 88-96 - Michael Hoffmann, John Iacono, Patrick K. Nicholson, Rajeev Raman:
Encoding nearest larger values. 97-115 - Nantia D. Iakovidou, Nikolaos A. Laskaris, Kostas Tsichlas, Yannis Manolopoulos, Manolis Christodoulakis, Eleftherios S. Papathanasiou, Savvas S. Papacostas, Georgios D. Mitsis:
A symbolic dynamics approach to Epileptic Chronnectomics: Employing strings to predict crisis onset. 116-125 - Tomasz Kociumaka, Jakub Pachocki, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
On the string consensus problem and the Manhattan sequence consensus problem. 126-138 - Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
Efficient algorithms for shortest partial seeds in words. 139-147 - Joong Chae Na, Hyunjoon Kim, Seunghwan Min, Heejin Park, Thierry Lecroq, Martine Léonard, Laurent Mouchard, Kunsoo Park:
FM-index of alignment with gaps. 148-157
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 2025-12-23 00:32 CET 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:
