Streaming k-Edit Approximate Pattern Matching via String Decomposition
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F23%3A10476418" target="_blank" >RIV/00216208:11320/23:10476418 - isvavai.cz</a>
Result on the web
<a href="https://doi.org/10.4230/LIPIcs.ICALP.2023.22" target="_blank" >https://doi.org/10.4230/LIPIcs.ICALP.2023.22</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.4230/LIPIcs.ICALP.2023.22" target="_blank" >10.4230/LIPIcs.ICALP.2023.22</a>
Alternative languages
Result language
angličtina
Original language name
Streaming k-Edit Approximate Pattern Matching via String Decomposition
Original language description
In this paper we give an algorithm for streaming k-edit approximate pattern matching which uses space Oe(k2) and time Oe(k2) per arriving symbol. This improves substantially on the recent algorithm of Kociumaka, Porat and Starikovskaya [22] which uses space Oe(k5) and time Oe(k8) per arriving symbol. In the k-edit approximate pattern matching problem we get a pattern P and text T and we want to identify all substrings of the text T that are at edit distance at most k from P. In the streaming version of this problem both the pattern and the text arrive in a streaming fashion symbol by symbol and after each symbol of the text we need to report whether there is a current suffix of the text with edit distance at most k from P. We measure the total space needed by the algorithm and time needed per arriving symbol.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
—
OECD FORD branch
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
Result continuities
Project
<a href="/en/project/GX19-27871X" target="_blank" >GX19-27871X: Efficient approximation algorithms and circuit complexity</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Others
Publication year
2023
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
Leibniz International Proceedings in Informatics, LIPIcs
ISBN
978-3-95977-278-5
ISSN
1868-8969
e-ISSN
—
Number of pages
14
Pages from-to
—
Publisher name
Schloss Dagstuhl Leibniz-Zentrum für Informatik
Place of publication
Wadern, DE
Event location
Paderborn, Germany
Event date
Jul 10, 2023
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—