Image de couverture de livre

Finding Diverse Strings and Longest Common Subsequences in a Graph

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Shida, Yuto, Punzi, Giulia, Kobayashi, Yasuaki, Uno, Takeaki, Arimura, Hiroki
Format:	Preprint
Publié:	2024
Sujets:	Data Structures and Algorithms Computational Complexity Formal Languages and Automata Theory
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Efficiently Finding All Minimal and Shortest Absent Subsequences in a String
par: Manea, Florin, et autres
Publié: (2025)

Computing Minimal Absent Words and Extended Bispecial Factors with CDAWG Space
par: Inenaga, Shunsuke, et autres
Publié: (2024)

Absent Subsequences in Words
par: Kosche, Maria, et autres
Publié: (2021)

Hardness of Regular Expression Matching with Extensions
par: Nogami, Taisei, et autres
Publié: (2026)

Symbolic Functional Decomposition: A Reconfiguration Approach
par: Oliveira, Mateus de Oliveira, et autres
Publié: (2026)

The NFA Acceptance Hypothesis: Non-Combinatorial and Dynamic Lower Bounds
par: Bringmann, Karl, et autres
Publié: (2023)

Subsequences in Bounded Ranges: Matching and Analysis Problems
par: Kosche, Maria, et autres
Publié: (2022)

Linear Time Subsequence and Supersequence Regex Matching
par: Amarilli, Antoine, et autres
Publié: (2025)

Exponent-Strings and Their Edit Distance
par: Baek, Ingyu
Publié: (2024)

Fine-Grained Complexity of Regular Path Queries
par: Casel, Katrin, et autres
Publié: (2021)

Language Edit Distance & Scored Parsing: Faster Algorithms & Connection to Fundamental Graph Problems
par: Kociumaka, Tomasz, et autres
Publié: (2014)

A closer look at TDFA
par: Borsotti, Angelo, et autres
Publié: (2022)

Maximal Closed Substrings
par: Badkobeh, Golnaz, et autres
Publié: (2022)

Novel Results on the Number of Runs of the Burrows-Wheeler-Transform
par: Giuliani, Sara, et autres
Publié: (2020)

A Fast Algorithm for Computing Prefix Probabilities
par: Nowak, Franz, et autres
Publié: (2023)

Generating a Gray code for prefix normal words in amortized polylogarithmic time per word
par: Burcsi, Péter, et autres
Publié: (2020)

Indexing Finite-State Automata Using Forward-Stable Partitions
par: Becker, Ruben, et autres
Publié: (2024)

Efficient Matching of Some Fundamental Regular Expressions with Backreferences
par: Nogami, Taisei, et autres
Publié: (2025)

$k$-Universality of Regular Languages Revisited
par: Adamson, Duncan, et autres
Publié: (2025)

Deciding Reachability and the Covering Problem with Diagnostics for Sound Acyclic Free-Choice Workflow Nets
par: Prinz, Thomas M., et autres
Publié: (2026)

Algorithmical Aspects of Some Bio Inspired Operations
par: Dumitran, Marius
Publié: (2025)

Dynamic Membership for Regular Tree Languages
par: Amarilli, Antoine, et autres
Publié: (2025)

On Minimizers of Minimum Density
par: Shur, Arseny
Publié: (2025)

Prefix Trees Improve Memory Consumption in Large-Scale Continuous-Time Stochastic Models
par: Taylor, Landon, et autres
Publié: (2025)

Wheeler Bisimulations
par: Cotumaccio, Nicola
Publié: (2026)

The Inverse Lyndon Array: Definition, Properties, and Linear-Time Construction
par: Negri, Pietro, et autres
Publié: (2026)

Constant-Time Dynamic Enumeration of Word Infixes in a Regular Language
par: Amarilli, Antoine, et autres
Publié: (2026)

Linear-size Suffix Tries and Linear-size CDAWGs Simplified and Improved
par: Inenaga, Shunsuke
Publié: (2024)

Out-of-Order Membership in Regular Languages
par: Amarilli, Antoine, et autres
Publié: (2026)

Smallest Suffixient Sets: Effectiveness, Resilience, and Calculation
par: Fujimaru, Hiroto, et autres
Publié: (2025)

Complex event recognition meets hierarchical conjunctive queries
par: Pinto, Dante, et autres
Publié: (2024)

Distinct Shortest Walk Enumeration for RPQs
par: David, Claire, et autres
Publié: (2023)

Revisiting Weighted Information Extraction: A Simpler and Faster Algorithm for Ranked Enumeration
par: Gawrychowski, Pawel, et autres
Publié: (2024)

A Circus of Circuits: Connections Between Decision Diagrams, Circuits, and Automata
par: Amarilli, Antoine, et autres
Publié: (2024)

Dynamic direct access of MSO query evaluation over strings
par: Bourhis, Pierre, et autres
Publié: (2024)

Tokenisation is NP-Complete
par: Whittington, Philip, et autres
Publié: (2024)

The Existential Theory of the Reals as a Complexity Class: A Compendium
par: Schaefer, Marcus, et autres
Publié: (2024)

Spectral and combinatorial methods for efficiently computing the rank of unambiguous finite automata
par: Kiefer, Stefan, et autres
Publié: (2025)

Optimal Sequential Flows
par: Gimbert, Hugo, et autres
Publié: (2025)

Decomposing Words for Enhanced Compression: Exploring the Number of Runs in the Extended Burrows-Wheeler Transform
par: Ingels, Florian, et autres
Publié: (2025)