<?xml version="1.0" encoding="utf-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Recent changes to Home</title><link>https://sourceforge.net/p/psfc/wiki/Home/</link><description>Recent changes to Home</description><atom:link href="https://sourceforge.net/p/psfc/wiki/Home/feed" rel="self"/><language>en</language><lastBuildDate>Sat, 11 Jan 2014 21:24:12 -0000</lastBuildDate><atom:link href="https://sourceforge.net/p/psfc/wiki/Home/feed" rel="self" type="application/rss+xml"/><item><title>Home modified by Benjamin Lee</title><link>https://sourceforge.net/p/psfc/wiki/Home/</link><description>&lt;div class="markdown_content"&gt;&lt;pre&gt;--- v45
+++ v46
@@ -57,6 +57,6 @@
 This program was written while working in the Department of Physics and Astronomy at Johns Hopkins University.  I would like to thank Dr. Richard Wilton for all of his guidance.

 [[project_admins ]] 
-
+

&lt;/pre&gt;
&lt;/div&gt;</description><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Benjamin Lee</dc:creator><pubDate>Sat, 11 Jan 2014 21:24:12 -0000</pubDate><guid>https://sourceforge.net54fad6a624e1572e47f9afb645bcf4d9ac08c992</guid></item><item><title>WikiPage Home modified by Benjamin Lee</title><link>https://sourceforge.net/p/psfc/wiki/Home/</link><description>&lt;pre&gt;&lt;/pre&gt;</description><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Benjamin Lee</dc:creator><pubDate>Mon, 08 Oct 2012 19:54:15 -0000</pubDate><guid>https://sourceforge.net3e6699779afc7c849f36f16ce15bd338402f565f</guid></item><item><title>WikiPage Home modified by Benjamin Lee</title><link>https://sourceforge.net/p/psfc/wiki/Home/</link><description>&lt;pre&gt;--- v43
+++ v44
@@ -6,6 +6,8 @@
 Modern high-throughput DNA sequencers typically generate short DNA sequences of about 100 bases in length.  Because a 100-base DNA sequence is relatively short, a commonly-used technique for dealing with longer DNA sequences is to use biochemical manipulations to generate much longer sequences of predetermined length and then to sequence the 100 bases at each end.  The DNA sequencer records these "paired-end reads" in two files in which paired reads are located in corresponding positions in each file.
 
 This "paired file comparison" program compares two such files to validate that they do indeed contain paired-end reads.  It compares the metadata of the sequences at corresponding positions in each file.  Because both files are validated from start to end, the program ensures that the files correspond to each other and that no data have been inserted or deleted.  This process of validating metadata also serves as a reasonable test of data integrity in general, as any data corruption that affects the metadata will be detected.
+
+Please note that the majority of the documentation for the code appears to the right of the code itself.                                  
 
 
 
@@ -51,7 +53,8 @@
  appears to the right of the code itself.         //like so &lt;/pre&gt;
 
 
-
+&lt;h5&gt; Acknowledgments:&lt;/h5&gt;
+This program was written while working in the Department of Physics and Astronomy at Johns Hopkins University.  I would like to thank Dr. Richard Wilton for all of his guidance.
 
 [[project_admins ]] 
 &lt;bclee@mcdonogh.org&gt;
&lt;/pre&gt;</description><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Benjamin Lee</dc:creator><pubDate>Mon, 08 Oct 2012 19:53:46 -0000</pubDate><guid>https://sourceforge.net3e25334ef60ad3ee76c8ebc111bcf62205ff53cc</guid></item><item><title>WikiPage Home modified by Benjamin Lee</title><link>https://sourceforge.net/p/psfc/wiki/Home/</link><description>&lt;pre&gt;--- v42
+++ v43
@@ -1,3 +1,5 @@
+By Benjamin C.G. Lee
+
 &lt;h5&gt;Summary:&lt;/h5&gt;
 
 
&lt;/pre&gt;</description><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Benjamin Lee</dc:creator><pubDate>Mon, 01 Oct 2012 00:53:32 -0000</pubDate><guid>https://sourceforge.netad5945f51ac79568438adf14ee42d3a185f75032</guid></item><item><title>WikiPage Home modified by Benjamin Lee</title><link>https://sourceforge.net/p/psfc/wiki/Home/</link><description>&lt;pre&gt;--- v41
+++ v42
@@ -1,9 +1,9 @@
 &lt;h5&gt;Summary:&lt;/h5&gt;
 
 
-Modern high-throughput DNA sequencers typically generate short DNA sequences of about 100 bases.  A commonly-used technique for dealing with longer DNA sequences is to use biochemical manipulations to generate much longer sequences of predetermined length and then to sequence the 100 bases at each end.  The DNA sequencer records these "paired-end reads" in two parallel files in which paired reads are located in corresponding positions in each file.
+Modern high-throughput DNA sequencers typically generate short DNA sequences of about 100 bases in length.  Because a 100-base DNA sequence is relatively short, a commonly-used technique for dealing with longer DNA sequences is to use biochemical manipulations to generate much longer sequences of predetermined length and then to sequence the 100 bases at each end.  The DNA sequencer records these "paired-end reads" in two files in which paired reads are located in corresponding positions in each file.
 
