Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Discrete Algorithms, Volume 20
Volume 20, May 2013
- Maxime Crochemore, Jacqueline W. Daykin
:
StringMasters 2011 Special Issue. 1-2 - Gregory Kucherov:
On-line construction of position heaps. 3-11 - Johra Muhammad Moosa, M. Sohel Rahman, Fatema Tuz Zohora:
Computing a longest common subsequence that is almost increasing on sequences having no repeated elements. 12-20 - Corné de Ridder, Derrick G. Kourie, Bruce W. Watson, T. R. Fourie, P. V. Reyneke:
Fine-tuning the search for microsatellites. 21-37 - Golnaz Badkobeh:
Infinite words containing the minimal number of repetitions. 38-42 - Andrew Baker, Antoine Deza, Frantisek Franek:
A computational framework for determining run-maximal strings. 43-50 - Michalis Christou, Tomás Flouri, Costas S. Iliopoulos, Jan Janousek, Borivoj Melichar, Solon P. Pissis, Jan Zdárek:
Tree template matching in unranked ordered trees. 51-60 - Zbigniew Adamczyk, Wojciech Rytter:
A note on a simple computation of the maximal suffix of a string. 61-64 - Alessio Langiu:
On parsing optimality for dictionary-based text compression - the Zip case. 65-70
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-22 21:00 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:
