Algorithm for DNA sequence assembly by quantum annealing

BMC Bioinformatics

Table 2 Results of experiments for circular random sequences (datasetA), coverage = 5

Overlap length	Method	Path cost	Real contigs	Calculated contigs	Correct overlaps	Incorrect overlaps	Accuracy
0% errors
2300	GOT	0	0	0	51	0	1.00
2300	DWVRP	268	2	2	49	0	1.00
2500	GOT	0	0	0	51	0	1.00
2500	DWVRP	309	2	2	49	0	1.00
2700	GOT	0	0	0	51	0	1.00
2700	DWVRP	113	1	1	50	0	1.00
0.5% errors
2300	GOT	449	2	2	49	0	1.00
2300	DWVRP	648	1	6	45	0	0.90
2500	GOT	350	2	3	48	0	0.98
2500	DWVRP	390	1	7	44	0	0.88
2700	GOT	349	0	3	48	0	0.94
2700	DWVRP	484	0	10	41	0	0.80
1.0% errors
2300	GOT	507	0	2	49	0	0.96
2300	DWVRP	965	3	6	45	0	0.94
2500	GOT	469	1	4	47	0	0.94
2500	DWVRP	892	3	7	44	0	0.92
2700	GOT	648	1	5	46	0	0.92
2700	DWVRP	881	2	8	43	0	0.88
1.5% errors
2300	GOT	912	0	3	48	0	0.94
2300	DWVRP	1331	2	5	46	0	0.94
2500	GOT	1054	3	5	45	1	0.92
2500	DWVRP	2233	10	12	39	0	0.96
2700	GOT	724	0	8	43	0	0.84
2700	DWVRP	1124	2	10	41	0	0.84

ISSN: 1471-2105