Practical KMP/BM style pattern-matching on indeterminate strings

Συγγραφείς: Hossein Dehghani, Thierry Lecroq, Neerja Mhaskar, W. F. Smyth

Πηγή: Discrete Applied Mathematics. 370:22-33

Θεματικοί όροι: indeterminate pattern, Knuth-Morris-Pratt algorithm, pattern matching, indeterminate encoding, Boyer-Moore algorithm, Algorithms on strings, brute force algorithm

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

Σύνδεσμος πρόσβασης: https://zbmath.org/8031926
https://doi.org/10.1016/j.dam.2025.02.032

Constructing k-ary orientable sequences with asymptotically optimal length: Constructing \(k\)-ary orientable sequences with asymptotically optimal length

Συγγραφείς: Daniel Gabric, Joe Sawada

Πηγή: Designs, Codes and Cryptography. 93:2349-2367

Θεματικοί όροι: cycle-joining tree, FOS: Computer and information sciences, universal cycle, Combinatorics on words, Discrete Mathematics (cs.DM), concatenation tree, Computer Science - Information Theory, Information Theory (cs.IT), orientable sequence, de Bruijn sequence, Algorithms on strings, FOS: Mathematics, Mathematics - Combinatorics, Combinatorics (math.CO), Computer Science - Discrete Mathematics

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

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2407.07029
https://zbmath.org/8078126
https://doi.org/10.1007/s10623-025-01581-4

Computing MEMs and Relatives on Repetitive Text Collections: Computing MEMs and relatives on repetitive text collections

Συγγραφείς: Gonzalo Navarro 0001

Πηγή: ACM Transactions on Algorithms. 21:1-33

Θεματικοί όροι: FOS: Computer and information sciences, substring complexity, MUMs, Data structures, locally consistent parsing, 0102 computer and information sciences, 02 engineering and technology, Algorithms on strings, 01 natural sciences, compressed data structures, MEMs, Computer Science - Data Structures and Algorithms, Grammars and rewriting systems, 0202 electrical engineering, electronic engineering, information engineering, repetitive texts, Analysis of algorithms, Data Structures and Algorithms (cs.DS), Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science), Searching and sorting, grammar compression

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

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2210.09914

Efficient Constructions of the Prefer-Same and Prefer-Opposite de Bruijn Sequences: Efficient constructions of the prefer-same and prefer-opposite de Bruijn sequences

Συγγραφείς: Evan Sala, Joe Sawada, Abbas Alhakim

Πηγή: ACM Transactions on Algorithms. 21:1-33

Θεματικοί όροι: FOS: Computer and information sciences, Discrete Mathematics (cs.DM), prefer-same, de Bruijn sequence, 0102 computer and information sciences, Euler cycle, Algorithms on strings, 01 natural sciences, greedy algorithm, prefer-opposite, Computer Science - Data Structures and Algorithms, FOS: Mathematics, pure run-length register, Mathematics - Combinatorics, Data Structures and Algorithms (cs.DS), lexicographic compositions, Combinatorics (math.CO), 0101 mathematics, Computer Science - Discrete Mathematics

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

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2010.07960
https://arxiv.org/abs/2010.07960

Reconstruction From Noisy Substrings: Reconstruction from noisy substrings

Συγγραφείς: Hengjia Wei, Moshe Schwartz 0001, Gennian Ge

Πηγή: IEEE Transactions on Information Theory. 70:7757-7776

Θεματικοί όροι: FOS: Computer and information sciences, Discrete Mathematics (cs.DM), Computer Science - Information Theory, Information Theory (cs.IT), encoding messages into sequences, Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science), Source coding, Algorithms on strings, Computer Science - Discrete Mathematics

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

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2312.04790

Forward linearised tree pattern matching using tree pattern border array

Συγγραφείς: Jan Trávnícek, Tomás Pecka, Robin Oburka, Jan Janousek

Πηγή: Discrete Applied Mathematics. 352:33-43

Θεματικοί όροι: Data structures, tree linearisation, Morris-Pratt algorithm, tree processing, Analysis of algorithms, Algorithms on strings, tree pattern matching, border array

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

Σύνδεσμος πρόσβασης: https://zbmath.org/7843501
https://doi.org/10.1016/j.dam.2024.03.014
http://www.stringology.org/event/2020/p06.html

Computable Bounds and Monte Carlo Estimates of the Expected Edit Distance

Συγγραφείς: Gianfranco Bilardi, Michele Schimd

Πηγή: Information, Vol 17, Iss 7, p 685 (2026)

