Fast algorithms for the density finding problem

DOI10.1007/s00453-007-9023-8zbMath1172.68060OpenAlexW1973155071MaRDI QIDQ1024779

Hsueh-I Lu, Tien-Ching Lin, Der-Tsai Lee

Publication date: 17 June 2009

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-007-9023-8

zbMATH Keywords

convex hullbioinformaticscomputational geometryDNA sequencedensity finding problemGC contentmaximum-density segment problemslope selection problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Nonnumerical algorithms (68W05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Biochemistry, molecular biology (92C40) Protein sequences, DNA sequences (92D20)

Related Items

The density maximization problem in graphs ⋮ Algorithms for Problems on Maximum Density Segment ⋮ MINKOWSKI SUM SELECTION AND FINDING

Uses Software

• EMBOSS
• MAVG

Cites Work

• Unnamed Item
• Unnamed Item
• Linear-time algorithm for finding a maximum-density segment of a sequence
• Linear-time algorithms for computing maximum-density sequence segments with bioinformatics applications
• Efficient algorithms for locating the length-constrained heaviest segments with applications to biomolecular sequence analysis.
• An efficient algorithm for determining the convex hull of a finite planar set
• An Optimal Algorithm for the Maximum-Density Segment Problem