An Efficient Algorithm for Chinese Postman Walk on Bi-directed de Bruijn Graphs - researchr publication related

researchr

You are not signed in
Sign in
Sign up

Vamsi Kundeti, Sanguthevar Rajasekaran, Dinh Heiu. An Efficient Algorithm for Chinese Postman Walk on Bi-directed de Bruijn Graphs. In Weili Wu, Ovidiu Daescu, editors, Combinatorial Optimization and Applications - 4th International Conference, COCOA 2010, Kailua-Kona, HI, USA, December 18-20, 2010, Proceedings, Part I. Volume 6508 of Lecture Notes in Computer Science, pages 184-196, Springer, 2010. [doi]

The following publications are possibly variants of this publication:

An Efficient Algorithm for Chinese Postman Walk on Bi-Directed de Bruijn GraphsVamsi Kundeti, Sanguthevar Rajasekaran, Hieu Dinh. dmaa, 4(2), 2012. [doi]

Efficient parallel and out of core algorithms for constructing large bi-directed de Bruijn graphsVamsi Kundeti, Sanguthevar Rajasekaran, Hieu Dinh, Matthew Vaughn, Vishal Thapar. bmcbi, 11:560, 2010. [doi]

runs on WebDSL