Θεματικοί όροι: combinatorics in computer science, algorithms on strings, Monte Carlo methods, rate of convergence, degree of approximation, Information technology, T58.5-58.64

Περιγραφή αρχείου: electronic resource

Relation: https://www.mdpi.com/2078-2489/17/7/685; https://doaj.org/toc/2078-2489

Σύνδεσμος πρόσβασης: https://doaj.org/article/bf5f69fcc2994163aa7447395c241fb5

Genome Assembly, from Practice to Theory: Safe, Complete and Linear-Time: Genome assembly, from practice to theory: safe, complete and \textit{linear-time}

Συγγραφείς: Massimo Cairo, Romeo Rizzi, Alexandru I. Tomescu, Elia C. Zirondelli

Συνεισφορές: Department of Computer Science, Algorithmic Bioinformatics, Bioinformatics, Massimo Cairo and Romeo Rizzi and Alexandru I. Tomescu and Elia C. Zirondelli, Bansal, Nikhil, Merelli, Emanuela, Worrell, James

Πηγή: ACM Transactions on Algorithms
48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)

Θεματικοί όροι: FOS: Computer and information sciences, Discrete Mathematics (cs.DM), Analysis of algorithms and problem complexity, 0206 medical engineering, strong connectivity, 0102 computer and information sciences, 02 engineering and technology, Algorithms on strings, 01 natural sciences, Mathematics of computing → Paths and connectivity problems, Graph algorithms (graph-theoretic aspects), graph algorithm, FOS: Mathematics, Mathematics - Combinatorics, Quantitative Biology - Genomics, Applied computing → Computational biology, Computational methods for problems pertaining to biology, Genomics (q-bio.GN), Computer and information sciences, Graph algorithm, Protein sequences, DNA sequences, Computation theory, Genes, Graph theory, Program assemblers, Reachability under failures, Strong connectivity, Bioinformatics, Theory of computation → Graph algorithms analysis, Graph theory (including graph drawing) in computer science, reachability under failures, FOS: Biological sciences, Combinatorics (math.CO), Genetics and epigenetics, Computer Science - Discrete Mathematics

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

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2002.10498
https://zbmath.org/7988189
https://doi.org/10.1145/3632176
http://hdl.handle.net/10138/332217
http://hdl.handle.net/10138/568677
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2021.43
https://hdl.handle.net/11562/1057335
https://doi.org/10.4230/lipics.icalp.2021.43

The longest letter-duplicated subsequence and related problems

Συγγραφείς: Wenfeng Lai, Adiesha Liyanage, Binhai Zhu, Peng Zou

Πηγή: Acta Informatica. 61:315-329

Θεματικοί όροι: 0301 basic medicine, 0303 health sciences, 03 medical and health sciences, Algorithms on strings

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

The Longest Wave Subsequence Problem: Generalizations of the Longest Increasing Subsequence Problem: The longest wave subsequence problem: generalizations of the longest increasing subsequence problem

Συγγραφείς: Guan-Zhi Chen, Chang-Biau Yang, Yu-Cheng Chang

Πηγή: International Journal of Foundations of Computer Science. 36:203-218

Θεματικοί όροι: longest wave subsequence, increasing/decreasing segment, longest increasing subsequence, trend preservation, 0202 electrical engineering, electronic engineering, information engineering, Analysis of algorithms, 0102 computer and information sciences, 02 engineering and technology, Algorithms on strings, priority queue, 01 natural sciences

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

Σύνδεσμος πρόσβασης: https://zbmath.org/8009585
https://doi.org/10.1142/s012905412450014x

Reconstruction of a Single String From a Part of Its Composition Multiset: Reconstruction of a single string from a part of its composition multiset

Συγγραφείς: Zuo Ye, Ohad Elishco

Πηγή: IEEE Transactions on Information Theory. 70:3922-3940

Θεματικοί όροι: 0301 basic medicine, FOS: Computer and information sciences, 0303 health sciences, 03 medical and health sciences, Computer Science - Information Theory, Information Theory (cs.IT), FOS: Mathematics, Mathematics - Combinatorics, Combinatorics (math.CO), Algorithms on strings

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

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2208.14963
https://zbmath.org/7884908
https://doi.org/10.1109/tit.2023.3315784

Recovery From Non-Decomposable Distance Oracles: Recovery from non-decomposable distance oracles

Συγγραφείς: Zhuangfei Hu, Xinda Li 0001, David P. Woodruff, Hongyang Zhang 0001, Shufan Zhang 0001

