On the string matching with \(k\) mismatches
type: Item
instance of: scholarly article
title: On the string matching with \(k\) mismatches
zbMATH Open document ID: 1464.68444
author: Yangjun Chen
author: Yujia Wu
published in: Theoretical Computer Science
publication date: 2018-04-16T00:00:00Z
Mathematics Subject Classification ID: 68W32
Mathematics Subject Classification ID: 68P05
Mathematics Subject Classification ID: 92D20
zbMATH DE Number: 6859912
zbMATH Keywords: string matching
zbMATH Keywords: DNA sequences
zbMATH Keywords: tries
zbMATH Keywords: Burrows-Wheeler transformation
describes a project that uses: BWA
describes a project that uses: Soap
describes a project that uses: CloudBurst
describes a project that uses: ZOOM
MaRDI profile type: Publication
full work available at URL: j.tcs.2018.02.001
OpenAlex ID: W2790857551
cites work: Efficient string matching
cites work: Faster algorithms for string matching with k mismatches
cites work: The Boyer–Moore–Galil String Searching Strategies Revisited
cites work: A fast string searching algorithm
cites work: Fast practical multi-pattern matching
cites work: Dictionary matching and indexing with errors and don't cares
cites work: Q4194497
cites work: A new distance metric on strings computable in linear time
cites work: On improving the worst case running time of the Boyer-Moore string matching algorithm
cites work: Q3747742
cites work: Efficient randomized pattern-matching algorithms
cites work: Fast Pattern Matching in Strings
cites work: Efficient string matching with k mismatches
cites work: A variation on the Boyer-Moore algorithm
cites work: Q3138909
cites work: An algorithm for string matching with a sequence of don't cares
cites work: A Space-Economical Suffix Tree Construction Algorithm
cites work: Q4534878
cites work: Q3719846
cites work: Boyer-Moore approach to approximate string matching
cites work: Approximate Boyer–Moore String Matching
cites work: Approximate string-matching with \(q\)-grams and maximal matches
cites work: A space and time efficient algorithm for constructing compressed suffix arrays
cites work: Multipattern string matching with q -grams
cites work: Two Efficient Algorithms for Linear Time Suffix Array Construction
cites work: Q5397902
cites work: Q4471381
DOI: 10.1016/J.TCS.2018.02.001
description: scientific article; zbMATH DE number 6859912