< Back to Article

A General Definition and Nomenclature for Alternative Splicing Events

Figure 8

Algorithm for the extraction of pairwise AS events.

The algorithm extracts from a splicing graph G(V,E) all events that are described by transcript pairs (S^t,S^u) in a locus C. By priority queue W, nodes s_i of the splicing graph are iterated from 5′ to 3′ according to pos(s_i). The queue contains at the beginning root and subsequently is filled with all nodes s_j that are connected by outedges of s_i —if they are supported by either S^t or S^u.

doi: https://doi.org/10.1371/journal.pcbi.1000147.g008