The k-mappability problem revisited

Amihood Amir; Itai Boneh; Eitan Kondratovsky

doi:10.4230/LIPIcs.CPM.2021.5

The k-mappability problem revisited

Amihood Amir, Itai Boneh, Eitan Kondratovsky

Department of Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

1 Scopus citations

Abstract

The k-mappability problem has two integers parameters m and k. For every subword of size m in a text S, we wish to report the number of indices in S in which the word occurs with at most k mismatches. The problem was lately tackled by Alzamel et al. [1]. For a text with constant alphabet S and k ϵ O(1), they present an algorithm with linear space and O(n logk+1 n) time. For the case in which k = 1 and a constant size alphabet, a faster algorithm with linear space and O(n log(n) log log(n)) time was presented in [2]. In this work, we enhance the techniques of [2] to obtain an algorithm with linear space and O(n log(n)) time for k = 1. Our algorithm removes the constraint of the alphabet being of constant size. We also present linear algorithms for the case of k = 1, |S| ϵ O(1) and m =Ω(√n).

Original language	English
Title of host publication	32nd Annual Symposium on Combinatorial Pattern Matching, CPM 2021
Editors	Pawel Gawrychowski, Tatiana Starikovskaya
Publisher	Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
ISBN (Electronic)	9783959771863
DOIs	https://doi.org/10.4230/LIPIcs.CPM.2021.5
State	Published - 1 Jul 2021
Event	32nd Annual Symposium on Combinatorial Pattern Matching, CPM 2021 - Wroclaw, Poland Duration: 5 Jul 2021 → 7 Jul 2021

Publication series

Name	Leibniz International Proceedings in Informatics, LIPIcs
Volume	191
ISSN (Print)	1868-8969

Conference

Conference	32nd Annual Symposium on Combinatorial Pattern Matching, CPM 2021
Country/Territory	Poland
City	Wroclaw
Period	5/07/21 → 7/07/21

Bibliographical note

Publisher Copyright:
© Amihood Amir, Itai Boneh, and Eitan Kondratovsky.

Funding

Funding Amihood Amir: Partly supported by ISF grant 1475/18, BSF grant 2018141 and the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme grant agreement No 683064. Itai Boneh: Partly supported by ISF grant 1475/75. Eitan Kondratovsky: Partly supported by ISF grant 1475/18. Amihood Amir: Partly supported by ISF grant 1475/18, BSF grant 2018141 and the European Research Council (ERC) under the European Union's Horizon 2020 research and innovation programme grant agreement No 683064 Partly supported by ISF grant 1475/75. Partly supported by ISF grant 1475/18.

Funders	Funder number
Horizon 2020 Framework Programme	1475/75, 683064
European Commission
European Commission
United States-Israel Binational Science Foundation	2018141
Israel Science Foundation	1475/18

Keywords

Hamming Distance
Pattern Matching
Suffix Array
Suffix Tree

Access to Document

10.4230/LIPIcs.CPM.2021.5

Cite this

Amir, A., Boneh, I., & Kondratovsky, E. (2021). The k-mappability problem revisited. In P. Gawrychowski, & T. Starikovskaya (Eds.), 32nd Annual Symposium on Combinatorial Pattern Matching, CPM 2021 Article 5 (Leibniz International Proceedings in Informatics, LIPIcs; Vol. 191). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.CPM.2021.5

@inproceedings{4c9919a5ac3e4af6801f91391cd6705a,

title = "The k-mappability problem revisited",

abstract = "The k-mappability problem has two integers parameters m and k. For every subword of size m in a text S, we wish to report the number of indices in S in which the word occurs with at most k mismatches. The problem was lately tackled by Alzamel et al. [1]. For a text with constant alphabet S and k ϵ O(1), they present an algorithm with linear space and O(n logk+1 n) time. For the case in which k = 1 and a constant size alphabet, a faster algorithm with linear space and O(n log(n) log log(n)) time was presented in [2]. In this work, we enhance the techniques of [2] to obtain an algorithm with linear space and O(n log(n)) time for k = 1. Our algorithm removes the constraint of the alphabet being of constant size. We also present linear algorithms for the case of k = 1, |S| ϵ O(1) and m =Ω(√n).",

keywords = "Hamming Distance, Pattern Matching, Suffix Array, Suffix Tree",

author = "Amihood Amir and Itai Boneh and Eitan Kondratovsky",

note = "Publisher Copyright: {\textcopyright} Amihood Amir, Itai Boneh, and Eitan Kondratovsky.; 32nd Annual Symposium on Combinatorial Pattern Matching, CPM 2021 ; Conference date: 05-07-2021 Through 07-07-2021",

year = "2021",

month = jul,

day = "1",

doi = "10.4230/LIPIcs.CPM.2021.5",

language = "אנגלית",

series = "Leibniz International Proceedings in Informatics, LIPIcs",

publisher = "Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing",

editor = "Pawel Gawrychowski and Tatiana Starikovskaya",

booktitle = "32nd Annual Symposium on Combinatorial Pattern Matching, CPM 2021",

address = "גרמניה",

}

Amir, A, Boneh, I & Kondratovsky, E 2021, The k-mappability problem revisited. in P Gawrychowski & T Starikovskaya (eds), 32nd Annual Symposium on Combinatorial Pattern Matching, CPM 2021., 5, Leibniz International Proceedings in Informatics, LIPIcs, vol. 191, Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 32nd Annual Symposium on Combinatorial Pattern Matching, CPM 2021, Wroclaw, Poland, 5/07/21. https://doi.org/10.4230/LIPIcs.CPM.2021.5

The k-mappability problem revisited. / Amir, Amihood; Boneh, Itai; Kondratovsky, Eitan.
32nd Annual Symposium on Combinatorial Pattern Matching, CPM 2021. ed. / Pawel Gawrychowski; Tatiana Starikovskaya. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 2021. 5 (Leibniz International Proceedings in Informatics, LIPIcs; Vol. 191).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - The k-mappability problem revisited

AU - Amir, Amihood

AU - Boneh, Itai

AU - Kondratovsky, Eitan

PY - 2021/7/1

Y1 - 2021/7/1

N2 - The k-mappability problem has two integers parameters m and k. For every subword of size m in a text S, we wish to report the number of indices in S in which the word occurs with at most k mismatches. The problem was lately tackled by Alzamel et al. [1]. For a text with constant alphabet S and k ϵ O(1), they present an algorithm with linear space and O(n logk+1 n) time. For the case in which k = 1 and a constant size alphabet, a faster algorithm with linear space and O(n log(n) log log(n)) time was presented in [2]. In this work, we enhance the techniques of [2] to obtain an algorithm with linear space and O(n log(n)) time for k = 1. Our algorithm removes the constraint of the alphabet being of constant size. We also present linear algorithms for the case of k = 1, |S| ϵ O(1) and m =Ω(√n).

AB - The k-mappability problem has two integers parameters m and k. For every subword of size m in a text S, we wish to report the number of indices in S in which the word occurs with at most k mismatches. The problem was lately tackled by Alzamel et al. [1]. For a text with constant alphabet S and k ϵ O(1), they present an algorithm with linear space and O(n logk+1 n) time. For the case in which k = 1 and a constant size alphabet, a faster algorithm with linear space and O(n log(n) log log(n)) time was presented in [2]. In this work, we enhance the techniques of [2] to obtain an algorithm with linear space and O(n log(n)) time for k = 1. Our algorithm removes the constraint of the alphabet being of constant size. We also present linear algorithms for the case of k = 1, |S| ϵ O(1) and m =Ω(√n).

KW - Hamming Distance

KW - Pattern Matching

KW - Suffix Array

KW - Suffix Tree

UR - http://www.scopus.com/inward/record.url?scp=85115202374&partnerID=8YFLogxK

U2 - 10.4230/LIPIcs.CPM.2021.5

DO - 10.4230/LIPIcs.CPM.2021.5

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:85115202374

T3 - Leibniz International Proceedings in Informatics, LIPIcs

BT - 32nd Annual Symposium on Combinatorial Pattern Matching, CPM 2021

A2 - Gawrychowski, Pawel

A2 - Starikovskaya, Tatiana

PB - Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing

T2 - 32nd Annual Symposium on Combinatorial Pattern Matching, CPM 2021

Y2 - 5 July 2021 through 7 July 2021

ER -

The k-mappability problem revisited

Abstract

Publication series

Conference

Bibliographical note

Funding

Keywords

Access to Document

Other files and links

Fingerprint

Cite this