scientific article; zbMATH DE number 7378704
From MaRDI portal
Publication:5009594
DOI10.4230/LIPIcs.ESA.2018.34MaRDI QIDQ5009594
Publication date: 4 August 2021
Full work available at URL: https://arxiv.org/abs/1804.10930
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Uses Software
Cites Work
- Unnamed Item
- Solving VLSI design and DNA sequencing problems using bipartization of graphs
- Finding similar regions in many sequences
- Approximation schemes for node-weighted geometric Steiner tree problems
- The complexity of the single individual SNP haplotyping problem
- On the Fixed Parameter Tractability and Approximability of the Minimum Error Correction Problem
- Polynomial-time approximation schemes for geometric min-sum median clustering
- On Two Segmentation Problems
- Combinatorial Pattern Matching
- Segmentation problems
This page was built for publication:
