Efficient Construction of the BWT for Repetitive Text Using String Compression

Diego Díaz-Domínguez; Gonzalo Navarro

doi:10.4230/LIPIcs.CPM.2022.29

Efficient Construction of the BWT for Repetitive Text Using String Compression

Tutkimustuotos: Artikkeli kirjassa/raportissa/konferenssijulkaisussa › Konferenssiartikkeli › Tieteellinen › vertaisarvioitu

Alkuperäiskieli	englanti
Otsikko	33rd Annual Symposium on Combinatorial Pattern Matching, CPM 2022
Toimittajat	Hideo Bannai, Jan Holub
Kustantaja	Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
Julkaisupäivä	1 kesäk. 2022
Sivut	29:1--29:18
Artikkeli no	29
ISBN (elektroninen)	978-3-95977-234-1
DOI - pysyväislinkit	https://doi.org/10.4230/LIPIcs.CPM.2022.29
Tila	Julkaistu - 1 kesäk. 2022
OKM-julkaisutyyppi	A4 Artikkeli konferenssijulkaisuussa
Tapahtuma	33rd Annual Symposium on Combinatorial Pattern Matching, CPM 2022 - Prague, Tšekki Kesto: 27 kesäk. 2022 → 29 kesäk. 2022

Julkaisusarja

Nimi	Leibniz International Proceedings in Informatics, LIPIcs
Vuosikerta	223
ISSN (painettu)	1868-8969

Lisätietoja

Publisher Copyright:
© Diego Daz-Domnguez and Gonzalo Navarro; licensed under Creative Commons License CC-BY 4.0

Tieteenalat

113 Tietojenkäsittely- ja informaatiotieteet

Pääsy asiakirjaan

10.4230/LIPIcs.CPM.2022.29Lisenssi: CC BY

LIPIcs-CPM-2022-29Lopullinen julkaistu versio, 817 KBLisenssi: CC BY

Siteeraa tätä

Díaz-Domínguez, D., & Navarro, G. (2022). Efficient Construction of the BWT for Repetitive Text Using String Compression. teoksessa H. Bannai, & J. Holub (Toimittajat), 33rd Annual Symposium on Combinatorial Pattern Matching, CPM 2022 (Sivut 29:1--29:18). Artikkeli 29 (Leibniz International Proceedings in Informatics, LIPIcs; Vuosikerta 223). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.CPM.2022.29

Díaz-Domínguez, Diego ; Navarro, Gonzalo. / Efficient Construction of the BWT for Repetitive Text Using String Compression. 33rd Annual Symposium on Combinatorial Pattern Matching, CPM 2022. Toimittaja / Hideo Bannai ; Jan Holub. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 2022. Sivut 29:1--29:18 (Leibniz International Proceedings in Informatics, LIPIcs).

@inproceedings{98d35f9494734c28aed13b2e944390f8,

title = "Efficient Construction of the BWT for Repetitive Text Using String Compression",

keywords = "BWT, repetitive text, string compression, 113 Computer and information sciences",

author = "Diego D{\'i}az-Dom{\'i}nguez and Gonzalo Navarro",

note = "Publisher Copyright: {\textcopyright} Diego Daz-Domnguez and Gonzalo Navarro; licensed under Creative Commons License CC-BY 4.0; 33rd Annual Symposium on Combinatorial Pattern Matching, CPM 2022 ; Conference date: 27-06-2022 Through 29-06-2022",

year = "2022",

month = jun,

day = "1",

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

language = "English",

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

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

pages = "29:1----29:18",

editor = "Hideo Bannai and Jan Holub",

booktitle = "33rd Annual Symposium on Combinatorial Pattern Matching, CPM 2022",

address = "Germany",

}

Díaz-Domínguez, D & Navarro, G 2022, Efficient Construction of the BWT for Repetitive Text Using String Compression. julkaisussa H Bannai & J Holub (toim), 33rd Annual Symposium on Combinatorial Pattern Matching, CPM 2022., 29, Leibniz International Proceedings in Informatics, LIPIcs, Vuosikerta 223, Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, Sivut 29:1--29:18, 33rd Annual Symposium on Combinatorial Pattern Matching, CPM 2022, Prague, Tšekki, 27/06/2022. https://doi.org/10.4230/LIPIcs.CPM.2022.29

Efficient Construction of the BWT for Repetitive Text Using String Compression. / Díaz-Domínguez, Diego; Navarro, Gonzalo.
33rd Annual Symposium on Combinatorial Pattern Matching, CPM 2022. toim. / Hideo Bannai; Jan Holub. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 2022. s. 29:1--29:18 29 (Leibniz International Proceedings in Informatics, LIPIcs; Vuosikerta 223).

Tutkimustuotos: Artikkeli kirjassa/raportissa/konferenssijulkaisussa › Konferenssiartikkeli › Tieteellinen › vertaisarvioitu

TY - GEN

T1 - Efficient Construction of the BWT for Repetitive Text Using String Compression

AU - Díaz-Domínguez, Diego

AU - Navarro, Gonzalo

N1 - Publisher Copyright: © Diego Daz-Domnguez and Gonzalo Navarro; licensed under Creative Commons License CC-BY 4.0

PY - 2022/6/1

Y1 - 2022/6/1

KW - BWT

KW - repetitive text

KW - string compression

KW - 113 Computer and information sciences

U2 - 10.4230/LIPIcs.CPM.2022.29

DO - 10.4230/LIPIcs.CPM.2022.29

M3 - Conference contribution

AN - SCOPUS:85134334805

T3 - Leibniz International Proceedings in Informatics, LIPIcs

SP - 29:1--29:18

BT - 33rd Annual Symposium on Combinatorial Pattern Matching, CPM 2022

A2 - Bannai, Hideo

A2 - Holub, Jan

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

T2 - 33rd Annual Symposium on Combinatorial Pattern Matching, CPM 2022

Y2 - 27 June 2022 through 29 June 2022

ER -

Díaz-Domínguez D, Navarro G. Efficient Construction of the BWT for Repetitive Text Using String Compression. julkaisussa Bannai H, Holub J, toimittajat, 33rd Annual Symposium on Combinatorial Pattern Matching, CPM 2022. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. 2022. s. 29:1--29:18. 29. (Leibniz International Proceedings in Informatics, LIPIcs). doi: 10.4230/LIPIcs.CPM.2022.29