The following pages link to (Q4859180):
Displaying 16 items.
- Tight bounds on the complexity of the Apostolico-Giancarlo algorithm (Q287179) (← links)
- A sum-over-paths extension of edit distances accounting for all sequence alignments (Q632613) (← links)
- Calculating distances for dissimilar strings: the shortest path formulation revisited (Q856246) (← links)
- Validation and verification of social processes within agent-based computational organization models (Q862578) (← links)
- A unifying look at the Apostolico--Giancarlo string-matching algorithm (Q876692) (← links)
- Disjunctive partial deduction of a right-to-left string-matching algorithm (Q1014430) (← links)
- A \(2_3^2\) superstring approximation algorithm (Q1281759) (← links)
- Block edit models for approximate string matching (Q1391305) (← links)
- Finding approximate palindromes in strings (Q1860243) (← links)
- Topology of strings: median string is NP-complete (Q1978500) (← links)
- Fast string matching for multiple searches (Q2745228) (← links)
- Some perils of performance prediction: a case study on pattern matching (Q2745229) (← links)
- String-Matching and Alignment Algorithms for Finding Motifs in NGS Data (Q3305534) (← links)
- Random suffix search trees (Q4446869) (← links)
- Improved length bounds for the shortest superstring problem (Q5057460) (← links)
- (Q5389768) (← links)
