Efficient algorithms for locating the length-constrained heaviest segments with applications to biomolecular sequence analysis.
type: Item
instance of: scholarly article
title: Efficient algorithms for locating the length-constrained heaviest segments with applications to biomolecular sequence analysis.
zbMATH Open document ID: 1059.68024
DOI: 10.1016/S0022-0000(02)00010-7
author: Yaw-Ling Lin
author: Tao Jiang
author: Kun-Mao Chao
published in: Journal of Computer and System Sciences
publication date: 2003-05-14T00:00:00Z
Mathematics Subject Classification ID: 68P10
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 92D20
zbMATH DE Number: 1910850
zbMATH Keywords: Algorithm
zbMATH Keywords: Efficiency
zbMATH Keywords: Maximum consecutive subsequence
zbMATH Keywords: Length constraint
zbMATH Keywords: Biomolecular sequence analysis
zbMATH Keywords: Ungapped local alignment
MaRDI profile type: Publication
cites work: Q3044314
cites work: Q3619797
cites work: Pattern recognition in genetic sequences by mismatch density
cites work: An efficient algorithm for the length-constrained heaviest path problem on a tree
full work available at URL: s0022-0000(02)00010-7
OpenAlex ID: W2114510609
description: scientific article; zbMATH DE number 1910850