scientific article; zbMATH DE number 1929960

zbMath1014.68219MaRDI QIDQ4708595

Yaw-Ling Lin, Kun-Mao Chao, Tao Jiang

Publication date: 18 June 2003

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2420/24200459.htm

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

algorithmefficiencylength constraintbiomolecular sequence analysismaximum consecutive subsequenceungapped local alignment

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Protein sequences, DNA sequences (92D20)

Related Items (3)

Calculating a linear-time solution to the densest-segment problem ⋮ Searching a bitstream in linear time for the longest substring of any given density ⋮ Linear-time algorithm for finding a maximum-density segment of a sequence

This page was built for publication: