◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Heiu Dinh

1 paper hereh-index 16 citations1 works total

Matching runs newest-first, so older work may not be attached to this profile yet.

author position
  • last author1

Across the 1 of 1 paper where every author was matched, so the position is known.

fields
  • cs.DS1

identity via Semantic Scholar / OpenAlex

most citedAn Efficient Algorithm For Chinese Postman Walk on Bi-directed de Bruijn Graphs

10 citations · 10 across the 1 of their papers we have counts for

collaborators

1 paper

cs.DS2010★ 10 cited

An Efficient Algorithm For Chinese Postman Walk on Bi-directed de Bruijn Graphs

Vamsi Kundeti, Sanguthevar Rajasekaran, Hieu Dinh

Sequence assembly from short reads is an important problem in biology. It is known that solving the sequence assembly problem exactly on a bi-directed de Bruijn graph or a string g…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.