Výsledky vyhledávání - "string algorithms"

Elastic-Degenerate String Matching with 1 Error or Mismatch

Autoři: Bernardini, Giulia Gabory, Esteban Pissis, Solon a další

Přispěvatelé: Bernardini, Giulia Gabory, Esteban Pissis, Solon a další

Zdroj: Theory of Computing Systems

Témata: String algorithms, Elastic-degenerate strings, string algorithms, approximate string matching, edit distance, Hamming distance, elastic-degenerate strings, Approximate string matching, Elastic-degenerate string, Edit distance, String algorithm, [INFO.INFO-BI] Computer Science [cs]/Bioinformatics [q-bio.QM]

Popis souboru: application/pdf

Přístupová URL adresa: https://link.springer.com/article/10.1007/s00224-024-10194-8
https://hdl.handle.net/11368/3091558
https://hdl.handle.net/1871.1/fbd19d3a-5431-453a-a3e0-8cd5b1a5b811
https://doi.org/10.1007/s00224-024-10194-8
https://research.vu.nl/en/publications/fbd19d3a-5431-453a-a3e0-8cd5b1a5b811
https://inria.hal.science/hal-04747458v1
https://doi.org/10.1007/s00224-024-10194-8
https://inria.hal.science/hal-04747458v1/document
https://hdl.handle.net/2434/1131036
https://doi.org/10.1007/s00224-024-10194-8
https://link.springer.com/article/10.1007/s00224-024-10194-8
https://doi.org/10.1007/s00224-024-10194-8
https://hdl.handle.net/11368/3091558

k-Universality of Regular Languages

Autoři: Duncan Adamson Pamela Fleischmann Annika Huch a další

Přispěvatelé: Duncan Adamson Pamela Fleischmann Annika Huch a další

Zdroj: Information and Computation. 307:105357

Témata: FOS: Computer and information sciences, Formal Languages and Automata Theory (cs.FL), T-NDAS, String Algorithms, Computer Science - Data Structures and Algorithms, Finite Automata, Subsequences, Regular Languages, Computer Science - Formal Languages and Automata Theory, Data Structures and Algorithms (cs.DS), ddc:004, Software

Popis souboru: application/pdf

Přístupová URL adresa: http://arxiv.org/abs/2311.10658
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2023.4
https://hdl.handle.net/10023/29996

Missing value replacement in strings and applications

Autoři: G. Bernardini C. Liu G. Loukides a další

Zdroj: Data Min Knowl Discov

Témata: String algorithms, String sanitization, string algorithm, forbidden pattern, missing value replacement, string sanitization, string algorithms, forbidden patterns, Forbidden patterns, Missing value replacement, Article

Popis souboru: application/pdf

Přístupová URL adresa: https://pubmed.ncbi.nlm.nih.gov/39867462
https://research.vu.nl/en/publications/8a02a50e-06d3-4836-aac0-8c0e0992a4bd
https://doi.org/10.1007/s10618-024-01074-3
https://hdl.handle.net/1871.1/8a02a50e-06d3-4836-aac0-8c0e0992a4bd
https://hdl.handle.net/2434/1138695
https://doi.org/10.1007/s10618-024-01074-3
https://hdl.handle.net/11368/3096431

Pattern Masking for Dictionary Matching: Theory and Practice: Theory and Practice

Autoři: Charalampopoulos, Panagiotis Chen, Huiping Christen, Peter a další

Přispěvatelé: Charalampopoulos, Panagiotis Chen, Huiping Christen, Peter a další

Zdroj: Algorithmica

Témata: String algorithms, Record linkage, String algorithms Dictionary matching Wildcards Record linkage, Query term dropping, 4. Education, Wildcards, Dictionary matching, [INFO.INFO-BI] Computer Science [cs]/Bioinformatics [q-bio.QM]

Popis souboru: application/pdf

Přístupová URL adresa: https://hdl.handle.net/1871.1/7db223ca-663b-47f1-9c0e-c2ab8c68cf98
https://doi.org/10.1007/s00453-024-01213-8
https://research.vu.nl/en/publications/7db223ca-663b-47f1-9c0e-c2ab8c68cf98
https://inria.hal.science/hal-04747475v1
https://inria.hal.science/hal-04747475v1/document
https://doi.org/10.1007/s00453-024-01213-8

Bit Packed Encodings for Grammar-Compressed Strings Supporting Fast Random Access

Autoři: Cleary, Alan M. Winjum, Joseph Dood, Jordan a další

