Overlap-layout-consensus for fragment assembly
(OLC)
- Overlap–layout–consensus genome assembly algorithm
(OLC):-
- In Genomics, Overlapping regions are identified. Each read is
graphed as a node and the overlaps are represented as edges joining
the two nodes involved. The algorithm determines the best path
through the graph (Hamiltonian path). Redundant information (i.e.,
unused nodes and edges) is discarded. This process is carried out
multiple times and resulting sequences are combined to give the
final consensus sequence that represents the genome.
- In the DNA sequences, it is used for unresolvable repeats by
essentially leaving them out fragments are contigs (short for
contiguous)Unresolvable repeats break the assembly into a
fragment.
- we follow 3-steps in this algorithm.
- Overlap ---> Build overlap graph --->
Finding overlaps.
- Layout ---> Bundle stretches
of the overlap graph into contigs.
- Consensus ---> Pick most likely nucleotide sequences
for each contig.
- This is how we will use this algorithm in
Genomics.
Thank You...!