{"id":"https://openalex.org/W4247084496","doi":"https://doi.org/10.1142/s179383091250019x","title":"AN EFFICIENT ALGORITHM FOR CHINESE POSTMAN WALK ON BI-DIRECTED DE BRUIJN GRAPHS","display_name":"AN EFFICIENT ALGORITHM FOR CHINESE POSTMAN WALK ON BI-DIRECTED DE BRUIJN GRAPHS","publication_year":2012,"publication_date":"2012-06-01","ids":{"openalex":"https://openalex.org/W4247084496","doi":"https://doi.org/10.1142/s179383091250019x"},"language":"en","primary_location":{"id":"doi:10.1142/s179383091250019x","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s179383091250019x","pdf_url":null,"source":{"id":"https://openalex.org/S178434951","display_name":"Discrete Mathematics Algorithms and Applications","issn_l":"1793-8309","issn":["1793-8309","1793-8317"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discrete Mathematics, Algorithms and Applications","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5007900967","display_name":"Vamsi Kundeti","orcid":null},"institutions":[{"id":"https://openalex.org/I140172145","display_name":"University of Connecticut","ror":"https://ror.org/02der9h97","country_code":"US","type":"education","lineage":["https://openalex.org/I140172145"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"VAMSI KUNDETI","raw_affiliation_strings":["Department of Computer Science and Engineering, University of Connecticut Storrs, CT 06269, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, University of Connecticut Storrs, CT 06269, USA","institution_ids":["https://openalex.org/I140172145"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5034177039","display_name":"Sanguthevar Rajasekaran","orcid":null},"institutions":[{"id":"https://openalex.org/I140172145","display_name":"University of Connecticut","ror":"https://ror.org/02der9h97","country_code":"US","type":"education","lineage":["https://openalex.org/I140172145"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"SANGUTHEVAR RAJASEKARAN","raw_affiliation_strings":["Department of Computer Science and Engineering, University of Connecticut Storrs, CT 06269, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, University of Connecticut Storrs, CT 06269, USA","institution_ids":["https://openalex.org/I140172145"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5017552511","display_name":"Heiu Dinh","orcid":null},"institutions":[{"id":"https://openalex.org/I140172145","display_name":"University of Connecticut","ror":"https://ror.org/02der9h97","country_code":"US","type":"education","lineage":["https://openalex.org/I140172145"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"HEIU DINH","raw_affiliation_strings":["Department of Computer Science and Engineering, University of Connecticut Storrs, CT 06269, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, University of Connecticut Storrs, CT 06269, USA","institution_ids":["https://openalex.org/I140172145"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I140172145"],"apc_list":null,"apc_paid":null,"fwci":0.123,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.5254926,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"04","issue":"02","first_page":"1250019","last_page":"1250019"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10015","display_name":"Genomics and Phylogenetic Studies","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}},"topics":[{"id":"https://openalex.org/T10015","display_name":"Genomics and Phylogenetic Studies","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}},{"id":"https://openalex.org/T10521","display_name":"RNA and protein synthesis mechanisms","score":0.9962000250816345,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}},{"id":"https://openalex.org/T10434","display_name":"Chromosomal and Genetic Variations","score":0.9878000020980835,"subfield":{"id":"https://openalex.org/subfields/1110","display_name":"Plant Science"},"field":{"id":"https://openalex.org/fields/11","display_name":"Agricultural and Biological Sciences"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/de-bruijn-graph","display_name":"De Bruijn graph","score":0.9306080341339111},{"id":"https://openalex.org/keywords/de-bruijn-sequence","display_name":"De Bruijn sequence","score":0.7934437990188599},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7159167528152466},{"id":"https://openalex.org/keywords/directed-graph","display_name":"Directed graph","score":0.6278598308563232},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5091776251792908},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4546939432621002},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.437100887298584},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.42604056000709534},{"id":"https://openalex.org/keywords/asymptotically-optimal-algorithm","display_name":"Asymptotically optimal algorithm","score":0.41976967453956604},{"id":"https://openalex.org/keywords/string","display_name":"String (physics)","score":0.41323480010032654}],"concepts":[{"id":"https://openalex.org/C20218877","wikidata":"https://www.wikidata.org/wiki/Q3066095","display_name":"De Bruijn graph","level":3,"score":0.9306080341339111},{"id":"https://openalex.org/C170320093","wikidata":"https://www.wikidata.org/wiki/Q1953457","display_name":"De Bruijn sequence","level":2,"score":0.7934437990188599},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7159167528152466},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.6278598308563232},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5091776251792908},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4546939432621002},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.437100887298584},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.42604056000709534},{"id":"https://openalex.org/C181789720","wikidata":"https://www.wikidata.org/wiki/Q4812191","display_name":"Asymptotically optimal algorithm","level":2,"score":0.41976967453956604},{"id":"https://openalex.org/C157486923","wikidata":"https://www.wikidata.org/wiki/Q1376436","display_name":"String (physics)","level":2,"score":0.41323480010032654},{"id":"https://openalex.org/C37914503","wikidata":"https://www.wikidata.org/wiki/Q156495","display_name":"Mathematical physics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s179383091250019x","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s179383091250019x","pdf_url":null,"source":{"id":"https://openalex.org/S178434951","display_name":"Discrete Mathematics Algorithms and Applications","issn_l":"1793-8309","issn":["1793-8309","1793-8317"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discrete Mathematics, Algorithms and Applications","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320320766","display_name":"Nanyang Technological University","ror":"https://ror.org/02e7b5302"},{"id":"https://openalex.org/F4320332161","display_name":"National Institutes of Health","ror":"https://ror.org/01cwqze88"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":5,"referenced_works":["https://openalex.org/W2127230663","https://openalex.org/W2136651963","https://openalex.org/W2156104322","https://openalex.org/W2160969485","https://openalex.org/W2168909179"],"related_works":["https://openalex.org/W2562683361","https://openalex.org/W3087469195","https://openalex.org/W3125399386","https://openalex.org/W2354744388","https://openalex.org/W2949121831","https://openalex.org/W3215786367","https://openalex.org/W2756186577","https://openalex.org/W2735897904","https://openalex.org/W3126092857","https://openalex.org/W2059416361"],"abstract_inverted_index":{"Sequence":[0],"assembly":[1,18],"from":[2,84,295],"short":[3,293],"reads":[4,49,294],"is":[5,12,31,65,93,193,242],"an":[6,301],"important":[7],"problem":[8,19,64,325],"in":[9,47,108,199,252],"biology.":[10],"It":[11],"known":[13],"that":[14,116,213,266],"solving":[15],"the":[16,44,48,60,76,85,117,146,182,187,197,200,214,246,285,320],"sequence":[17],"exactly":[20],"on":[21,75,103,120,149,207,278,292,326],"a":[22,28,35,53,69,99,134,150,296,311],"bi-directed":[23,79,101,121,130,152,183,201,228,247,264,327],"de":[24,80,153,229,328],"Bruijn":[25,81,154,230,329],"graph":[26,30,82,105],"or":[27],"string":[29,40],"intractable.":[32],"However,":[33],"finding":[34,68],"shortest":[36,323],"double":[37],"stranded":[38],"DNA":[39],"(SDDNA)":[41],"containing":[42],"all":[43],"k-long":[45],"words":[46],"seems":[50],"to":[51,56,59,67,98,129,144],"be":[52,124,250,333],"good":[54],"heuristic":[55,275],"get":[57],"close":[58],"original":[61],"genome.":[62],"This":[63,288],"equivalent":[66],"cyclic":[70,118,147,235],"Chinese":[71,88],"Postman":[72,89],"(CP)":[73],"walk":[74,90],"underlying":[77],"unweighted":[78],"built":[83],"reads.":[86],"The":[87],"Problem":[91],"(CPP)":[92],"solved":[94,125],"by":[95],"reducing":[96,127],"it":[97,128,241],"general":[100],"flow":[102,184,248],"this":[104,112],"which":[106,331],"runs":[107],"O(|E|2log2(|V|))":[109],"time.":[110],"In":[111,238],"paper":[113],"we":[114,210],"show":[115],"CPP":[119,148],"graphs":[122,231],"can":[123,249,257],"without":[126],"flow.":[131],"We":[132,308],"present":[133,310],"\u0398(p(|V|":[135,271],"+":[136,140,272,313],"|E|)":[137,314],"log":[138,315],"(|V|)":[139],"(dmaxp)3)":[141],"time":[142,274,317],"algorithm":[143,177,185,256,276,289,318],"solve":[145],"weighted":[151],"graph,":[155],"where":[156],"p":[157,192],"=":[158],"max":[159,172],"{|{v|din(v)":[160],"-":[161,166,174],"dout(v)":[162,167],">":[163],"0}|,":[164],"|{v|din(v)":[165],"<":[168],"0}|}":[169],"and":[170,221,261,299],"dmax=":[171],"{|din(v)":[173],"dout(v)}.":[175],"Our":[176,255],"performs":[178],"asymptotically":[179],"better":[180],"than":[181,196],"when":[186],"number":[188],"of":[189,216,304,334],"imbalanced":[190],"nodes":[191,198],"much":[194],"less":[195],"graph.":[202],"From":[203],"our":[204],"experimental":[205],"results":[206],"various":[208],"datasets,":[209],"have":[211,234,267],"noticed":[212],"value":[215],"p/|V|":[217],"lies":[218],"between":[219],"0.08%":[220],"0.13%":[222],"with":[223],"95%":[224],"probability.":[225],"Many":[226],"practical":[227],"do":[232],"not":[233,243],"CP":[236,268],"walks.":[237,269],"such":[239,259],"cases":[240],"clear":[244],"how":[245],"useful":[251],"identifying":[253],"contigs.":[254],"handle":[258],"situations":[260],"identify":[262],"maximal":[263],"sub-graphs":[265],"A":[270],"|E|))":[273],"based":[277],"these":[279],"ideas":[280],"has":[281],"been":[282],"implemented":[283],"for":[284,319],"SDDNA":[286],"problem.":[287],"was":[290],"tested":[291],"plant":[297],"genome":[298],"achieves":[300],"approximation":[302],"ratio":[303],"at":[305],"most":[306],"1.0134.":[307],"also":[309],"\u0398((|V|":[312],"(V))":[316],"single":[321],"source":[322],"path":[324],"graphs,":[330],"may":[332],"independent":[335],"interest.":[336]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2026-08-21T09:56:20.448147","created_date":"2025-10-10T00:00:00"}