Linear-time computation of prefix table for weighted strings

DOI10.1007/978-3-319-23660-5_7zbMATH Open1330.68357OpenAlexW2151382441MaRDI QIDQ3449358FDOQ3449358

Solon P. Pissis, Carl Barton

Publication date: 4 November 2015

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-23660-5_7

Recommendations

• Linear-time computation of prefix table for weighted strings {\&} applications
• Fast Average-Case Pattern Matching on Weighted Sequences
• scientific article; zbMATH DE number 6792413
• Reverse engineering prefix tables
• Crochemore's partitioning on weighted strings and applications

Mathematics Subject Classification ID

Data structures (68P05) Algorithms on strings (68W32)

Cites Work

• Approximate Matching in Weighted Sequences
• Computing the repetitions in a biological weighted sequence
• The weighted suffix tree: an efficient data structure for handling molecular weighted sequences and its applications
• Weighted LCS
• Fast and Simple Computations Using Prefix Tables Under Hamming and Edit Distance
• Property Matching and Weighted Matching

Cited In (3)

• On-Line Pattern Matching on Uncertain Sequences and Applications
• Algorithmic complexity of protein identification: Combinatorics of weighted strings
• Linear-time computation of prefix table for weighted strings {\&} applications

This page was built for publication: Linear-time computation of prefix table for weighted strings

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3449358)