Publication:4859180
From MaRDI portal
zbMath0831.68028MaRDI QIDQ4859180
Publication date: 20 December 1995
68P10: Searching and sorting
68-01: Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science
68W10: Parallel algorithms in computer science
Related Items
Random suffix search trees, Unnamed Item, Tight bounds on the complexity of the Apostolico-Giancarlo algorithm, A sum-over-paths extension of edit distances accounting for all sequence alignments, 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, Disjunctive partial deduction of a right-to-left string-matching algorithm, A \(2_3^2\) superstring approximation algorithm, Block edit models for approximate string matching, Finding approximate palindromes in strings, Topology of strings: median string is NP-complete, Fast string matching for multiple searches, Some perils of performance prediction: a case study on pattern matching, String-Matching and Alignment Algorithms for Finding Motifs in NGS Data