Pages that link to "Item:Q954954"
From MaRDI portal
The following pages link to Fast pattern-matching on indeterminate strings (Q954954):
Displaying 20 items.
- Computing covers using prefix tables (Q313747) (← links)
- Indeterminate string inference algorithms (Q414420) (← links)
- Indeterminate strings, prefix arrays \& undirected graphs (Q496001) (← links)
- Linear-time computation of prefix table for weighted strings {\&} applications (Q507393) (← links)
- A prefix array for parameterized strings (Q511148) (← links)
- A new approach to the periodicity lemma on strings with holes (Q732016) (← links)
- A simple fast hybrid pattern-matching algorithm (Q925062) (← links)
- Covering problems for partial words and for indeterminate strings (Q1676304) (← links)
- Constructing an indeterminate string from its associated graph (Q1698711) (← links)
- Efficient pattern matching in elastic-degenerate strings (Q2042726) (← links)
- Order-preserving pattern matching indeterminate strings (Q2105413) (← links)
- A new approach to regular \& indeterminate strings (Q2220865) (← links)
- Approximate pattern matching on elastic-degenerate text (Q2297854) (← links)
- An aperiodicity problem for multiwords (Q2911425) (← links)
- Indexing a sequence for mapping reads with a single mismatch (Q2955639) (← links)
- (Q3165665) (← links)
- Subset Seed Automaton (Q3503905) (← links)
- AN ADAPTIVE HYBRID PATTERN-MATCHING ALGORITHM ON INDETERMINATE STRINGS (Q3655532) (← links)
- (Q5091170) (← links)
- (Q5140763) (← links)
