Fast algorithms for the density finding problem

DOI10.1007/S00453-007-9023-8zbMATH Open1172.68060OpenAlexW1973155071MaRDI QIDQ1024779FDOQ1024779

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

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

computational geometryconvex hullDNA sequencebioinformaticsdensity finding problemGC contentmaximum-density segment problemslope selection problem

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• An efficient algorithm for determining the convex hull of a finite planar set
• 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 Optimal Algorithm for the Maximum-Density Segment Problem
• Linear-time algorithm for finding a maximum-density segment of a sequence

Cited In (4)

• The computational complexity of densest region detection
• MINKOWSKI SUM SELECTION AND FINDING
• Algorithms for Problems on Maximum Density Segment
• The density maximization problem in graphs

Uses Software

• EMBOSS
• MAVG

This page was built for publication: Fast algorithms for the density finding problem

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