Skip to main content
. 2011 Nov;18(11):1693–1707. doi: 10.1089/cmb.2011.0171

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 ← ∅
forInline graphicwith indeg(vj) = 0 do
  Enumerate all possible maximal paths P that begin at vj and end at some vk with outdeg(vk) = 0
  T ← T ∪ P
Filtration:
forInline graphicdo
  Let Inline graphic
  T ← (T\{t}) ∪ {t′}
Condensation:
forInline graphicdo
  Let Inline graphic
  forInline graphicdo
   Let Inline graphic
   ifInline graphicthen
    T ← (T\{t})