Faster algorithms for longest common substring

Συγγραφείς: Charalampopoulos, Panagiotis, Kociumaka, Tomasz, Pissis, Solon P., Radoszewski, Jakub, Mutzel, Petra, Pagh, Rasmus, Herman, Grzegorz

Συνεισφορές: The Interdisciplinary Center Herzliya, Israel, University of California [Berkeley], University of California, Centrum Wiskunde & Informatica (CWI), Vrije Universiteit Amsterdam [Amsterdam] (VU), Equipe de recherche européenne en algorithmique et biologie formelle et expérimentale (ERABLE), Inria Grenoble - Rhône-Alpes, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria), Institute of Informatics, University of Warsaw, Bioinformatics, AIMMS, Bio Informatics (IBIVU), Interdisciplinary Center [Israël] (IDC), Interdisciplinary Center, Institute of Informatics [Warsaw], Faculty of Mathematics, Informatics, and Mechanics [Warsaw] (MIMUW), University of Warsaw (UW)-University of Warsaw (UW)

Πηγή: NARCIS
Mémoires en Sciences de l'Information et de la Communication
arXiv.org e-Print Archive
Hyper Article en Ligne
Datacite
Hal-Diderot
INRIA a CCSD electronic archive server
29th Annual European Symposium on Algorithms (ESA 2021), 204, 1-17
ESA 2021-29th Annual European Symposium on Algorithms
ESA 2021-29th Annual European Symposium on Algorithms, Sep 2021, Virtual, Portugal
29th Annual European Symposium on Algorithms (ESA), 2021, Lisbon, Portugal
29th Annual European Symposium on Algorithms (ESA)

Θεματικοί όροι: Theory of computation → Pattern matching

Περιγραφή αρχείου: application/pdf

Σύνδεσμος πρόσβασης: https://hal.inria.fr/hal-03498345/document
https://hal.inria.fr/hal-03498345
https://research.vu.nl/en/publications/ff37cb5c-5f6e-4d0a-997c-606c91f879f5
https://hal.inria.fr/hal-03498345/file/2105.03106.pdf
https://ir.cwi.nl/pub/31364
http://www.scopus.com/inward/record.url?scp=85115090430&partnerID=8YFLogxK
http://arxiv.org/abs/2105.03106

Approximate Circular Pattern Matching

Συγγραφείς: Charalampopoulos, Panagiotis, Rotenberg, Eva, Herman, Grzegorz, Kociumaka, Tomasz, Radoszewski, Jakub, Pissis, Solon P., Rytter, Wojciech, Waleń, Tomasz, Zuba, Wiktor, Chechik, Shiri, Navarro, Gonzalo

Συνεισφορές: Centrum Wiskunde & Informatica, Amsterdam (CWI), The Netherlands, Chechik, Shiri, Navarro, Gonzalo, Rotenberg, Eva, Herman, Grzegorz, Birkbeck College [University of London], Max Planck Institute for Informatics [Saarbrücken], University of Warsaw (UW), Centrum Wiskunde & Informatica (CWI), Vrije Universiteit Amsterdam [Amsterdam] (VU), Equipe de recherche européenne en algorithmique et biologie formelle et expérimentale (ERABLE), Laboratoire de Biométrie et Biologie Evolutive - UMR 5558 (LBBE), Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-Université de Lyon-Institut National de Recherche en Informatique et en Automatique (Inria)-VetAgro Sup - Institut national d'enseignement supérieur et de recherche en alimentation, santé animale, sciences agronomiques et de l'environnement (VAS)-Centre National de la Recherche Scientifique (CNRS)-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-Université de Lyon-Institut National de Recherche en Informatique et en Automatique (Inria)-VetAgro Sup - Institut national d'enseignement supérieur et de recherche en alimentation, santé animale, sciences agronomiques et de l'environnement (VAS)-Centre National de la Recherche Scientifique (CNRS)-Inria Lyon, Institut National de Recherche en Informatique et en Automatique (Inria), Bioinformatics, AIMMS, Bio Informatics (IBIVU)

