scientific article; zbMATH DE number 828444

zbMath0831.68028MaRDI QIDQ4859180

Graham A. Stephen

Publication date: 20 December 1995

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

edit-distancestring-matchingrepeated patternsstring-searching algorithms

Mathematics Subject Classification ID

Searching and sorting (68P10) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Parallel algorithms in computer science (68W10)

Related Items

Tight bounds on the complexity of the Apostolico-Giancarlo algorithm ⋮ Improved length bounds for the shortest superstring problem ⋮ Calculating distances for dissimilar strings: the shortest path formulation revisited ⋮ Validation and verification of social processes within agent-based computational organization models ⋮ A unifying look at the Apostolico--Giancarlo string-matching algorithm ⋮ Block edit models for approximate string matching ⋮ A sum-over-paths extension of edit distances accounting for all sequence alignments ⋮ Topology of strings: median string is NP-complete ⋮ String-Matching and Alignment Algorithms for Finding Motifs in NGS Data ⋮ Fast string matching for multiple searches ⋮ Some perils of performance prediction: a case study on pattern matching ⋮ Random suffix search trees ⋮ Disjunctive partial deduction of a right-to-left string-matching algorithm ⋮ Unnamed Item ⋮ A \(2_3^2\) superstring approximation algorithm ⋮ Finding approximate palindromes in strings

This page was built for publication: