Identifying periodic occurrences of a template with applications to protein structure

DOI10.1016/0020-0190(93)90245-5zbMath0764.92011OpenAlexW1991762134MaRDI QIDQ1209310

Peter H. Sellers, Gad M. Landau, Jeanette P. Schmidt, Vincent A. Fischetti

Publication date: 16 May 1993

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(93)90245-5

zbMATH Keywords

design of algorithmsstring matching

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Abstract computational complexity for mathematical programming problems (90C60) Biochemistry, molecular biology (92C40) Parallel algorithms in computer science (68W10) Computational methods for problems pertaining to biology (92-08)

Related Items

Statistical tools for discovering pseudo-periodicities in biological sequences ⋮ Period recovery of strings over the Hamming and edit distances ⋮ Tandem cyclic alignment ⋮ Latent periodicity of serine-threonine and tyrosine protein kinases and other protein families ⋮ Periodic String Comparison

Cites Work

• Unnamed Item
• Unnamed Item
• Sequence comparison with concave weighting functions
• Approximate matching of regular expressions
• Speeding up dynamic programming with applications to molecular biology
• Time-space-optimal string matching
• A fast string searching algorithm
• An Improved Algorithm For Approximate String Matching
• Efficient randomized pattern-matching algorithms
• On the Theory and Computation of Evolutionary Distances
• A linear space algorithm for computing maximal common subsequences
• Fast Pattern Matching in Strings
• Fast parallel and serial approximate string matching
• The String-to-String Correction Problem