Efficient optimal decomposition of a sequence into disjoint regions, each matched to some template in an inventory

DOI10.1016/0025-5564(92)90075-8zbMath0781.92015OpenAlexW2120199531WikidataQ43528130 ScholiaQ43528130MaRDI QIDQ1205301

David Sankoff

Publication date: 1 April 1993

Published in: Mathematical Biosciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0025-5564(92)90075-8

zbMATH Keywords

modulesdomainsdynamic programmingsubstringsamino acid sequencesequence comparisonsconsensus sequencesnetwork comparisonsoptimal set of disjoint regionsprotein family profilesprotosequencestwo-stage approach to sequence decomposition

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Biochemistry, molecular biology (92C40) Protein sequences, DNA sequences (92D20) Computational methods for problems pertaining to biology (92-08)

Cites Work

• Algorithms for the optimal identification of segment neighborhoods
• Approximate matching of regular expressions
• A level building dynamic time warping algorithm for connected word recognition

This page was built for publication: Efficient optimal decomposition of a sequence into disjoint regions, each matched to some template in an inventory