A graph-theoretic barcode ordering model for linked-reads
From MaRDI portal
Publication:6487642
Recommendations
Cites work
- Algorithmic graph theory and perfect graphs
- Efficient algorithms for finding maximum matching in graphs
- Interval Completion Is Fixed Parameter Tractable
- Interval graph representation with given interval and intersection lengths
- Linear-time recognition of circular-arc graphs
- On the parameterized complexity of multiple-interval graph problems
- Optimization problems in multiple-interval graphs
- Realizing Interval Graphs with Size and Distance Constraints
- Recognizing d-interval graphs and d-track interval graphs
- Recognizing graphs with fixed interval number is NP-complete
- Research in computational molecular biology. 22nd annual international conference, RECOMB 2018, Paris, France, April 21--24, 2018. Proceedings
- Scheduling Split Intervals
- Subexponential parameterized algorithm for {\textsc{Interval Completion}}
- Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
- The maximum clique problem in multiple interval graphs
- The worst-case time complexity for generating all maximal cliques and computational experiments
This page was built for publication: A graph-theoretic barcode ordering model for linked-reads
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6487642)
