Unimodular hypergraph for DNA sequencing: a polynomial time algorithm
DOI10.1007/s40010-018-0561-zzbMath1448.92084OpenAlexW2899278113WikidataQ128976897 ScholiaQ128976897MaRDI QIDQ2212678
Swaminathan Venkatraman, Gangothri Rajaram, Kannan Krithivasan
Publication date: 24 November 2020
Published in: Proceedings of the National Academy of Sciences, India. Section A. Physical Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s40010-018-0561-z
hypergraphspectrumunimodularitysequencing by hybridizationanti-homomorphism\(n\)-ary relationshort-read
Applications of graph theory (05C90) Hypergraphs (05C65) Biochemistry, molecular biology (92C40) Protein sequences, DNA sequences (92D20)
Related Items (1)
Cites Work
This page was built for publication: Unimodular hypergraph for DNA sequencing: a polynomial time algorithm