tex line issues

supplemental/sup_algs.tex

@@ -71,10 +71,7 @@ \subsection{{\em Enumeration problem} (Algorithm~\ref{Enumerator}):} First find
 	While $end - start > 0$ some number of intervals in $B$ must be scanned for
 	an intersection with $a_i$.  If $a_i$ intersections $b_from$ then let
 	$E[start] = <a_i, b_from>$ and $start=start+1$.  Then let $from = from +1$.
-	Finally, the total set of intersecting intervals $E$ is returned.
-
-    \\
-    \\
+	Finally, the total set of intersecting intervals $E$ is returned.\\
     \textbf{TODO: Fiddle with the TEX such that the algorithm comes before
     the start of section 2.}
     \\

supplemental/sup_code.tex

@@ -9,9 +9,5 @@ \subsection{Counting Comparison}
 {\tt bedIntersect}.  To exclude these differences from the results, we added
 timers to the source coude of the BEDTOOLS {\tt intersect} and 
 {\tt bedIntersect} source code to ensure that file input was not included in the
-reported execution time, and all file output commands were commented out.
-
-\\
-\\
-\textbf{TODO: Source code for these times is available at: ???.}
-\\
+reported execution time, and all file output commands were commented out.\\
+\textbf{TODO: Source code for these times is available at: ???.}

supplemental/sup_compare_files.tex

@@ -3,10 +3,7 @@ \subsection{Files}
 The NA12878 full-genome and exome-sequencing subsets, and the hg19 exons used to
 compare the performance of the difference algorithms are available at:
 
-\\
-\\
 \textbf{TODO: What is the URL?  Send me the files and I will post them.}
-\\
 
 \begin{itemize}
 	\item {\tt NA12878.exon.tar.gz}

supplemental/sup_mc_code.tex

@@ -19,10 +19,5 @@ \subsection{Monte Carlo Simulation Comparison}
 
 Since most of the comparisons in an MC simulation are randomly generated, and
 the number file IO operations is low , we determined that walltime was the
-best timing mechanism.
-
-
-\\
-\\
+best timing mechanism.\\
 \textbf{TODO: Source code for these times is available at: ???.}
-\\