default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Discrete Algorithms, Volume 37
Volume 37, March 2016
- Jakub Radoszewski, Tomasz Radzik
:
2015 London Stringology Days and London Algorithmic Workshop (LSD & LAW). 1-2 - Christophe Vroland, Mikaël Salson, Sébastien Bini, Hélène Touzet:
Approximate search of short patterns with high error rates using the 01⁎0 lossless seeds. 3-16 - Anthony J. Cox, Fabio Garofalo, Giovanna Rosone, Marinella Sciortino:
Lightweight LCP construction for very large collections of strings. 17-33 - William H. A. Tustumi, Simon Gog, Guilherme P. Telles, Felipe A. Louza:
An improved algorithm for the all-pairs suffix-prefix problem. 34-43 - Laurent Bulteau, Guillaume Fertin, Christian Komusiewicz:
(Prefix) reversal distance for (signed) strings with few blocks or small alphabets. 44-55 - Bastien Cazaux, Eric Rivals:
A linear time algorithm for Shortest Cyclic Cover of Strings. 56-67 - Gerold Jäger, Sharlee Climer, Weixiong Zhang:
The complete parsimony haplotype inference problem and algorithms based on integer programming, branch-and-bound and Boolean satisfiability. 68-83
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-04 01:28 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:
