Dotted interval graphs and high throughput genotyping

MaRDI QIDQ2921688zbMATH OpenFDO

Authors Yonatan Aumann, Oren Melamud, Zohar Yakhini, Moshe Lewenstein, Ron Y. Pinter

Publication date 13 October 2014

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph representations (geometric and intersection representations, etc.) (05C62) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Genetics and epigenetics (92D10)

Recommendations

• Dotted interval graphs
• Approximating minimum coloring and maximum independent set in dotted interval graphs
• Approximation algorithm for coloring of dotted interval graphs
• Optimization problems in dotted interval graphs
• Optimization problems in dotted interval graphs

Cited in

(5)

• On the parameterized complexity of multiple-interval graph problems
• The maximum clique problem in multiple interval graphs
• Dotted interval graphs
• Approximating minimum coloring and maximum independent set in dotted interval graphs
• Approximation algorithm for coloring of dotted interval graphs

This page was built for publication: Dotted interval graphs and high throughput genotyping

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