scientific article; zbMATH DE number 1996311

MaRDI QIDQ4432280zbMATH OpenFDO

Authors Piotr Berman, Bhaskar Dasgupta

Publication date 16 December 2003

zbMATH Keywords

approximation algorithmscomparison of genomic sequencescomputational biologynonoverlapping local alignments

Mathematics Subject Classification ID

Computational methods for problems pertaining to biology (92-08) Biochemistry, molecular biology (92C40)

Recommendations

• Nonoverlapping local alignments (weighted independent sets of axis-parallel rectangles)
• Nonoverlapping local alignments (weighted independent sets of axis parallel rectangles)
• APPROXIMATION ALGORITHMS FOR LOCAL ALIGNMENT WITH LENGTH CONSTRAINTS
• Hardness of approximation for non-overlapping local alignments.
• scientific article; zbMATH DE number 2086217
• An Algorithm for Locating Nonoverlapping Regions of Maximum Alignment Score
• Efficient algorithms for local alignment search
• Approximation algorithms for aligning points
• Approximation algorithms for aligning points
• Locally optimal subalignments using nonlinear similarity functions

Cited in

(7)

• Hardness of approximation for non-overlapping local alignments.
• Competitive algorithms for multistage online scheduling
• Approximation algorithms for aligning points
• An Algorithm for Locating Nonoverlapping Regions of Maximum Alignment Score
• Nonoverlapping local alignments (weighted independent sets of axis parallel rectangles)
• Approximation algorithms for aligning points
• Nonoverlapping local alignments (weighted independent sets of axis-parallel rectangles)

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 Q4432280)