Συνεισφορές: Zhuangfei Hu and Xinda Li and David P. Woodruff and Hongyang Zhang and Shufan Zhang

Πηγή: IEEE Transactions on Information Theory. 69:6443-6469

Θεματικοί όροι: Edit Distance, FOS: Computer and information sciences, Data structures, Computer Science - Information Theory, Information Theory (cs.IT), 0102 computer and information sciences, DTW Distance, Computational Complexity (cs.CC), Algorithms on strings, 01 natural sciences, Fréchet Distance, Computer Science - Computational Complexity, Sequence Recovery, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS)

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

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

Generic Non-recursive Suffix Array Construction: Generic non-recursive suffix array construction

Συγγραφείς: Jannik Olbrich, Enno Ohlebusch, Thomas Büchler

Πηγή: ACM Transactions on Algorithms. 20:1-42

Θεματικοί όροι: String algorithms, Data structures, Bijective Burrows-Wheeler transform, suffix array, 0102 computer and information sciences, 02 engineering and technology, string algorithms, Algorithms on strings, 01 natural sciences, bijective Burrows-Wheeler transform, Suffix sorting, Suffix array, suffix sorting, 0202 electrical engineering, electronic engineering, information engineering, Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science), Searching and sorting

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

Longest Common Subsequence with Gap Constraints: Longest common subsequence with gap constraints

Συγγραφείς: Duncan Adamson, Paul Sarnighausen-Cahn, Marius Dumitran, Maria Kosche, Tore Koß, Florin Manea, Stefan Siemer

Συνεισφορές: Adamson, Duncan, Sarnighausen-Cahn, Paul, Dumitran, Marius, Kosche, Maria, Koß, Tore, Manea, Florin, Siemer, Stefan, University of St Andrews.School of Computer Science

Πηγή: Theory of Computing Systems. 69

Θεματικοί όροι: Bounded range, Fine grained complexity, MCC, Longest common subsequence, Computational Theory and Mathematics, bounded range, Gap constraints, fine-grained complexity, T-NDAS, gap constraints, longest common subsequence, Algorithms on strings, Theoretical Computer Science

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

Σύνδεσμος πρόσβασης: https://resolver.sub.uni-goettingen.de/purl?gro-2/150245
https://hdl.handle.net/10023/33435

On the Complexity of String Matching for Graphs: On the complexity of string matching for graphs

Συγγραφείς: Massimo Equi, Veli Mäkinen, Alexandru I. Tomescu, Roberto Grossi

Συνεισφορές: Department of Computer Science, Algorithmic Bioinformatics, Helsinki Institute for Information Technology, Genome-scale Algorithmics research group / Veli Mäkinen, Bioinformatics, Baier, Christel, Chatzigiannakis, Ioannis, Flocchini, Paola, Leonardi, Stefano, Massimo Equi and Roberto Grossi and Veli Mäkinen and Alexandru I. Tomescu

Πηγή: ACM Transactions on Algorithms

Θεματικοί όροι: 0301 basic medicine, Computer and information sciences, string matching, Analysis of algorithms and problem complexity, strong exponential time hypothesis, Exact pattern matching, graph search, variation graphs, 0102 computer and information sciences, Algorithms on strings, 01 natural sciences, graph query, labeled graphs, string search, Strong Exponential Time Hypothesis, heterogeneous networks, exact pattern matching, 03 medical and health sciences, Graph theory (including graph drawing) in computer science, Graph algorithms (graph-theoretic aspects)

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

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

The edit distance to k-subsequence universality: The edit distance to \(k\)-subsequence universality

Συγγραφείς: Joel D. Day, Pamela Fleischmann, Maria Kosche, Tore Koß, Florin Manea, Stefan Siemer

Συνεισφορές: Day, Joel D., Fleischmann, Pamela, Kosche, Maria, Koß, Tore, Manea, Florin, Siemer, Stefan, Joel D. Day and Pamela Fleischmann and Maria Kosche and Tore Koß and Florin Manea and Stefan Siemer

Πηγή: Journal of Computer and System Sciences. 154:103681

Θεματικοί όροι: Combinatorics on words, subword, k-subsequence universality, Edit distance, scattered factor, edit distance, Universality, Algorithms on strings, Efficient algorithms, Subsequence, efficient algorithms, Scattered factor, Subword, universality, subsequence universality, subsequence

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

Σύνδεσμος πρόσβασης: https://zbmath.org/8083429
https://doi.org/10.1016/j.jcss.2025.103681
https://resolver.sub.uni-goettingen.de/purl?gro-2/150326
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2021.25