Přispěvatelé: Cleary, Alan M. Winjum, Joseph Dood, Jordan a další

Témata: String algorithms, grammar-based compression, ddc:004, data compression, random access

Popis souboru: application/pdf

Přístupová URL adresa: https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2025.12

Graph Indexing Beyond Wheeler Graphs

Autoři: Alanko, Jarno N. Biagi, Elena Equi, Massimo a další

Přispěvatelé: Alanko, Jarno N. Biagi, Elena Equi, Massimo a další

Témata: compressed data structures, Computer and information sciences, pattern matching, ddc:004, string algorithms, compression, indexing

Popis souboru: application/pdf

Přístupová URL adresa: http://hdl.handle.net/10138/600103
https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.Manzini.13
https://aaltodoc.aalto.fi/handle/123456789/138634

Faster Range LCP Queries in Linear Space

Autoři: Nekirch, Yakov Thankachan, Sharma V. Yakov Nekirch and Sharma V. Thankachan

Přispěvatelé: Nekirch, Yakov Thankachan, Sharma V. Yakov Nekirch and Sharma V. Thankachan

Témata: Longest Common Prefix, String Algorithms, ddc:004, Data Structures

Popis souboru: application/pdf

Přístupová URL adresa: https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.Grossi.16

Circular Dictionary Matching Using Extended BWT

Autoři: Hon, Wing-Kai Shah, Rahul Thankachan, Sharma V. a další

Přispěvatelé: Hon, Wing-Kai Shah, Rahul Thankachan, Sharma V. a další

Témata: String algorithms, succinct data structures, suffix trees, ddc:004, Burrows-Wheeler transformation

Popis souboru: application/pdf

Přístupová URL adresa: https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.Manzini.11

On String and Graph Sanitization

Autoři: Bernardini G. Chen H. Loukides G. a další

Přispěvatelé: Bernardini G. Chen H. Loukides G. a další

Zdroj: Bernardini, G, Chen, H, Loukides, G & Pissis, S P 2025, 'On String and Graph Sanitization', OpenAccess Series in Informatics, vol. 132, pp. 9:1-9:10. https://doi.org/10.4230/OASIcs.Grossi.9

Témata: graph algorithms, data privacy, data sanitization, graph algorithm, string algorithm, ddc:004, string algorithms

Popis souboru: application/pdf

Přístupová URL adresa: https://hdl.handle.net/1871.1/9eb0c27e-ee74-44a9-945b-f01384060438
https://doi.org/10.4230/OASIcs.Grossi.9
https://research.vu.nl/en/publications/9eb0c27e-ee74-44a9-945b-f01384060438
https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.Grossi.9
https://kclpure.kcl.ac.uk/ws/files/353845480/OASIcs.Grossi.9.pdf

Succinct Rank Dictionaries Revisited

Autoři: Dönges Saska Puglisi Simon J. Mutzel, Petra a další

Přispěvatelé: Dönges Saska Puglisi Simon J. Mutzel, Petra a další

Témata: compressed data structures, data structures, weighted de Bruijn sequence, Computer and information sciences, succinct data structures, ddc:004, text indexing, string algorithms, data compression

Popis souboru: application/pdf

Přístupová URL adresa: http://hdl.handle.net/10138/599592
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2025.15

Minimal Generators in Optimal Time

Autoři: Ellert, Jonas Gawrychowski, Paweł Starikovskaya, Tatiana a další

Přispěvatelé: Ellert, Jonas Gawrychowski, Paweł Starikovskaya, Tatiana a další

Témata: general unordered alphabet, decision tree complexity, minimal generator, ddc:004, string algorithms, walking on words, palindromic substrings

Popis souboru: application/pdf

Přístupová URL adresa: https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2025.14

Bidirectional String Anchors for Improved Text Indexing and Top-$K$ Similarity Search

Autoři: Loukides, Grigorios Pissis, Solon P. Sweering, Michelle a další

Přispěvatelé: Loukides, Grigorios Pissis, Solon P. Sweering, Michelle a další

Zdroj: Loukidis, G, Pissis, S & Sweering, M 2023, ' Bidirectional String Anchors for Improved Text Indexing and Top-K Similarity Search ', IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, pp. 1-18 . https://doi.org/10.1109/TKDE.2022.3231780
Loukidis, G, Pissis, S & Sweering, M 2023, ' Bidirectional String Anchors for Improved Text Indexing and Top-K Similarity Search ', IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, vol. 35, no. 11, pp. 11093-11111 . https://doi.org/10.1109/TKDE.2022.3231780
IEEE Transactions on Knowledge and Data Engineering
King's Research Portal
NARCIS
ORCID

