The paper discusses a hypergraph-based polynomial time algorithm for constructing a DNA sequence corresponding to a given spectrum with no errors. The presence of n-ary relations in the expression of DNA sequencing led to the advent of hypergraphs in DNA sequencing. An efficient algorithm, unimodular hypergraph (UMHG), has been proposed for constructing unimodular hypergraph that represents the short-read DNA sequence of the given spectrum. The performance of the proposed algorithm is evaluated in comparison with prominent algorithms such as greedy, greedy (lag), ant colony optimization(ACO), multi-level ACO, enhanced genetic algorithm (GA), hybrid GA and tabu search against 40 instances. The proposed UMHG algorithm is found to outperform the other algorithms in terms of average similarity score. UMHG is significant in terms of minimum computing time, especially as the spectrum size increases computing time decreases considerably, owing to the unimodularity property.

中文翻译：

---

DNA测序的单模超图：多项式时间算法

本文讨论了一种基于超图的多项式时间算法，该算法用于构建与给定光谱相对应的DNA序列而没有错误。DNA测序表达中n元关系的存在导致DNA测序中超图的出现。已经提出了一种有效的算法，单模超图（UMHG），用于构建代表给定频谱的短读DNA序列的单模超图。通过比较贪婪，贪婪（滞后），蚁群优化（ACO），多级ACO，增强遗传算法（GA），混合遗传算法和禁忌搜索等40种实例，评估了该算法的性能。发现所提出的UMHG算法在平均相似度得分方面优于其他算法。