18 citations · 44 across the 10 of their papers we have counts for
3 papers · 1 filter
Evaluating Optimal Safe Flows Decomposition for RNA Assembly
Bashar Ahmed, Siddharth Singh Rana, Ujjwal +1
In Bioinformatics, the applications of flow decomposition in directed acyclic graphs are highlighted in RNA Assembly problem. However, it admits multiple solutions where exactly on…
Engineering Semi-streaming DFS algorithms
Kancharla Nikhilesh Bhagavan, Macharla Sri Vardhan, Madamanchi Ashok Chowdary +1
Depth first search is a fundamental graph problem having a wide range of applications. For a graph having vertices and edges, the DFS tree can be computed in $O(m…
Practical algorithms for Hierarchical overlap graphs
Saumya Talera, Parth Bansal, Shabnam Khan +1
Genome assembly is a prominent problem studied in bioinformatics, which computes the source string using a set of its overlapping substrings. Classically, genome assembly uses asse…