Témata: String algorithms, top-K string similarity search, Computational Theory and Mathematics, 0202 electrical engineering, electronic engineering, information engineering, top-K similarity search, 02 engineering and technology, string sampling, text indexing, string algorithms, Computer Science Applications, Information Systems

Popis souboru: application/pdf

Přístupová URL adresa: https://hdl.handle.net/1871.1/ec28e28b-b166-4438-88d6-0aaf6e55e899
https://doi.org/10.1109/TKDE.2022.3231780
https://research.vu.nl/en/publications/ec28e28b-b166-4438-88d6-0aaf6e55e899
https://kclpure.kcl.ac.uk/ws/files/195931388/Bidirectional_String_Anchors_4.pdf

Internal shortest absent word queries in constant time and linear space

Autoři: Golnaz Badkobeh Panagiotis Charalampopoulos Dmitry Kosolobov a další

Přispěvatelé: Golnaz Badkobeh Panagiotis Charalampopoulos Dmitry Kosolobov a další

Zdroj: Theoretical Computer Science
NARCIS
arXiv.org e-Print Archive
Hal-Diderot
Mémoires en Sciences de l'Information et de la Communication
Institutional repository of Ural Federal University named after the first President of Russia B.N.Yeltsin
Vrije Universiteit Amsterdam (VU Amsterdam)-Institutional Repository
INRIA a CCSD electronic archive server
Datacite
ORCID
32nd Annual Symposium on Combinatorial Pattern Matching (CPM), 2021, Wroclaw, Poland
Theoretical Computer Science, 922, 271-282. Elsevier
Badkobeh, G, Charalampopoulos, P, Kosolobov, D & Pissis, S P 2022, ' Internal shortest absent word queries in constant time and linear space ', Theoretical Computer Science, vol. 922, pp. 271-282 . https://doi.org/10.1016/j.tcs.2022.04.029
CPM 2021-32nd Annual Symposium on Combinatorial Pattern Matching, Jul 2021, Wroclaw, Poland. pp.1-13
32nd Annual Symposium on Combinatorial Pattern Matching (CPM)
CPM 2021-32nd Annual Symposium on Combinatorial Pattern Matching

Témata: String algorithms, FOS: Computer and information sciences, CONSTANT TIME, BIT PARALLELISM, General Computer Science, INTERNAL QUERIES, INTERNAL SHORTS, INTERNAL QUERY, Internal queries, 0102 computer and information sciences, 02 engineering and technology, [INFO] Computer Science [cs], 01 natural sciences, TIME-SPACE, Theoretical Computer Science, SHORTEST ABSENT WORD, PREPROCESS, STRING ALGORITHMS, Computer Science - Data Structures and Algorithms, 0202 electrical engineering, electronic engineering, information engineering, Data Structures and Algorithms (cs.DS), Shortest absent word, SHORT ABSENT WORD, Bit parallelism, LINEAR SPACES, internal queries, string algorithms, SPACE DATA STRUCTURES, COMPUTATIONAL METHODS, bit parallelism, shortest absent word, SDG 4 - Quality Education

Popis souboru: application/pdf

Přístupová URL adresa: http://arxiv.org/abs/2106.01763
https://research.gold.ac.uk/id/eprint/31912/7/Range_Absent_Words.pdf
https://hdl.handle.net/1871.1/ed3be6f7-164c-4b5e-ac9c-0a6c5d697b53
https://doi.org/10.1016/j.tcs.2022.04.029
https://research.vu.nl/en/publications/ed3be6f7-164c-4b5e-ac9c-0a6c5d697b53
https://inria.hal.science/hal-03498358v1
http://elar.urfu.ru/handle/10995/117865
https://www.scopus.com/inward/record.uri?eid=2-s2.0-85129567862&doi=10.1016/j.tcs.2022.04.029&partnerID=40&md5=85ce4247332146740284ad07a75067f3

A Linear-Time n 0.4 -Approximation for Longest Common Subsequence

Autoři: Karl Bringmann Vincent Cohen-Addad Debarati Das

Zdroj: ACM Transactions on Algorithms
Bringmann, K, Cohen-Addad, V & Das, D 2023, ' A Linear-Time n 0.4-Approximation for Longest Common Subsequence ', ACM Transactions on Algorithms, vol. 19, no. 1, 9 . https://doi.org/10.1145/3568398

Témata: FOS: Computer and information sciences, Longest common subsequence, Computer Science - Data Structures and Algorithms, 0202 electrical engineering, electronic engineering, information engineering, Data Structures and Algorithms (cs.DS), 0102 computer and information sciences, 02 engineering and technology, F.2.2, approximation algorithms, string algorithms, 68W32, 68W25, 01 natural sciences

Popis souboru: application/pdf

Přístupová URL adresa: http://arxiv.org/abs/2106.08195
http://hdl.handle.net/21.11116/0000-000C-A7EC-E
http://hdl.handle.net/21.11116/0000-000C-A7EE-C
http://hdl.handle.net/21.11116/0000-0008-E267-5
http://hdl.handle.net/21.11116/0000-0008-E269-3
https://curis.ku.dk/ws/files/391218777/A_Linear_Time.pdf

Snake in Optimal Space and Time

Autoři: Bille, Philip Farach-Colton, Martín Gørtz, Inge Li a další

Přispěvatelé: Bille, Philip Farach-Colton, Martín Gørtz, Inge Li a další

Zdroj: Bille, P, Farach-Colton, M, Gørtz, I L & van der Hoog, I 2024, ' Snake in Optimal Space and Time ', Leibniz International Proceedings in Informatics, LIPIcs, vol. 291, pp. 3:1-3:15 . https://doi.org/10.4230/LIPIcs.FUN.2024.3

Témata: Nokia, Snake, Data structure, String Algorithms, ddc:004

Popis souboru: application/pdf

Přístupová URL adresa: https://orbit.dtu.dk/en/publications/51fd9669-6e9e-4349-83e2-7f84a3a61312
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FUN.2024.3

Practical Quantum Combinatorial String Matching

Autoři: Cantone D. Caudullo C. Faro S. a další

Zdroj: Lecture Notes in Networks and Systems ISBN: 9783031731242

Témata: String algorithms, Combinatorial algorithms, Quantum computing

Subsequences With Generalised Gap Constraints: Upper and Lower Complexity Bounds

Autoři: Manea, Florin Richardsen, Jonas Schmid, Markus L. a další

Přispěvatelé: Manea, Florin Richardsen, Jonas Schmid, Markus L. a další

Témata: String algorithms, FOS: Computer and information sciences, pattern matching, conditional lower bounds, fine-grained complexity, parameterised complexity, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), ddc:004, subsequences with gap constraints

Popis souboru: application/pdf

Přístupová URL adresa: http://arxiv.org/abs/2404.10497
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2024.22

Maximum Letter-Duplicated Subsequence (short paper)

Autoři: Dondi, Riccardo Hosseinzadeh, Mehdi Popa, Alexandru

Témata: APX-hardness, LCS, String Algorithms

Popis souboru: application/pdf

Přístupová URL adresa: https://hdl.handle.net/10446/296087

k-universality of regular languages

Autoři: Adamson, Duncan Fleischmann, Pamela Huch, Annika a další

Přispěvatelé: Adamson, Duncan Fleischmann, Pamela Huch, Annika a další

Témata: Finite Automata, Regular Languages, String Algorithms, Subsequences, Software, T-NDAS

Popis souboru: application/pdf

Relation: 34th International Symposium on Algorithms and Computation, ISAAC 2023; Leibniz International Proceedings in Informatics, LIPIcs; 302433007; 85179139394; conference; https://hdl.handle.net/10023/29996

Dostupnost: https://hdl.handle.net/10023/29996
https://doi.org/10.4230/LIPIcs.ISAAC.2023.4

Longest Common Prefix Arrays for Succinct k-Spectra

Autoři: Alanko, Jarno N. Biagi, Elena Puglisi, Simon J. a další

Přispěvatelé: Alanko, Jarno N. Biagi, Elena Puglisi, Simon J. a další

Témata: Burrows-Wheeler transform, BWT, compressed data structures, de Bruijn graph, k-mer, LCP, longest common prefix, longest common suffix, string algorithms, Computer and information sciences

Popis souboru: application/pdf

Relation: String Processing and Information Retrieval - 30th International Symposium, SPIRE 2023, Proceedings; Lecture Notes in Computer Science; conference; http://hdl.handle.net/10138/585997; 85174435971; 001156335700001

Dostupnost: http://hdl.handle.net/10138/585997