scientific article; zbMATH DE number 1945161
From MaRDI portal
Publication:4410125
zbMath1016.68667MaRDI QIDQ4410125
Michael H. Goldwasser, Hsueh-I Lu, Ming-Yang Kao
Publication date: 2 July 2003
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2452/24520157.htm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Nonnumerical algorithms (68W05) Computing methodologies and applications (68U99) Protein sequences, DNA sequences (92D20)
Related Items (7)
Finding a length-constrained maximum-sum or maximum-density subtree and its application to logistics ⋮ Calculating a linear-time solution to the densest-segment problem ⋮ Linear-time algorithms for computing maximum-density sequence segments with bioinformatics applications ⋮ Finding a length-constrained maximum-density path in a tree ⋮ Algorithms for Problems on Maximum Density Segment ⋮ Linear-time algorithm for finding a maximum-density segment of a sequence ⋮ Fast algorithms for the density finding problem
This page was built for publication:
