Skip to content

This git is the codes of a webpage which illustrates the chaining section of the article A survey of mapping algorithms in the long-reads era by Sahlin et al.

Notifications You must be signed in to change notification settings

bastcazaux/minimap2_chaining_plot_web

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

4 Commits
 
 
 
 
 
 
 
 

Repository files navigation

minimap2_chaining_plot_web

This git is the codes of the webpage (http://bcazaux.polytech-lille.net/Minimap2/) which illustrates the chaining section of the article A survey of mapping algorithms in the long-reads era by Sahlin et al.

Two sequences (for instance a read on the Y axis and a reference genome on the X axis) share k-mers or more generally subsequences called anchors.

In our example, anchors are represented using dots. The chaining step of long read mappers aims at retrieving the best chain according to a score function.

We present examples voluntarily simple, but with secondary chains and some noise. The best score chained has a different color. The chain's score is computed using the different anchors' scores, that can be displayed by ticking "See scores".

About

This git is the codes of a webpage which illustrates the chaining section of the article A survey of mapping algorithms in the long-reads era by Sahlin et al.

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published