AWLCO: All-Window Length Co-Occurrence (English)
Free access
- New search for: Sobel, Joshua
- New search for: Bertram, Noah
- New search for: Ding, Chen
- New search for: Nargesian, Fatemeh
- New search for: Gildea, Daniel
- New search for: Sobel, Joshua
- New search for: Bertram, Noah
- New search for: Ding, Chen
- New search for: Nargesian, Fatemeh
- New search for: Gildea, Daniel
- New search for: Gawrychowski, Paweł
- Further information on Gawrychowski, Paweł:
-
https://orcid.org/0000-0002-6993-5440
- New search for: Starikovskaya, Tatiana
In:
LIPIcs, Volume 191, CPM 2021
: 32nd Annual Symposium on Combinatorial Pattern Matching (CPM 2021)
;
191
;
24:1-24:21
;
2021
-
ISBN:
-
ISSN:
- Conference paper / Electronic Resource
-
Title:AWLCO: All-Window Length Co-Occurrence
-
Contributors:Sobel, Joshua ( author ) / Bertram, Noah ( author ) / Ding, Chen ( author ) / Nargesian, Fatemeh ( author ) / Gildea, Daniel ( author ) / Gawrychowski, Paweł ( editor ) / Starikovskaya, Tatiana ( editor )
-
Published in:LIPIcs, Volume 191, CPM 2021 : 32nd Annual Symposium on Combinatorial Pattern Matching (CPM 2021) ; 191 ; 24:1-24:21Leibniz International Proceedings in Informatics (LIPIcs) ; 191 ; 24:1-24:21
-
Publisher:
- New search for: Schloss Dagstuhl – Leibniz-Zentrum für Informatik
-
Publication date:2021-06-30
-
Size:21 pages , 1299223 byte
-
Remarks:LIPIcs, Vol. 191, 32nd Annual Symposium on Combinatorial Pattern Matching (CPM 2021), pages 24:1-24:21
-
ISBN:
-
ISSN:
-
DOI:
-
Type of media:Conference paper
-
Type of material:Electronic Resource
-
Language:English
-
Keywords:
-
Licence:
-
Source:
Table of contents conference proceedings
The tables of contents are generated automatically and are based on the data records of the individual contributions available in the index of the TIB portal. The display of the Tables of Contents may therefore be incomplete.
- 1
-
Repetitions in Strings: A "Constant" Problem (Invited Talk)Bannai, Hideo et al. | 2021
- 2
-
Computing Edit Distance (Invited Talk)Koucký, Michal et al. | 2021
- 3
-
On-Line Pattern Matching on D-Texts (Invited Talk)Pisanti, Nadia et al. | 2021
- 4
-
Ranking Bracelets in Polynomial TimeAdamson, Duncan / Gusev, Vladimir V. / Potapov, Igor / Deligkas, Argyrios et al. | 2021
- 5
-
The k-Mappability Problem RevisitedAmir, Amihood / Boneh, Itai / Kondratovsky, Eitan et al. | 2021
- 6
-
Internal Shortest Absent Word QueriesBadkobeh, Golnaz / Charalampopoulos, Panagiotis / Pissis, Solon P. et al. | 2021
- 7
-
Constructing the Bijective and the Extended Burrows-Wheeler Transform in Linear TimeBannai, Hideo / Kärkkäinen, Juha / Köppl, Dominik / Piątkowski, Marcin et al. | 2021
- 8
-
Weighted Ancestors in Suffix Trees RevisitedBelazzougui, Djamal / Kosolobov, Dmitry / Puglisi, Simon J. / Raman, Rajeev et al. | 2021
- 9
-
Constructing Strings Avoiding Forbidden SubstringsBernardini, Giulia / Marchetti-Spaccamela, Alberto / Pissis, Solon P. / Stougie, Leen / Sweering, Michelle et al. | 2021
- 10
-
Gapped Indexing for Consecutive OccurrencesBille, Philip / Gørtz, Inge Li / Pedersen, Max Rishøj / Steiner, Teresa Anna et al. | 2021
- 11
-
Disorders and PermutationsBulteau, Laurent / Giraudo, Samuele / Vialette, Stéphane et al. | 2021
- 12
-
Computing Covers of 2D-StringsCharalampopoulos, Panagiotis / Radoszewski, Jakub / Rytter, Wojciech / Waleń, Tomasz / Zuba, Wiktor et al. | 2021
- 13
-
A Fast and Small Subsampled R-IndexCobas, Dustin / Gagie, Travis / Navarro, Gonzalo et al. | 2021
- 14
-
The Longest Run Subsequence Problem: Further Complexity ResultsDondi, Riccardo / Sikora, Florian et al. | 2021
- 15
-
Data Structures for Categorical Path Counting QueriesHe, Meng / Kazi, Serikzhan et al. | 2021
- 16
-
Compressed Weighted de Bruijn GraphsItaliano, Giuseppe F. / Prezza, Nicola / Sinaimeri, Blerina / Venturini, Rossano et al. | 2021
- 17
-
Optimal Construction of Hierarchical Overlap GraphsKhan, Shahbaz et al. | 2021
- 18
-
A Compact Index for Cartesian Tree MatchingKim, Sung-Hwan / Cho, Hwan-Gue et al. | 2021
- 19
-
String Sanitization Under Edit Distance: Improved and GeneralizedMieno, Takuya / Pissis, Solon P. / Stougie, Leen / Sweering, Michelle et al. | 2021
- 20
-
An Invertible Transform for Efficient String Matching in Labeled DigraphsNellore, Abhinav / Nguyen, Austin / Thompson, Reid F. et al. | 2021
- 21
-
R-enum: Enumeration of Characteristic Substrings in BWT-runs Bounded SpaceNishimoto, Takaaki / Tabei, Yasuo et al. | 2021
- 22
-
A Linear Time Algorithm for Constructing Hierarchical Overlap GraphsPark, Sangsoo / Park, Sung Gwan / Cazaux, Bastien / Park, Kunsoo / Rivals, Eric et al. | 2021
- 23
-
Efficient Algorithms for Counting Gapped PalindromesPopa, Andrei / Popa, Alexandru et al. | 2021
- 24
-
AWLCO: All-Window Length Co-OccurrenceSobel, Joshua / Bertram, Noah / Ding, Chen / Nargesian, Fatemeh / Gildea, Daniel et al. | 2021
- 25
-
Optimal Completion and Comparison of Incomplete Phylogenetic Trees Under Robinson-Foulds DistanceYao, Keegan / Bansal, Mukul S. et al. | 2021