Parent Directory
|
Revision Log
bmcEdits
\relax
\citation{Eddy99,MandalEtAl03,SijenPlasterk2003,Ambros2004,Baulcombe2004}
\citation{RivasEddy2000b}
\citation{CoventryEtAl2004,KnudsenHein99,RivasEddy2001}
\citation{CoventryEtAl2004}
\citation{GorodkinEtAl97}
\citation{MathewsTurner02}
\citation{PerriquetEtAl2003}
\citation{RivasEddy2001}
\citation{HolmesRubin2002a}
\citation{Sankoff85}
\citation{Zuker81}
\citation{Eddy94,Sakakibara94c,BrownWilson95,Lefebvre96,Durbin98,RivasEddy2001,HolmesRubin2002a}
\citation{HolmesRubin2002a,RivasEddy2001,MathewsTurner02,GorodkinEtAl97,HofackerEtAl2004}
\citation{MathewsTurner02}
\citation{GorodkinEtAl97}
\citation{HolmesRubin2002a}
\citation{RivasEddy2001}
\citation{Austern99}
\citation{Smith81}
\citation{WatermanEggert87}
\citation{HigginsSharp89}
\citation{GriffithsJonesEtAl2003}
\citation{Holmes98,DoEtAl2004}
\citation{Holmes2004}
\citation{Zuker81}
\citation{MathewsTurner02}
\citation{Durbin98}
\citation{Lari90}
\citation{Lefebvre96}
\citation{McCaskill90}
\citation{Altschul91}
\citation{Chomsky56,Chomsky59}
\citation{HolmesRubin2002a}
\citation{Durbin98}
\citation{HolmesRubin2002a}
\citation{Lari90}
\citation{HolmesRubin2002a}
\citation{Holmes98b}
\citation{ShapiroZhang90,HolmesRubin2002a}
\citation{KleinEddy2003}
\citation{RivasEddy2001}
\citation{GorodkinEtAl97}
\newlabel{eq:FoldAlignmentConstraints}{{1}{13}}
\citation{Austern99}
\citation{Durbin98}
\citation{HolmesRubin2002a}
\citation{Lari90,Durbin98}
\citation{WatermanEggert87}
\citation{Giegerich2000}
\citation{DowellEddy2004}
\citation{Holmes2004}
\citation{GriffithsJonesEtAl2003}
\citation{GriffithsJonesEtAl2003}
\citation{KnudsenHein99}
\bibstyle{bmc_article}
\bibdata{alignment}
\bibcite{Eddy99}{1}
\bibcite{MandalEtAl03}{2}
\bibcite{SijenPlasterk2003}{3}
\bibcite{Ambros2004}{4}
\bibcite{Baulcombe2004}{5}
\bibcite{RivasEddy2000b}{6}
\bibcite{CoventryEtAl2004}{7}
\bibcite{KnudsenHein99}{8}
\bibcite{RivasEddy2001}{9}
\bibcite{GorodkinEtAl97}{10}
\bibcite{MathewsTurner02}{11}
\bibcite{PerriquetEtAl2003}{12}
\bibcite{HolmesRubin2002a}{13}
\bibcite{Sankoff85}{14}
\bibcite{Zuker81}{15}
\bibcite{Eddy94}{16}
\bibcite{Sakakibara94c}{17}
\bibcite{BrownWilson95}{18}
\bibcite{Lefebvre96}{19}
\bibcite{Durbin98}{20}
\bibcite{HofackerEtAl2004}{21}
\bibcite{Austern99}{22}
\bibcite{Smith81}{23}
\bibcite{WatermanEggert87}{24}
\bibcite{HigginsSharp89}{25}
\bibcite{Lari90}{26}
\bibcite{McCaskill90}{27}
\bibcite{Altschul91}{28}
\bibcite{Chomsky56}{29}
\bibcite{Chomsky59}{30}
\bibcite{Holmes98b}{31}
\bibcite{ShapiroZhang90}{32}
\bibcite{KleinEddy2003}{33}
\bibcite{Giegerich2000}{34}
\bibcite{DowellEddy2004}{35}
\bibcite{Holmes2004}{36}
\bibcite{GriffithsJonesEtAl2003}{37}
\bibcite{Holmes98}{38}
\bibcite{DoEtAl2004}{39}
\@writefile{lof}{\contentsline {figure}{\numberline {1}{\ignorespaces A parse tree for the grammar of Table\nobreakspace {}1\hbox {}. Each internal node is labeled with a nonterminal ({\tt Stem} or {\tt Loop}); additionally, the subsequences $(X_{ij},Y_{kl})$ generated by each internal node are shown. The parse tree determines both the structure and alignment of the two sequences. The cut-points of the alignment are the sequence co-ordinates at which the alignment can be split, i.e. $\{ (0,0),\ (1,1),\ (2,2)\ \dots \ (15,12),\ (16,13),\ (17,14) \}$. }}{28}}
\newlabel{fig:ParseTree}{{1}{28}}
\@writefile{lof}{\contentsline {figure}{\numberline {2}{\ignorespaces Parsing a pair of sequences $(X,Y)$ using the Inside algorithm involves iterating over subsequence-pairs $(X_{ij},Y_{kl})$ specified by four indices $(i,j,k,l)$. In the constrained Inside algorithm, these indices are only valid if the {\em fold envelopes} (triangular grids) include the respective subsequences $(i,j)$ and $(k,l)$ (shown as black circles) and the {\em alignment envelope} (rectangular grid) includes both cutpoints $(i,k)$ and $(j,l)$ (shown as short diagonal lines). The filled cells in the rectangular grid show the aligned nucleotides. Note that the co-ordinates $(i,j,k,l)$ lie on the grid-lines {\em between} the nucleotides. }}{28}}
\newlabel{fig:ijkl}{{2}{28}}
\@writefile{lof}{\contentsline {figure}{\numberline {3}{\ignorespaces Bifurcation rules allow a subsequence-pair $(X_{ij},Y_{kl})$ to be composed from two adjoining subsequence-pairs $(X_{im},Y_{kn})$ and $(X_{nj},Y_{nl})$. For this to be permitted by the constraints, the $X$-fold envelope (upper triangular grid) must contain subsequences $(i,m)$, $(m,j)$ and $(i,j)$ (black dots), the $Y$-fold envelope (rightmost triangular grid) must contain subsequences $(k,n)$, $(n,l)$ and $(k,l)$ (black dots) and the alignment envelope (rectangular grid) must contain cutpoints $(i,k)$, $(m,n)$ and $(j,l)$ (short diagonal lines). The filled cells in the rectangular grid show the nucleotide homologies highlighted in the alignment. Note that all co-ordinates $(i,j,k,l,m,n)$ lie on the grid-lines between nucleotides. }}{28}}
\newlabel{fig:ijklmn}{{3}{28}}
\@writefile{lof}{\contentsline {figure}{\numberline {4}{\ignorespaces These fold envelopes (triangular grids) limit the maximum length of subsequences (black dots), while the alignment envelope (rectangular grid) limits the maximum deviation of cutpoints (short diagonal lines) from the main diagonal. }}{28}}
\newlabel{fig:Banding}{{4}{28}}
\@writefile{lof}{\contentsline {figure}{\numberline {5}{\ignorespaces These fold envelopes (triangular grids) and alignment envelope (rectangular grid) limit the subsequences (black dots) and cutpoints (short diagonal lines) to those consistent with a given alignment and consensus secondary structure (shown). The alignment path is also shown on the alignment envelope as a solid black line, broken by cutpoints. }}{28}}
\newlabel{fig:Alignment}{{5}{28}}
\@writefile{lof}{\contentsline {figure}{\numberline {6}{\ignorespaces Fold envelope size is highly correlated with $N$ in the $N$-best fold test, although the variance is large due to the diversity of alignments in the test. }}{28}}
\newlabel{fig:FoldEnvSize}{{6}{28}}
\@writefile{lof}{\contentsline {figure}{\numberline {7}{\ignorespaces Alignment envelope size is highly correlated with $N$ in the $N$-best alignment test, although the variance is large due to the diversity of alignments in the test. }}{28}}
\newlabel{fig:AlignEnvSize}{{7}{28}}
\@writefile{lof}{\contentsline {figure}{\numberline {8}{\ignorespaces Alignment sensitivity as a function of envelope size parameter $N$ for three different test regimes. }}{28}}
\newlabel{fig:AlignSens}{{8}{28}}
\@writefile{lof}{\contentsline {figure}{\numberline {9}{\ignorespaces Alignment specificity as a function of envelope size parameter $N$ for three different test regimes. }}{28}}
\newlabel{fig:AlignSpec}{{9}{28}}
\@writefile{lof}{\contentsline {figure}{\numberline {10}{\ignorespaces Fold sensitivity as a function of envelope size parameter $N$ for three different test regimes. }}{28}}
\newlabel{fig:FoldSens}{{10}{28}}
\@writefile{lof}{\contentsline {figure}{\numberline {11}{\ignorespaces Fold specificity as a function of envelope size parameter $N$ for three different test regimes. }}{28}}
\newlabel{fig:FoldSpec}{{11}{28}}
\@writefile{lof}{\contentsline {figure}{\numberline {12}{\ignorespaces Total running time of {\tt stemloc}\ (including envelope generation phases) as a function of envelope size parameter $N$ for three different test regimes. }}{28}}
\newlabel{fig:Runtime}{{12}{28}}
\@writefile{lof}{\contentsline {figure}{\numberline {13}{\ignorespaces Peak memory usage of {\tt stemloc}\ (i.e. the size of the principal CYK matrix) as a function of envelope size parameter $N$ for three different test regimes. }}{29}}
\newlabel{fig:Memory}{{13}{29}}
\@writefile{lot}{\contentsline {table}{\numberline {1}{\ignorespaces {\bf A stochastic context-free grammar for generating pairwise alignments of RNA structures.}}}{31}}
\newlabel{tab:StemLoopGrammar}{{1}{31}}
\@writefile{lot}{\contentsline {table}{\numberline {2}{\ignorespaces {\bf The {\tt stemloc}\ grammar, part 1 of 3: stem and loop structures.}}}{32}}
\newlabel{tab:StemlocStems}{{2}{32}}
\@writefile{lot}{\contentsline {table}{\numberline {3}{\ignorespaces {\bf The {\tt stemloc}\ grammar, part 2 of 3: bulges.}}}{33}}
\newlabel{tab:StemlocBulges}{{3}{33}}
\@writefile{lot}{\contentsline {table}{\numberline {4}{\ignorespaces {\bf The {\tt stemloc}\ grammar, part 3 of 3: emissions.}}}{34}}
\newlabel{tab:StemlocEmissions}{{4}{34}}
\@writefile{lot}{\contentsline {table}{\numberline {5}{\ignorespaces {\bf The subset of RFAM used to test the constrained SCFG algorithms.}}}{35}}
\newlabel{tab:TestSequences}{{5}{35}}
| Questions? Mail ihh at fruitfly dot org | ViewVC Help |
| Powered by ViewVC 1.0.3 |