Πηγή: NARCIS
Datacite
MPG.PuRe
Vrije Universiteit Amsterdam (VU Amsterdam)-Institutional Repository
INRIA a CCSD electronic archive server
arXiv.org e-Print Archive
30th Annual European Symposium on Algorithms (ESA 2022), 1-19
ESA 2022-30th Annual European Symposium on Algorithms, 2022, Berlin/Potsdam, Germany. ⟨10.4230/LIPIcs.ESA.2022.35⟩
30th Annual European Symposium on Algorithms
Charalampopoulos, P, Kociumaka, T, Radoszewski, J, Pissis, S P, Rytter, W, Waleń, T & Zuba, W 2022, Approximate Circular Pattern Matching . in S Chechik, G Navarro, E Rotenberg & G Herman (eds), 30th Annual European Symposium on Algorithms (ESA 2022) . Leibniz International Proceedings in Informatics, LIPIcs, vol. 244, Schloss Dagstuhl-Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, pp. 1-19, 30th Annual European Symposium on Algorithms, ESA 2022, Berlin/Potsdam, Germany, 5/09/22 . https://doi.org/10.4230/LIPIcs.ESA.2022.35
ESA 2022-30th Annual European Symposium on Algorithms
STARTPAGE=1;ENDPAGE=19;TITLE=30th Annual European Symposium on Algorithms (ESA 2022)
Leibniz International Proceedings in Informatics

Θεματικοί όροι: FOS: Computer and information sciences, Data Structures and Algorithms (cs.DS), Theory of computation → Pattern matching

Περιγραφή αρχείου: application/pdf

Σύνδεσμος πρόσβασης: https://hdl.handle.net/1871.1/13e3341c-a458-4b97-90b5-3e448020fd8d
https://drops.dagstuhl.de/opus/volltexte/2022/16973/
http://arxiv.org/abs/2208.08915
https://hal.inria.fr/hal-03829963
https://ir.cwi.nl/pub/32133
https://research.vu.nl/en/publications/13e3341c-a458-4b97-90b5-3e448020fd8d

Faster Block Tree Construction

Συγγραφείς: Köppl, Dominik, Kurpicz, Florian, Meyer, Daniel

Συνεισφορές: Dominik Köppl and Florian Kurpicz and Daniel Meyer

Θεματικοί όροι: ddc:004, DATA processing & computer science, longest previous factor array, block tree, rank and select, Theory of computation → Pattern matching, Lempel-Ziv compression, Theory of computation → Data compression, compressed data structure

Περιγραφή αρχείου: application/pdf

Σύνδεσμος πρόσβασης: https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2023.74

Comparing Elastic-Degenerate Strings: Algorithms, Lower Bounds, and Applications

Συγγραφείς: Gabory, Esteban, Mwaniki, Moses Njagi, Pisanti, Nadia, Pissis, Solon P., Radoszewski, Jakub, Sweering, Michelle, Zuba, Wiktor

Συνεισφορές: Sagot, Marie-France, Esteban Gabory and Moses Njagi Mwaniki and Nadia Pisanti and Solon P. Pissis and Jakub Radoszewski and Michelle Sweering and Wiktor Zuba, Bulteau, Laurent, Lipták, Zsuzsanna

Θεματικοί όροι: [SDV] Life Sciences [q-bio], Lower Bounds, pangenome, sequence comparison, acronym identification, elastic-degenerate string, languages intersection, Theory of computation → Pattern matching, ddc:004, [INFO] Computer Science [cs]

Περιγραφή αρχείου: application/pdf

