TY - GEN
T1 - Dotted Interval Graphs and High Throughput Genotyping
AU - Aumann, Y.
AU - Lewenstein, M.
AU - Melamud, O.
AU - Pinter, R.
AU - Yakhini, Z.
N1 - Place of conference:Vancouver, BC, Canada
PY - 2005
Y1 - 2005
N2 - We introduce a generalization of interval graphs, which we call dotted interval graphs (DIG). A dotted interval graph is an intersection graph of arithmetic progressions (=dotted intervals). Coloring of dotted intervals graphs naturally arises in the context of high throughput genotyping. We study the properties of dotted interval graphs, with a focus on coloring. We show that any graph is a DIG but that DIGd graphs, i.e. DIGs in which the arithmetic progressions have a jump of at most d, form a strict hierarchy. We show that coloring DIGd, graphs is NP-complete even for d = 2. For any fixed d, we provide a 7/8d approximation for the coloring of DIGd graphs.
AB - We introduce a generalization of interval graphs, which we call dotted interval graphs (DIG). A dotted interval graph is an intersection graph of arithmetic progressions (=dotted intervals). Coloring of dotted intervals graphs naturally arises in the context of high throughput genotyping. We study the properties of dotted interval graphs, with a focus on coloring. We show that any graph is a DIG but that DIGd graphs, i.e. DIGs in which the arithmetic progressions have a jump of at most d, form a strict hierarchy. We show that coloring DIGd, graphs is NP-complete even for d = 2. For any fixed d, we provide a 7/8d approximation for the coloring of DIGd graphs.
UR - http://dl.acm.org/citation.cfm?id=1070480&dl=ACM&coll=DL&CFID=813082855&CFTOKEN=40789353
M3 - Conference contribution
BT - sixteenth annual ACM-SIAM symposium on Discrete algorithms
ER -