scientific article; zbMATH DE number 1945161

MaRDI QIDQ4410125zbMATH OpenFDO

Authors 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

Mathematics Subject Classification ID

Computing methodologies and applications (68U99) Nonnumerical algorithms (68W05) Protein sequences, DNA sequences (92D20)

Recommendations

• Linear-time algorithms for computing maximum-density sequence segments with bioinformatics applications
• An Optimal Algorithm for the Maximum-Density Segment Problem
• An optimal algorithm for the maximum-density segment problem
• Fast algorithms for the density finding problem
• Efficient algorithms for locating the length-constrained heaviest segments with applications to biomolecular sequence analysis.

Cited in

(23)

• Linear-time algorithm for finding a maximum-density segment of a sequence
• On locating disjoint segments with maximum sum of densities
• Fast algorithms for the density finding problem
• Optimal algorithms for locating the longest and shortest segments satisfying a sum or an average constraint
• Linear-time algorithms for computing maximum-density sequence segments with bioinformatics applications
• Finding a length-constrained maximum-density path in a tree
• Efficient algorithms for locating the length-constrained heaviest segments with applications to biomolecular sequence analysis.
• Algorithms for problems on maximum density segment
• Locating regions in a sequence under density constraints
• Fast and space-efficient location of heavy or dense segments in run-length encoded sequences (extended abstract)
• An optimal algorithm for maximum-sum segment and its application in bioinformatics (extended abstract)
• Computing Maximum-Scoring Segments in Almost Linear Time
• An Optimal Algorithm for the Maximum-Density Segment Problem
• scientific article; zbMATH DE number 1929960 (Why is no real title available?)
• Calculating a linear-time solution to the densest-segment problem
• On Locating Disjoint Segments with Maximum Sum of Densities
• An optimal algorithm for the maximum-density segment problem
• Algorithms and Computation
• Searching a bitstream in linear time for the longest substring of any given density
• A data structure for the maximum-sum segment problem with offsets
• Fast algorithms for finding disjoint subsequences with extremal densities
• Finding a length-constrained maximum-sum or maximum-density subtree and its application to logistics
• An efficient polynomial space and polynomial delay algorithm for enumeration of maximal motifs in a sequence

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4410125)