AN EFFICIENT ALGORITHM FOR CHINESE POSTMAN WALK ON BI-DIRECTED DE BRUIJN GRAPHS

DOI10.1142/S179383091250019XzbMath1251.05170OpenAlexW4247084496MaRDI QIDQ3166730

Heiu Dinh, Vamsi Krishna Kundeti, Sanguthevar Rajasekaran

Publication date: 15 October 2012

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s179383091250019x

zbMATH Keywords

bioinformaticsChinese postman problembi-directed graphssequence assembly algorithms

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Applications of graph theory (05C90) Combinatorics in computer science (68R05) Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Number-theoretic algorithms; complexity (11Y16) Graph algorithms (graph-theoretic aspects) (05C85) Eulerian and Hamiltonian graphs (05C45)

Cites Work

• An Eulerian path approach to DNA fragment assembly

This page was built for publication: AN EFFICIENT ALGORITHM FOR CHINESE POSTMAN WALK ON BI-DIRECTED DE BRUIJN GRAPHS