Sublinear approximate string matching and biological applications
type: Item
instance of: scholarly article
title: Sublinear approximate string matching and biological applications
zbMATH Open document ID: 0942.68575
DOI: 10.1007/BF01185431
author: W. I. Chang
author: Eugene L. Lawler
published in: Algorithmica
publication date: 1996-02-26T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 92D20
Mathematics Subject Classification ID: 68W05
zbMATH DE Number: 672035
MaRDI profile type: Publication
cites work: Efficient string matching
cites work: Q3690245
cites work: Data structures and algorithms for approximate string matching
cites work: An Improved Algorithm For Approximate String Matching
cites work: Q4016521
cites work: Q4763431
cites work: Q4858442
cites work: Inferring Evolutionary History From DNA Sequences
cites work: Q4731050
cites work: Efficient randomized pattern-matching algorithms
cites work: Q4003678
cites work: Fast Pattern Matching in Strings
cites work: Fast string matching with k differences
cites work: Fast parallel and serial approximate string matching
cites work: A Space-Economical Suffix Tree Construction Algorithm
cites work: Linear Algorithm for Data Compression via String Matching
cites work: An Overview of Sequence Comparison: Time Warps, String Edits, and Macromolecules
cites work: On Finding Lowest Common Ancestors: Simplification and Parallelization
cites work: The theory and computation of evolutionary distances: Pattern recognition
cites work: Finding approximate patterns in strings
cites work: Approximate string matching with suffix automata
cites work: Q4731046
cites work: The Complexity of Pattern Matching for a Random String
full work available at URL: https://doi.org/10.1007/bf01185431
OpenAlex ID: W2055417893
description: scientific article; zbMATH DE number 672035