Σύνδεσμος πρόσβασης: https://research.vu.nl/en/publications/02a14086-638a-4c63-ac47-45366a217b11
https://doi.org/10.4230/LIPIcs.CPM.2023.11
https://hdl.handle.net/1871.1/02a14086-638a-4c63-ac47-45366a217b11
https://inria.hal.science/hal-04365687v1/document
https://doi.org/10.4230/lipics.cpm.2023.11
https://inria.hal.science/hal-04365687v1
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2023.11

enFaster Block Tree Construction

Συγγραφείς: Köppl, Dominik, Kurpicz, Florian, Meyer, Daniel

Συνεισφορές: Gørtz, Inge Li, Farach-Colton, Martin, Puglisi, Simon J., Herman, Grzegorz

Θεματικοί όροι: longest previous factor array, block tree, rank and select, Theory of computation → Pattern matching, Lempel-Ziv compression, Theory of computation → Data compression, compressed data structure

enSuffix-Prefix Queries on a Dictionary

Συγγραφείς: Loukides, Grigorios, Pissis, Solon P., Thankachan, Sharma V., Zuba, Wiktor

Συνεισφορές: Bulteau, Laurent, Lipták, Zsuzsanna

Θεματικοί όροι: internal pattern matching, suffix-prefix queries, Theory of computation → Pattern matching, all-pairs suffix-prefix

Making de Bruijn Graphs Eulerian

Συγγραφείς: Bernardini, Giulia, Chen, Huiping, Loukides, Grigorios, Pissis, Solon, P, Stougie, Leen, Sweering, Michelle

Συνεισφορές: Università degli studi di Trieste = University of Trieste, Centrum Wiskunde & Informatica (CWI), King‘s College London, Vrije Universiteit Amsterdam Amsterdam (VU), Equipe de recherche européenne en algorithmique et biologie formelle et expérimentale (ERABLE), Laboratoire de Biométrie et Biologie Evolutive - UMR 5558 (LBBE), Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-Université de Lyon-VetAgro Sup - Institut national d'enseignement supérieur et de recherche en alimentation, santé animale, sciences agronomiques et de l'environnement (VAS)-Centre National de la Recherche Scientifique (CNRS)-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-Université de Lyon-VetAgro Sup - Institut national d'enseignement supérieur et de recherche en alimentation, santé animale, sciences agronomiques et de l'environnement (VAS)-Centre National de la Recherche Scientifique (CNRS)-Centre Inria de Lyon, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria), The work in this paper is supported in part by: the Netherlands Organisation for Scientific Research (NWO) through project OCENW.GROOT.2019.015 “Optimization for and with Machine Learning (OPTIMAL)” and Gravitation-grant NETWORKS-024.002.003, a CSC scholarship, the Leverhulme Trust RPG-2019-399 project, European Project: 872539,H2020-EU.1.3. - EXCELLENT SCIENCE - Marie Skłodowska-Curie Actions, H2020-EU.1.3.3. - Stimulating innovation by means of cross-fertilisation of knowledge,H2020-MSCA-RISE-2019,PANGAIA(2020), European Project: 956229,H2020-EU.1.3. - EXCELLENT SCIENCE - Marie Skłodowska-Curie Actions,ALPACA(2021)

Πηγή: CPM 2022 - 33rd Annual Symposium on Combinatorial Pattern Matching ; https://inria.hal.science/hal-03832887 ; CPM 2022 - 33rd Annual Symposium on Combinatorial Pattern Matching, Jun 2022, Prague, Czech Republic. ⟨10.4230/LIPIcs.CPM.2022.12⟩

Θεματικοί όροι: 2012 ACM Subject Classification Theory of computation → Pattern matching phrases string algorithms, graph algorithms, Eulerian graph, De Bruijn graph, [INFO]Computer Science [cs], [SDV]Life Sciences [q-bio]

Θέμα γεωγραφικό: Prague, Czech Republic

Relation: info:eu-repo/grantAgreement//872539/EU/Pan-genome Graph Algorithms and Data Integration/PANGAIA; info:eu-repo/grantAgreement//956229/EU/ALgorithms for PAngenome Computational Analysis/ALPACA; SWHID: swh:1:dir:d7c2ca6a257600d6d7176b876370c456496af5a2

Διαθεσιμότητα: https://inria.hal.science/hal-03832887
https://inria.hal.science/hal-03832887v1/document
https://inria.hal.science/hal-03832887v1/file/LIPIcs-CPM-2022-12.pdf
https://doi.org/10.4230/LIPIcs.CPM.2022.12

On Strings Having the Same Length- k Substrings

Συγγραφείς: Giulia Bernardini, Alessio Conte, Esteban Gabory, Roberto Grossi, Grigorios Loukides, Solon P. Pissis, Giulia Punzi, Michelle Sweering

Συνεισφορές: Bernardini, Giulia, Conte, Alessio, Gabory, Esteban, Grossi, Roberto, Loukides, Grigorio, Pissis, Solon P., Punzi, Giulia, Sweering, Michelle, Sagot, Marie-France, Giulia Bernardini and Alessio Conte and Esteban Gabory and Roberto Grossi and Grigorios Loukides and Solon P. Pissis and Giulia Punzi and Michelle Sweering, Bannai, Hideo, Holub, Jan

Θεματικοί όροι: string algorithms, combinatorics on words, de Bruijn graph, Chinese Postman, combinatorics on word, Theory of computation → Pattern matching, SDG 7 - Affordable and Clean Energy, ddc:004, [INFO] Computer Science [cs], string algorithm

Περιγραφή αρχείου: application/pdf

Σύνδεσμος πρόσβασης: https://drops.dagstuhl.de/opus/volltexte/2022/16140/
http://hdl.handle.net/11368/3024591
https://research.vu.nl/en/publications/2c7eba68-d1e4-4db8-bd0e-a51aa1888bb5
https://hdl.handle.net/1871.1/2c7eba68-d1e4-4db8-bd0e-a51aa1888bb5
https://doi.org/10.4230/LIPIcs.CPM.2022.16
https://hdl.handle.net/2434/1131577
https://doi.org/10.4230/lipics.cpm.2022.16
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2022.16
https://drops.dagstuhl.de/opus/volltexte/2022/16140/
https://doi.org/10.4230/lipics.cpm.2022.16
https://hdl.handle.net/11368/3024591
https://hdl.handle.net/11568/1167728
https://doi.org/10.4230/LIPIcs.CPM.2022.16

Indexable Elastic Founder Graphs of Minimum Height

Συγγραφείς: Rizzo, Nicola, Mäkinen, Veli

Συνεισφορές: Bannai, Hideo, Holub, Jan, Department of Computer Science, Algorithmic Bioinformatics, Genome-scale Algorithmics research group / Veli Mäkinen, Nicola Rizzo and Veli Mäkinen

Θεματικοί όροι: dynamic programming, Computer and information sciences, suffix tree, Applied computing → Genomics, data structures, Theory of computation → Graph algorithms analysis, Theory of computation → Sorting and searching, pattern matching, segmentation algorithms, Theory of computation → Dynamic programming, multiple sequence alignment, Theory of computation → Pattern matching, ddc:004

Περιγραφή αρχείου: application/pdf

Σύνδεσμος πρόσβασης: http://hdl.handle.net/10138/353005
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2022.19

Longest Palindromic Substring in Sublinear Time

Συγγραφείς: Charalampopoulos, Panagiotis, Pissis, Solon P., Radoszewski, Jakub

Συνεισφορές: Sagot, Marie-France, Panagiotis Charalampopoulos and Solon P. Pissis and Jakub Radoszewski, Bannai, Hideo, Holub, Jan

Θεματικοί όροι: String algorithms, Longest common extension, Theory of computation → Pattern matching, longest common extension, ddc:004, [INFO] Computer Science [cs], longest palindromic substring, string algorithms, Longest palindromic substring

Περιγραφή αρχείου: application/pdf

Σύνδεσμος πρόσβασης: https://hdl.handle.net/1871.1/c39a2657-0d4e-4c0e-bc2a-6c386f78d8fd
https://doi.org/10.4230/LIPIcs.CPM.2022.20
https://research.vu.nl/en/publications/c39a2657-0d4e-4c0e-bc2a-6c386f78d8fd
https://inria.hal.science/hal-03829971v1/document
https://inria.hal.science/hal-03829971v1
https://doi.org/10.4230/lipics.cpm.2022.20
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2022.20

Reduction ratio of the IS-algorithm: worst and random cases

Συγγραφείς: Jugé, Vincent

Συνεισφορές: Vincent Jugé, Jugé, Vincent

Θεματικοί όροι: FOS: Computer and information sciences, [MATH.MATH-PR] Mathematics [math]/Probability [math.PR], [INFO.INFO-DS] Computer Science [cs]/Data Structures and Algorithms [cs.DS], 02 engineering and technology, Word combinatorics, 7. Clean energy, Suffix array, Computer Science - Data Structures and Algorithms, 0202 electrical engineering, electronic engineering, information engineering, Data Structures and Algorithms (cs.DS), Theory of computation → Pattern matching, ddc:004, IS algorithm

Περιγραφή αρχείου: application/pdf

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2204.04422
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2022.8

Approximating Longest Common Substring with k mismatches: Theory and Practice

Συγγραφείς: Gourdel, Garance, Kociumaka, Tomasz, Radoszewski, Jakub, Starikovskaya, Tatiana

Συνεισφορές: Département d'informatique - ENS Paris (DI-ENS), École normale supérieure - Paris (ENS-PSL), Université Paris Sciences et Lettres (PSL)-Université Paris Sciences et Lettres (PSL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS), Scalable, Optimized and Parallel Algorithms for Genomics (GenScale), Inria Rennes – Bretagne Atlantique, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-GESTION DES DONNÉES ET DE LA CONNAISSANCE (IRISA-D7), Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-Institut National de Recherche en Informatique et en Automatique (Inria)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique (IMT Atlantique), Institut Mines-Télécom Paris (IMT)-Institut Mines-Télécom Paris (IMT)-Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut Mines-Télécom Paris (IMT)-Institut Mines-Télécom Paris (IMT)-Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique (IMT Atlantique), Institut Mines-Télécom Paris (IMT)-Institut Mines-Télécom Paris (IMT), Bar-Ilan University Israël, Institute of Informatics Warsaw, Faculty of Mathematics, Informatics, and Mechanics Warsaw (MIMUW), University of Warsaw (UW)-University of Warsaw (UW)

Πηγή: CPM 2020 - 31st Annual Symposium on Combinatorial Pattern Matching ; https://hal.science/hal-03943005 ; CPM 2020 - 31st Annual Symposium on Combinatorial Pattern Matching, 2020, Copenhagen, Denmark. ⟨10.4230/LIPIcs.CPM.2020.16⟩

Θεματικοί όροι: 2012 ACM Subject Classification Theory of computation → Pattern matching phrases approximation algorithms string similarity LSH conditional lower bounds, 2012 ACM Subject Classification Theory of computation → Pattern matching phrases approximation algorithms, string similarity, LSH, conditional lower bounds, [INFO]Computer Science [cs]

Θέμα γεωγραφικό: Copenhagen, Denmark

Διαθεσιμότητα: https://hal.science/hal-03943005
https://hal.science/hal-03943005v1/document
https://hal.science/hal-03943005v1/file/LIPIcs-CPM-2020-16.pdf
https://doi.org/10.4230/LIPIcs.CPM.2020.16

Generalised Pattern Matching Revisited

Συγγραφείς: Dudek, Bartłomiej, Gawrychowski, Paweł, Starikovskaya, Tatiana

Συνεισφορές: University of Wrocław Poland (UWr), Département d'informatique - ENS Paris (DI-ENS), École normale supérieure - Paris (ENS-PSL), Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)

Πηγή: 37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020)
https://hal.science/hal-03942988
37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020), 2020, Montpellier, France. ⟨10.4230/LIPIcs.STACS.2020.18⟩

Θεματικοί όροι: 2012 ACM Subject Classification Theory of computation → Pattern matching phrases pattern matching superimposed codes conditional lower bounds, 2012 ACM Subject Classification Theory of computation → Pattern matching phrases pattern matching, superimposed codes, conditional lower bounds, [INFO]Computer Science [cs]

Θέμα γεωγραφικό: Montpellier, France

Relation: hal-03942988; https://hal.science/hal-03942988; https://hal.science/hal-03942988/document; https://hal.science/hal-03942988/file/LIPIcs-STACS-2020-18.pdf

Διαθεσιμότητα: https://hal.science/hal-03942988
https://hal.science/hal-03942988/document
https://hal.science/hal-03942988/file/LIPIcs-STACS-2020-18.pdf
https://doi.org/10.4230/LIPIcs.STACS.2020.18

Bidirectional string anchors: A new string sampling mechanism

Συγγραφείς: Loukides, Grigorios, Pissis, Solon P., Mutzel, Petra, Pagh, Rasmus, Herman, Grzegorz

Συνεισφορές: Bioinformatics, AIMMS, Bio Informatics (IBIVU), Department of Informatics [King's College London], King‘s College London, Centrum Wiskunde & Informatica (CWI), Vrije Universiteit Amsterdam [Amsterdam] (VU), Equipe de recherche européenne en algorithmique et biologie formelle et expérimentale (ERABLE), Inria Grenoble - Rhône-Alpes, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)

Πηγή: NARCIS
Datacite
INRIA a CCSD electronic archive server
Mémoires en Sciences de l'Information et de la Communication
Hyper Article en Ligne
Hal-Diderot
STARTPAGE=1;ENDPAGE=21;TITLE=29th Annual European Symposium on Algorithms (ESA 2021)
29th Annual European Symposium on Algorithms (ESA 2021), 1-21
ESA 2021-29th Annual European Symposium on Algorithms
ESA 2021-29th Annual European Symposium on Algorithms, Sep 2021, Lisbon, Portugal. pp.1-21, ⟨10.4230/LIPIcs.ESA.2021.64⟩

Θεματικοί όροι: Theory of computation → Pattern matching

Περιγραφή αρχείου: application/pdf

Σύνδεσμος πρόσβασης: https://hal.inria.fr/hal-03395425
https://ir.cwi.nl/pub/31365
https://hal.inria.fr/hal-03395425/file/LIPIcs-ESA-2021-64.pdf
https://hal.inria.fr/hal-03395425/document
https://research.vu.nl/en/publications/9f408630-195e-498f-8618-31548eaddbfc

Optimal Construction of Hierarchical Overlap Graphs

Συγγραφείς: Khan, Shahbaz

Συνεισφορές: Gawrychowski, Pawel, Starikovskaya, Tatiana, Department of Computer Science, Shahbaz Khan, Gawrychowski, Paweł

Πηγή: 32nd Annual Symposium on Combinatorial Pattern Matching (CPM 2021)

Θεματικοί όροι: String algorithms, FOS: Computer and information sciences, Genome assembly, Computer and information sciences, Discrete Mathematics (cs.DM), 0206 medical engineering, Hierarchical Overlap Graphs, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), Theory of computation → Pattern matching, ddc:004, Theory of computation → Data compression, Mathematics of computing → Trees, Computer Science - Discrete Mathematics

Περιγραφή αρχείου: application/pdf

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2102.02873
https://drops.dagstuhl.de/opus/volltexte/2021/13968/pdf/LIPIcs-CPM-2021-17.pdf/
https://researchportal.helsinki.fi/en/publications/optimal-construction-of-hierarchical-overlap-graphs
https://drops.dagstuhl.de/opus/volltexte/2021/13968/
https://dblp.uni-trier.de/db/journals/corr/corr2102.html#abs-2102-02873
https://helda.helsinki.fi/handle/10138/334910
http://hdl.handle.net/10138/334910
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2021.17

Algorithms and Complexity on Indexing Elastic Founder Graphs

Συγγραφείς: Equi, Massimo, Norri, Tuukka, Alanko, Jarno, Cazaux, Bastien, Tomescu, Alexandru I., Mäkinen, Veli

Συνεισφορές: Ahn, Hee-Kap, Sadakane, Kunihiko, Department of Computer Science, Algorithmic Bioinformatics, Genome-scale Algorithmics research group / Veli Mäkinen, Bioinformatics, Helsinki Institute for Information Technology, Massimo Equi and Tuukka Norri and Jarno Alanko and Bastien Cazaux and Alexandru I. Tomescu and Veli Mäkinen

Θεματικοί όροι: Applied computing → Genomics, Theory of computation → Graph algorithms analysis, Computer and information sciences, Theory of computation → Sorting and searching, segmentation, Theory of computation → Problems, reductions and completeness, Theory of computation → Dynamic programming, multiple sequence alignment, orthogonal vectors hypothesis, Theory of computation → Pattern matching, ddc:004

Περιγραφή αρχείου: application/pdf

Σύνδεσμος πρόσβασης: http://hdl.handle.net/10138/338450
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2021.20

Faster Algorithms for Longest Common Substring

Συγγραφείς: Panagiotis Charalampopoulos, Solon P. Pissis, Tomasz Kociumaka, Jakub Radoszewski

Συνεισφορές: Sagot, Marie-France, Panagiotis Charalampopoulos and Tomasz Kociumaka and Solon P. Pissis and Jakub Radoszewski, Mutzel, Petra, Pagh, Rasmus, Herman, Grzegorz

Πηγή: European Symposium on Algorithms (ESA 2021)

Θεματικοί όροι: FOS: Computer and information sciences, wavelet tree, K mismatches, 0102 computer and information sciences, 02 engineering and technology, [INFO] Computer Science [cs], 01 natural sciences, Longest common substring, Wavelet tree, Computer Science - Data Structures and Algorithms, 0202 electrical engineering, electronic engineering, information engineering, Data Structures and Algorithms (cs.DS), Theory of computation → Pattern matching, ddc:004, longest common substring, k mismatches

Περιγραφή αρχείου: application/pdf

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2105.03106
https://research.vu.nl/en/publications/ff37cb5c-5f6e-4d0a-997c-606c91f879f5
https://hdl.handle.net/1871.1/ff37cb5c-5f6e-4d0a-997c-606c91f879f5
https://doi.org/10.4230/LIPIcs.ESA.2021.30
https://inria.hal.science/hal-03498345v1/document
https://inria.hal.science/hal-03498345v1
https://dblp.uni-trier.de/db/journals/corr/corr2105.html#abs-2105-03106
https://research.vu.nl/en/publications/faster-algorithms-for-longest-common-substring
https://doi.org/10.4230/LIPIcs.ESA.2021.30
https://arxiv.org/abs/2105.03106
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2021.30

A Linear Time Algorithm for Constructing Hierarchical Overlap Graphs

Συγγραφείς: Park, Sangsoo, Park, Sung Gwan, Cazaux, Bastien, Park, Kunsoo, Rivals, Eric

Συνεισφορές: Rivals, Eric, Gawrychowski, Pawel, Starikovskaya, Tatiana, Sangsoo Park and Sung Gwan Park and Bastien Cazaux and Kunsoo Park and Eric Rivals, Gawrychowski, Paweł

Πηγή: 32nd Annual Symposium on Combinatorial Pattern Matching (CPM 2021)

Θεματικοί όροι: FOS: Computer and information sciences, hierarchical overlap graph, 0206 medical engineering, [INFO.INFO-DS] Computer Science [cs]/Data Structures and Algorithms [cs.DS], overlap graph, 0102 computer and information sciences, 02 engineering and technology, [INFO] Computer Science [cs], 01 natural sciences, [INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM], Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), Theory of computation → Pattern matching, ddc:004, shortest superstring problem, border array, [INFO.INFO-BI] Computer Science [cs]/Bioinformatics [q-bio.QM]

Περιγραφή αρχείου: application/pdf

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2102.12824
https://hal-lirmm.ccsd.cnrs.fr/lirmm-03431830v1
https://hal-lirmm.ccsd.cnrs.fr/lirmm-03431830v1/document
https://doi.org/10.4230/lipics.cpm.2021.22
https://drops.dagstuhl.de/opus/volltexte/2021/13973/
https://dblp.uni-trier.de/db/journals/corr/corr2102.html#abs-2102-12824
https://hal-lirmm.ccsd.cnrs.fr/lirmm-03431830/document
https://drops.dagstuhl.de/opus/volltexte/2021/13973/pdf/LIPIcs-CPM-2021-22.pdf/
https://hal-lirmm.ccsd.cnrs.fr/lirmm-03431830
https://arxiv.org/abs/2102.12824
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2021.22

Approximating longest common substring with $k$ mismatches: Theory and practice

Συγγραφείς: Gourdel, Garance, Kociumaka, Tomasz, Radoszewski, Jakub, Starikovskaya, Tatiana

Συνεισφορές: Starikovskaya, Tatiana, Garance Gourdel and Tomasz Kociumaka and Jakub Radoszewski and Tatiana Starikovskaya

Θεματικοί όροι: 2012 ACM Subject Classification Theory of computation → Pattern matching phrases approximation algorithms, FOS: Computer and information sciences, 2012 ACM Subject Classification Theory of computation → Pattern matching phrases approximation algorithms string similarity LSH conditional lower bounds, 0102 computer and information sciences, [INFO] Computer Science [cs], 01 natural sciences, conditional lower bounds, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), ddc:004, 0101 mathematics, approximation algorithms, string similarity, LSH

Περιγραφή αρχείου: application/pdf

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2004.13389
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2020.16

Quasi-Periodicity in Streams

Συγγραφείς: Gawrychowski, Paweł, Radoszewski, Jakub, Starikovskaya, Tatiana

Συνεισφορές: University of Wrocław Poland (UWr), University of Warsaw (UW), Département d'informatique - ENS Paris (DI-ENS), École normale supérieure - Paris (ENS-PSL), Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)

Πηγή: 30th Annual Symposium on Combinatorial Pattern Matching (CPM 2019)
https://hal.science/hal-03942953
30th Annual Symposium on Combinatorial Pattern Matching (CPM 2019), 2019, Pisa (IT), Italy. ⟨10.4230/LIPIcs.CPM.2019.22⟩

Θεματικοί όροι: 2012 ACM Subject Classification Theory of computation → Pattern matching phrases Streaming algorithms quasi-periodicity covers seeds Digital Object Identifier 10.4230/LIPIcs.CPM.2019.22, 2012 ACM Subject Classification Theory of computation → Pattern matching phrases Streaming algorithms, quasi-periodicity, covers, seeds Digital Object Identifier 10.4230/LIPIcs.CPM.2019.22, [INFO]Computer Science [cs]

Θέμα γεωγραφικό: Pisa (IT), Italy

Relation: hal-03942953; https://hal.science/hal-03942953; https://hal.science/hal-03942953/document; https://hal.science/hal-03942953/file/LIPIcs-CPM-2019-22.pdf

Διαθεσιμότητα: https://hal.science/hal-03942953
https://hal.science/hal-03942953/document
https://hal.science/hal-03942953/file/LIPIcs-CPM-2019-22.pdf
https://doi.org/10.4230/LIPIcs.CPM.2019.22