Algorithm 1:
Isoform Enumeration
input: A CG G = (V, E), and a set of mapped single-end or paired-end reads R |
output: A set of isoforms T |
begin |
Enumeration: |
T ← ∅ |
for![]() |
Enumerate all possible maximal paths P that begin at vj and end at some vk with outdeg(vk) = 0 |
T ← T ∪ P |
Filtration: |
for![]() |
Let ![]() |
T ← (T\{t}) ∪ {t′} |
Condensation: |
for![]() |
Let ![]() |
for![]() |
Let ![]() |
if![]() |
T ← (T\{t}) |