-This "paired file comparison" program compares two such files to validate that they do indeed contain paired-end reads.  It compares the metadata of the sequences at corresponding positions in the files.  Because both files are read and compared from start to end, the program ensures that the files do indeed correspond to each other and that no data have been inserted or deleted.  This process of validating read metadata also serves as a reasonable validation of data integrity in general, as any corruption of the data in the file that affects the metadata will be detected.
+This "paired file comparison" program compares two such files to validate that they do indeed contain paired-end reads.  It compares the metadata of the sequences at corresponding positions in each file.  Because both files are validated from start to end, the program ensures that the files correspond to each other and that no data have been inserted or deleted.  This process of validating metadata also serves as a reasonable test of data integrity in general, as any data corruption that affects the metadata will be detected.
 
 
 
@@ -36,7 +36,7 @@
 
 &lt;h5&gt;Performance:&lt;/h5&gt;
   
-On a CPU with multiple cores, performance tends to be limited by disk I/O bandwidth.  For example, the first time the program is run using two specific files after the computer has been turned on will take much longer than subsequent runs.
+On a CPU with multiple cores, performance tends to be limited by disk I/O bandwidth.  When running on 8 concurrent threads with a 3GHz CPU, the program requires 8 seconds to validate two 4.06 GB FASTQ files each containing 26.5 million reads. 
 
 
 &lt;h5&gt;Sample Files:&lt;/h5&gt;
&lt;/pre&gt;</description><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Benjamin Lee</dc:creator><pubDate>Sat, 29 Sep 2012 18:04:05 -0000</pubDate><guid>https://sourceforge.netf2548c28d94c2b560765195b392648f8e83b8bb2</guid></item><item><title>WikiPage Home modified by Benjamin Lee</title><link>https://sourceforge.net/p/psfc/wiki/Home/</link><description>&lt;pre&gt;--- v40
+++ v41
@@ -6,14 +6,13 @@
 This "paired file comparison" program compares two such files to validate that they do indeed contain paired-end reads.  It compares the metadata of the sequences at corresponding positions in the files.  Because both files are read and compared from start to end, the program ensures that the files do indeed correspond to each other and that no data have been inserted or deleted.  This process of validating read metadata also serves as a reasonable validation of data integrity in general, as any corruption of the data in the file that affects the metadata will be detected.
 
 
+
 &lt;h5&gt;System requirements:&lt;/h5&gt;  
 
  - Operating Systems:
   -- Windows 7
   -- Linux
 
- 
-- Memory:
 
 
 &lt;h5&gt;Command-line syntax:&lt;/h5&gt; 
&lt;/pre&gt;</description><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Benjamin Lee</dc:creator><pubDate>Wed, 19 Sep 2012 01:29:17 -0000</pubDate><guid>https://sourceforge.net56ff8727d398aa9c3436fb9de81bb7365839cdea</guid></item><item><title>WikiPage Home modified by Benjamin Lee</title><link>https://sourceforge.net/p/psfc/wiki/Home/</link><description>&lt;pre&gt;--- v39
+++ v40
@@ -46,9 +46,10 @@
 
 
 &lt;h5&gt; Additional Notes:&lt;/h5&gt;
-
 &lt;pre&gt; The majority of the documentation for the code 
  appears to the right of the code itself.         //like so &lt;/pre&gt;
+
+
 
 
 [[project_admins ]] 
&lt;/pre&gt;</description><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Benjamin Lee</dc:creator><pubDate>Tue, 18 Sep 2012 01:17:12 -0000</pubDate><guid>https://sourceforge.net25cdc646c612b051226e5499e09bcfabf20f810f</guid></item><item><title>WikiPage Home modified by Benjamin Lee</title><link>https://sourceforge.net/p/psfc/wiki/Home/</link><description>&lt;pre&gt;--- v38
+++ v39
@@ -12,8 +12,8 @@
   -- Windows 7
   -- Linux
 
-
- - Memory:
+ 
+- Memory:
 
 
 &lt;h5&gt;Command-line syntax:&lt;/h5&gt; 
&lt;/pre&gt;</description><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Benjamin Lee</dc:creator><pubDate>Tue, 18 Sep 2012 01:07:09 -0000</pubDate><guid>https://sourceforge.net7e8f311f62394b55bc00b5201e9813e82d8a7bb9</guid></item><item><title>WikiPage Home modified by Benjamin Lee</title><link>https://sourceforge.net/p/psfc/wiki/Home/</link><description>&lt;pre&gt;--- v37
+++ v38
@@ -11,6 +11,7 @@
  - Operating Systems:
   -- Windows 7
   -- Linux
+
 
  - Memory:
 
&lt;/pre&gt;</description><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Benjamin Lee</dc:creator><pubDate>Tue, 18 Sep 2012 01:06:57 -0000</pubDate><guid>https://sourceforge.net55e6c0bb9be22526101ecccc41f2afcc0a47137a</guid></item><item><title>WikiPage Home modified by Benjamin Lee</title><link>https://sourceforge.net/p/psfc/wiki/Home/</link><description>&lt;pre&gt;--- v36
+++ v37
@@ -9,8 +9,8 @@
 &lt;h5&gt;System requirements:&lt;/h5&gt;  
 
  - Operating Systems:
-   - Windows 7
-   - Linux
+  -- Windows 7
+  -- Linux
 
  - Memory:
 
&lt;/pre&gt;</description><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Benjamin Lee</dc:creator><pubDate>Tue, 18 Sep 2012 01:06:45 -0000</pubDate><guid>https://sourceforge.net3cad2fa3da7574e9b665b46c2280560e12616f29</guid></item></channel></rss>