Nonoverlapping local alignments (weighted independent sets of axis parallel rectangles)

DOI10.1007/3-540-60220-8_89zbMATH Open1502.92003OpenAlexW1585646314MaRDI QIDQ5057461FDOQ5057461

R. Ravi, Babu Narayanan, Vineet Bafna

Publication date: 16 December 2022

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-60220-8_89

Recommendations

• Local multiple alignment via subgraph enumeration
• scientific article; zbMATH DE number 1996311
• Multiple Alignment, Communication Cost, and Graph Matching
• Hardness of approximation for non-overlapping local alignments.

Mathematics Subject Classification ID

Applications of graph theory (05C90) Biochemistry, molecular biology (92C40) Analysis of algorithms and problem complexity (68Q25) Integer programming (90C10) Computational methods for problems pertaining to biology (92-08)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Genome Rearrangements and Sorting by Reversals
• On Concentrators, Superconcentrators, Generalizers, and Nonblocking Networks

Cited In (3)

• Nonoverlapping local alignments (weighted independent sets of axis-parallel rectangles)
• Competitive algorithms for multistage online scheduling
• Title not available (Why is that?)

This page was built for publication: Nonoverlapping local alignments (weighted independent sets of axis parallel rectangles)

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