Commit 3f701eac authored by waldispuhl's avatar waldispuhl
Browse files

format NAR

parent 472ae2cf
......@@ -284,10 +284,10 @@ Since both negative and positive correlations can indicate
positions of interest, we use two different, $\zeta^-$ and $\zeta^+$, thresholds for the \NPMI{}s. $\zeta^+$ will be a bound on the positive values of the \NPMI and $\zeta^-$ on the negative ones. Due to the
high number of possible combinations, \NPMI{}s having values $-1$ are frequent and uninformative. They are discarded.
{\color{red} For those loops deemed as regions of interest, we predict that the set of positions with an \NPMI above $\zeta^+$ or below $\zeta^-$ are nucleotides in binding interfaces while the others are not.}
{\color{red} For those loops deemed as regions of interest, we predict that the set of positions with an \NPMI above $\zeta^+$ or below $\zeta^-$ are nucleotides in binding interfaces while the others are not.}\\
{\removelatexerror
\begin{algorithm}
\begin{algorithm}[H]
\DontPrintSemicolon
\SetAlgoLined
\SetKwFunction{shapeDisruption}{shapeDisruption}
......@@ -308,7 +308,7 @@ $l = D = \varnothing$\;
\end{algorithm}}
{\removelatexerror
\begin{algorithm}
\begin{algorithm}[H]
\DontPrintSemicolon
\SetAlgoLined
\SetKwFunction{getAllNPMIs}{getAllNPMIs}
......@@ -335,7 +335,7 @@ $\zeta^-\leftarrow -1\times\percentile(-1\times a[-1<a<0], \zeta_c)$\;
\end{algorithm}}
{\removelatexerror
\begin{algorithm}
\begin{algorithm}[H]
\DontPrintSemicolon
\SetAlgoLined
\SetKwFunction{maxShortestPath}{distance}
......@@ -363,7 +363,7 @@ $g\leftarrow\SGraph(S)$\;
\end{algorithm}}
{\removelatexerror
\begin{algorithm}
\begin{algorithm}[H]
\DontPrintSemicolon
\SetAlgoLined
\SetKwFunction{filterMutations}{disruptiveMutations}
......
Markdown is supported
0% or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment