zzh
/
minimap2
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

added one transition phrase 

as there are no subsubsections now
This commit is contained in:
Heng Li 2017-08-03 18:01:48 -04:00
parent c70b20ee6d
commit f57fd8c790
1 changed files with 6 additions and 6 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

12
tex/minimap2.tex
View File

@ -97,12 +97,12 @@ $O(h\cdot m)$. In practice, we can almost always find the optimal chain with
$h=50$; even if the heuristic fails, the optimal chain is often close. $h=50$; even if the heuristic fails, the optimal chain is often close.
%\subsubsection{Backtracking} %\subsubsection{Backtracking}
Let $P(i)$ be the index of the best predecessor of anchor $i$. It equals 0 if For backtracking, let $P(i)$ be the index of the best predecessor of anchor
$f(i)=w_i$ or $\argmax_j\{f(j)+\eta(j,i)-\gamma(j,i)\}$ otherwise. For each $i$. It equals 0 if $f(i)=w_i$ or $\argmax_j\{f(j)+\eta(j,i)-\gamma(j,i)\}$
anchor $i$ in the descending order of $f(i)$, we apply $P(\cdot)$ repeatedly to otherwise. For each anchor $i$ in the descending order of $f(i)$, we apply
find its predecessor and mark each visited $i$ as `used', until $P(i)=0$ or we $P(\cdot)$ repeatedly to find its predecessor and mark each visited $i$ as
reach an already `used' $i$. This way we find all chains with no anchors used `used', until $P(i)=0$ or we reach an already `used' $i$. This way we find all
in more than one chains. chains with no anchors used in more than one chains.
%\subsubsection{Identifying primary chains} %\subsubsection{Identifying primary chains}
In the absence of copy number changes, each query segment should not be mapped In the absence of copy number changes, each query segment should not be mapped