Quantum Algorithm for Lexicographically Minimal String Rotation: Quantum algorithm for lexicographically minimal string rotation

Συγγραφείς: Qisheng Wang, Mingsheng Ying

Πηγή: Wang, Q & Ying, M 2023, 'Quantum algorithm for lexicographically minimal string rotation', Theory of Computing Systems, vol. 68, no. 1, pp. 29-74. https://doi.org/10.1007/s00224-023-10146-8

Θεματικοί όροι: FOS: Computer and information sciences, Quantum Physics, quantum query complexity, FOS: Physical sciences, Quantum algorithms and complexity in the theory of computing, Formal languages and automata, 0102 computer and information sciences, 02 engineering and technology, Computational Complexity (cs.CC), Algorithms on strings, 01 natural sciences, quantum computing, Computer Science - Computational Complexity, Quantum computation, Computer Science - Data Structures and Algorithms, lexicographically minimal string rotation, Analysis of algorithms, Data Structures and Algorithms (cs.DS), string problems, Quantum Physics (quant-ph), 0210 nano-technology, quantum algorithms

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

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2012.09376
https://zbmath.org/7802703
https://doi.org/10.1007/s00224-023-10146-8
https://arxiv.org/abs/2012.09376
https://www.research.ed.ac.uk/en/publications/48d58da5-869a-4afe-bbe0-2e21d7175160
https://www.pure.ed.ac.uk/ws/files/479875823/WangAndYingTCS2024QuantumAlgorithmForLexicographically.pdf
https://hdl.handle.net/20.500.11820/48d58da5-869a-4afe-bbe0-2e21d7175160
https://doi.org/10.1007/s00224-023-10146-8

Twenty Similarity Functions for Two Finite Sequences: Twenty similarity functions for two finite sequences

Συγγραφείς: I. Burdonov, A. Maksimov

Πηγή: Programming and Computer Software. 49:373-387

Θεματικοί όροι: Combinatorics on words, sequence analysis, algorithms for subsequence and embeddings combinatorics, canonical embedding, similarity axioms, Algorithms on strings, common subsequences, longest and maximal common subsequences, matching joint embeddings

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

String inference from longest-common-prefix array

Συγγραφείς: Juha Kärkkäinen, Marcin Piatkowski, Simon J. Puglisi

Συνεισφορές: Department of Computer Science, Helsinki Institute for Information Technology, Algorithmic Bioinformatics, Practical Algorithms and Data Structures on Strings research group / Juha Kärkkäinen, Bioinformatics, Chatzigiannakis, Ioannis, Indyk, Piotr, Kuhn, Fabian, Muscholl, Anna, Finnish Centre of Excellence in Algorithmic Data Analysis Research (Algodan), Genome-scale Algorithmics research group / Veli Mäkinen, Juha Kärkkäinen and Marcin Piatkowski and Simon J. Puglisi

Πηγή: Theoretical Computer Science. 942:180-199

Θεματικοί όροι: String inference, 0301 basic medicine, Computer and information sciences, Data structures, LCP array, suffix array, suffix tree, 0102 computer and information sciences, Algorithms on strings, 01 natural sciences, 03 medical and health sciences, Suffix tree, BWT, Suffix array, NP-hardness, string inference

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

Σύνδεσμος πρόσβασης: https://zbmath.org/7636000
https://doi.org/10.1016/j.tcs.2022.11.032
http://hdl.handle.net/10138/589435
http://hdl.handle.net/10138/232533
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2017.62

Quantum Meets Fine-Grained Complexity: Sublinear Time Quantum Algorithms for String Problems: Quantum meets fine-grained complexity: sublinear time quantum algorithms for string problems

Συγγραφείς: Le Gall, François, Seddighin, Saeed

Συνεισφορές: François Le Gall and Saeed Seddighin

Πηγή: Algorithmica. 85:1251-1286

Θεματικοί όροι: FOS: Computer and information sciences, Quantum algorithms, Quantum Physics, Sublinear algorithms, sublinear-time algorithms, FOS: Physical sciences, Quantum algorithms and complexity in the theory of computing, 0102 computer and information sciences, Computational Complexity (cs.CC), string algorithms, Algorithms on strings, 01 natural sciences, Longest common substring, Longest palindrome substring, Computer Science - Computational Complexity, fine-grained complexity, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), 0101 mathematics, Quantum Physics (quant-ph), quantum algorithms

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

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2010.12122
https://zbmath.org/7680776
https://doi.org/10.1007/s00453-022-01066-z
https://arxiv.org/abs/2010.12122
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2022.97