Linear-time computation of prefix table for weighted strings {\&} applications
type: Item
instance of: scholarly article
title: Linear-time computation of prefix table for weighted strings {\&} applications
zbMATH Open document ID: 1356.68299
author: Carl Barton
author: Chang Liu
author: Solon P. Pissis
published in: Theoretical Computer Science
publication date: 2017-02-06T00:00:00Z
Mathematics Subject Classification ID: 68W32
Mathematics Subject Classification ID: 68P05
zbMATH DE Number: 6680843
zbMATH Keywords: algorithms on strings
zbMATH Keywords: weighted strings
zbMATH Keywords: uncertain sequences
describes a project that uses: PEAR
MaRDI profile type: Publication
full work available at URL: j.tcs.2016.04.029
OpenAlex ID: W2342939298
cites work: Q4454548
cites work: Property Matching and Weighted Matching
cites work: Approximate Matching in Weighted Sequences
cites work: Q5446128
cites work: Q5480658
cites work: Weighted LCS
cites work: Polynomial-Time Approximation Algorithms for Weighted LCS Problem
cites work: Fast and Simple Computations Using Prefix Tables Under Hamming and Edit Distance
cites work: Linear-Time Computation of Prefix Table for Weighted Strings
cites work: Linear work suffix array construction
cites work: Q4547749
cites work: Space-Efficient Preprocessing Schemes for Range Minimum Queries on Static Arrays
cites work: Fast profile matching algorithms - A survey
cites work: Probabilistic ancestral sequences and multiple alignments
cites work: Algorithms on Strings
cites work: Fast Pattern Matching in Strings
cites work: An on-line string superprimitivity test
cites work: Enhanced string covering
cites work: Prefix Table Construction and Conversion
cites work: Approximate All-Pairs Suffix/Prefix Overlaps
cites work: Fast pattern-matching on indeterminate strings
DOI: 10.1016/J.TCS.2016.04.029
Recommended article: Linear-Time Computation of Prefix Table for Weighted Strings
Recommended article: Q4547749
Recommended article: Q3371405
Recommended article: Fast prefix matching of bounded strings
Recommended article: Fast Prefix Search in Little Space, with Applications
Recommended article: On the Comparison Complexity of the String Prefix-Matching Problem
Recommended article: A sublinear time string prefix square detection algorithm
Recommended article: Tight comparison bounds for the string prefix-matching problem
Recommended article: Approximation algorithms for sorting by length-weighted prefix and suffix operations
Recommended article: Fast parallel string prefix-matching
description: scientific article; zbMATH DE number 6680843