bio-samtools 0.4.2 → 0.5.0

Sign up to get free protection for your applications and to get access to all the features.
Files changed (45) hide show
  1. data/Gemfile.lock +1 -0
  2. data/README.rdoc +1 -0
  3. data/VERSION +1 -1
  4. data/bio-samtools.gemspec +19 -19
  5. data/doc/Bio.html +71 -4
  6. data/doc/Bio/DB.html +6 -4
  7. data/doc/Bio/DB/Alignment.html +8 -8
  8. data/doc/Bio/DB/Pileup.html +515 -0
  9. data/doc/Bio/DB/SAM.html +37 -37
  10. data/doc/Bio/DB/SAM/Library.html +4 -4
  11. data/doc/Bio/DB/SAM/Tools.html +4 -4
  12. data/doc/Bio/DB/SAM/Tools/Bam1CoreT.html +4 -4
  13. data/doc/Bio/DB/SAM/Tools/Bam1T.html +4 -4
  14. data/doc/Bio/DB/SAM/Tools/BamHeaderT.html +4 -4
  15. data/doc/Bio/DB/SAM/Tools/BamPileup1T.html +4 -4
  16. data/doc/Bio/DB/SAM/Tools/SamfileT.html +4 -4
  17. data/doc/Bio/DB/SAM/Tools/SamfileTX.html +4 -4
  18. data/doc/Bio/DB/SAMException.html +5 -5
  19. data/doc/Bio/DB/Tag.html +5 -5
  20. data/doc/Bio/DB/Vcf.html +467 -0
  21. data/doc/LICENSE_txt.html +57 -60
  22. data/doc/LibC.html +6 -4
  23. data/doc/created.rid +7 -7
  24. data/doc/index.html +4 -4
  25. data/doc/js/search_index.js +1 -1
  26. data/doc/lib/bio-samtools_rb.html +4 -4
  27. data/doc/lib/bio/db/pileup_rb.html +171 -0
  28. data/doc/lib/bio/db/sam/bam_rb.html +4 -4
  29. data/doc/lib/bio/db/sam/faidx_rb.html +4 -4
  30. data/doc/lib/bio/db/sam/library_rb.html +4 -4
  31. data/doc/lib/bio/db/sam/sam_rb.html +4 -4
  32. data/doc/lib/bio/db/sam_rb.html +4 -4
  33. data/doc/lib/bio/db/vcf_rb.html +124 -0
  34. data/doc/table_of_contents.html +16 -26
  35. data/doc/tutorial.html +26 -1
  36. data/doc/tutorial.pdf +0 -0
  37. data/lib/bio/db/{sam/pileup.rb → pileup.rb} +6 -4
  38. data/lib/bio/db/sam.rb +13 -12
  39. data/lib/bio/db/{sam/vcf.rb → vcf.rb} +6 -2
  40. data/test/samples/small/sorted.bam.bai +0 -0
  41. data/test/test_basic.rb +7 -5
  42. data/test/test_vcf.rb +5 -5
  43. metadata +29 -26
  44. data/test/basictest.rb +0 -322
  45. data/test/pileup.rb +0 -68
data/doc/LICENSE_txt.html CHANGED
@@ -65,6 +65,8 @@
65
65
 
66
66
  <li><a href="./Bio/DB/Alignment.html">Bio::DB::Alignment</a>
67
67
 
68
+ <li><a href="./Bio/DB/Pileup.html">Bio::DB::Pileup</a>
69
+
68
70
  <li><a href="./Bio/DB/SAM.html">Bio::DB::SAM</a>
69
71
 
70
72
  <li><a href="./Bio/DB/SAM/Library.html">Bio::DB::SAM::Library</a>
@@ -89,11 +91,9 @@
89
91
 
90
92
  <li><a href="./Bio/DB/Tag.html">Bio::DB::Tag</a>
91
93
 
92
- <li><a href="./LibC.html">LibC</a>
93
-
94
- <li><a href="./Pileup.html">Pileup</a>
94
+ <li><a href="./Bio/DB/Vcf.html">Bio::DB::Vcf</a>
95
95
 
96
- <li><a href="./Vcf.html">Vcf</a>
96
+ <li><a href="./LibC.html">LibC</a>
97
97
 
98
98
  </ul>
99
99
  </nav>
@@ -106,18 +106,17 @@
106
106
  <p>Copyright © 2011 Raoul J.P. Bonnal</p>
107
107
 
108
108
  <p>Permission is hereby granted, free of charge, to any person obtaining a
109
- copy of this software and associated documentation files (the
110
- “Software”), to deal in the Software without restriction, including
111
- without limitation the rights to use, copy, modify, merge, publish,
112
- distribute, sublicense, and/or sell copies of the Software, and to permit
113
- persons to whom the Software is furnished to do so, subject to the
114
- following conditions:</p>
109
+ copy of this software and associated documentation files (the “Software”),
110
+ to deal in the Software without restriction, including without limitation
111
+ the rights to use, copy, modify, merge, publish, distribute, sublicense,
112
+ and/or sell copies of the Software, and to permit persons to whom the
113
+ Software is furnished to do so, subject to the following conditions:</p>
115
114
 
116
115
  <p>The above copyright notice and this permission notice shall be included in
117
116
  all copies or substantial portions of the Software.</p>
118
117
 
119
- <p>THE SOFTWARE IS PROVIDED “AS IS”, WITHOUT WARRANTY OF ANY KIND, EXPRESS
120
- OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
118
+ <p>THE SOFTWARE IS PROVIDED “AS IS”, WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
119
+ IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
121
120
  FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
122
121
  AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
123
122
  LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
@@ -143,11 +142,10 @@ of this license document, but changing it is not allowed.
143
142
 
144
143
  <p>to take away your freedom to share and change the works. By contrast, the
145
144
  GNU General Public License is intended to guarantee your freedom to share
146
- and change all versions of a program–to make sure it remains free
147
- software for all its users. We, the Free Software Foundation, use the GNU
148
- General Public License for most of our software; it applies also to any
149
- other work released this way by its authors. You can apply it to your
150
- programs, too.</p>
145
+ and change all versions of a program–to make sure it remains free software
146
+ for all its users. We, the Free Software Foundation, use the GNU General
147
+ Public License for most of our software; it applies also to any other work
148
+ released this way by its authors. You can apply it to your programs, too.</p>
151
149
 
152
150
  <pre>When we speak of free software, we are referring to freedom, not</pre>
153
151
 
@@ -258,8 +256,8 @@ list meets this criterion.</p>
258
256
 
259
257
  The &quot;source code&quot; for a work means the preferred form of the work</pre>
260
258
 
261
- <p>for making modifications to it. “Object code” means any non-source
262
- form of a work.</p>
259
+ <p>for making modifications to it. “Object code” means any non-source form of
260
+ a work.</p>
263
261
 
264
262
  <pre>A &quot;Standard Interface&quot; means an interface that either is an official</pre>
265
263
 
@@ -273,11 +271,11 @@ widely used among developers working in that language.</p>
273
271
  packaging a Major Component, but which is not part of that Major Component,
274
272
  and (b) serves only to enable use of the work with that Major Component, or
275
273
  to implement a Standard Interface for which an implementation is available
276
- to the public in source code form. A “Major Component”, in this
277
- context, means a major essential component (kernel, window system, and so
278
- on) of the specific operating system (if any) on which the executable work
279
- runs, or a compiler used to produce the work, or an object code interpreter
280
- used to run it.</p>
274
+ to the public in source code form. A “Major Component”, in this context,
275
+ means a major essential component (kernel, window system, and so on) of the
276
+ specific operating system (if any) on which the executable work runs, or a
277
+ compiler used to produce the work, or an object code interpreter used to
278
+ run it.</p>
281
279
 
282
280
  <pre>The &quot;Corresponding Source&quot; for a work in object code form means all</pre>
283
281
 
@@ -341,8 +339,8 @@ prohibiting or restricting circumvention of such measures.</p>
341
339
  <p>circumvention of technological measures to the extent such circumvention is
342
340
  effected by exercising rights under this License with respect to the
343
341
  covered work, and you disclaim any intention to limit operation or
344
- modification of the work as a means of enforcing, against the work’s
345
- users, your or third parties’ legal rights to forbid circumvention of
342
+ modification of the work as a means of enforcing, against the work’s users,
343
+ your or third parties’ legal rights to forbid circumvention of
346
344
  technological measures.</p>
347
345
 
348
346
  <pre>4. Conveying Verbatim Copies.
@@ -392,11 +390,11 @@ A compilation of a covered work with other separate and independent</pre>
392
390
 
393
391
  <p>works, which are not by their nature extensions of the covered work, and
394
392
  which are not combined with it such as to form a larger program, in or on a
395
- volume of a storage or distribution medium, is called an “aggregate” if
396
- the compilation and its resulting copyright are not used to limit the
397
- access or legal rights of the compilation’s users beyond what the
398
- individual works permit. Inclusion of a covered work in an aggregate does
399
- not cause this License to apply to the other parts of the aggregate.</p>
393
+ volume of a storage or distribution medium, is called an “aggregate” if the
394
+ compilation and its resulting copyright are not used to limit the access or
395
+ legal rights of the compilation’s users beyond what the individual works
396
+ permit. Inclusion of a covered work in an aggregate does not cause this
397
+ License to apply to the other parts of the aggregate.</p>
400
398
 
401
399
  <pre>6. Conveying Non-Source Forms.
402
400
 
@@ -458,13 +456,13 @@ conveying the object code work.</p>
458
456
  household purposes, or (2) anything designed or sold for incorporation into
459
457
  a dwelling. In determining whether a product is a consumer product,
460
458
  doubtful cases shall be resolved in favor of coverage. For a particular
461
- product received by a particular user, “normally used” refers to a
462
- typical or common use of that class of product, regardless of the status of
463
- the particular user or of the way in which the particular user actually
464
- uses, or expects or is expected to use, the product. A product is a
465
- consumer product regardless of whether the product has substantial
466
- commercial, industrial or non-consumer uses, unless such uses represent the
467
- only significant mode of use of the product.</p>
459
+ product received by a particular user, “normally used” refers to a typical
460
+ or common use of that class of product, regardless of the status of the
461
+ particular user or of the way in which the particular user actually uses,
462
+ or expects or is expected to use, the product. A product is a consumer
463
+ product regardless of whether the product has substantial commercial,
464
+ industrial or non-consumer uses, unless such uses represent the only
465
+ significant mode of use of the product.</p>
468
466
 
469
467
  <pre>&quot;Installation Information&quot; for a User Product means any methods,</pre>
470
468
 
@@ -671,9 +669,9 @@ the contents of its contributor version.</p>
671
669
 
672
670
  <p>agreement or commitment, however denominated, not to enforce a patent (such
673
671
  as an express permission to practice a patent or covenant not to sue for
674
- patent infringement). To “grant” such a patent license to a party
675
- means to make such an agreement or commitment not to enforce a patent
676
- against the party.</p>
672
+ patent infringement). To “grant” such a patent license to a party means to
673
+ make such an agreement or commitment not to enforce a patent against the
674
+ party.</p>
677
675
 
678
676
  <pre>If you convey a covered work, knowingly relying on a patent license,</pre>
679
677
 
@@ -684,10 +682,10 @@ you must either (1) cause the Corresponding Source to be so available, or
684
682
  (2) arrange to deprive yourself of the benefit of the patent license for
685
683
  this particular work, or (3) arrange, in a manner consistent with the
686
684
  requirements of this License, to extend the patent license to downstream
687
- recipients. “Knowingly relying” means you have actual knowledge that,
688
- but for the patent license, your conveying the covered work in a country,
689
- or your recipient’s use of the covered work in a country, would infringe
690
- one or more identifiable patents in that country that you have reason to
685
+ recipients. “Knowingly relying” means you have actual knowledge that, but
686
+ for the patent license, your conveying the covered work in a country, or
687
+ your recipient’s use of the covered work in a country, would infringe one
688
+ or more identifiable patents in that country that you have reason to
691
689
  believe are valid.</p>
692
690
 
693
691
  <pre>If, pursuant to or in connection with a single transaction or</pre>
@@ -764,9 +762,9 @@ Foundation.</p>
764
762
 
765
763
  <pre>If the Program specifies that a proxy can decide which future</pre>
766
764
 
767
- <p>versions of the GNU General Public License can be used, that proxy’s
768
- public statement of acceptance of a version permanently authorizes you to
769
- choose that version for the Program.</p>
765
+ <p>versions of the GNU General Public License can be used, that proxy’s public
766
+ statement of acceptance of a version permanently authorizes you to choose
767
+ that version for the Program.</p>
770
768
 
771
769
  <pre>Later license versions may give you additional or different</pre>
772
770
 
@@ -778,12 +776,12 @@ or copyright holder as a result of your choosing to follow a later version.</p>
778
776
  THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY</pre>
779
777
 
780
778
  <p>APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT
781
- HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM “AS IS” WITHOUT
782
- WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT
783
- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A
784
- PARTICULAR PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF
785
- THE PROGRAM IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME
786
- THE COST OF ALL NECESSARY SERVICING, REPAIR OR CORRECTION.</p>
779
+ HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM “AS IS” WITHOUT WARRANTY
780
+ OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO,
781
+ THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
782
+ PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM
783
+ IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF
784
+ ALL NECESSARY SERVICING, REPAIR OR CORRECTION.</p>
787
785
 
788
786
  <pre>16. Limitation of Liability.
789
787
 
@@ -850,15 +848,14 @@ This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'.
850
848
  This is free software, and you are welcome to redistribute it
851
849
  under certain conditions; type `show c' for details.</pre>
852
850
 
853
- <p>The hypothetical commands `show w’ and `show c’ should show the
854
- appropriate parts of the General Public License. Of course, your
855
- program’s commands might be different; for a GUI interface, you would use
856
- an “about box”.</p>
851
+ <p>The hypothetical commands `show w’ and `show c’ should show the appropriate
852
+ parts of the General Public License. Of course, your program’s commands
853
+ might be different; for a GUI interface, you would use an “about box”.</p>
857
854
 
858
855
  <pre>You should also get your employer (if you work as a programmer) or school,</pre>
859
856
 
860
- <p>if any, to sign a “copyright disclaimer” for the program, if necessary.
861
- For more information on this, and how to apply and follow the GNU GPL, see
857
+ <p>if any, to sign a “copyright disclaimer” for the program, if necessary. For
858
+ more information on this, and how to apply and follow the GNU GPL, see
862
859
  &lt;<a href="http://www.gnu.org/licenses/">www.gnu.org/licenses/</a>&gt;.</p>
863
860
 
864
861
  <pre>The GNU General Public License does not permit incorporating your program</pre>
data/doc/LibC.html CHANGED
@@ -83,6 +83,8 @@
83
83
 
84
84
  <li><a href="./Bio/DB/Alignment.html">Bio::DB::Alignment</a>
85
85
 
86
+ <li><a href="./Bio/DB/Pileup.html">Bio::DB::Pileup</a>
87
+
86
88
  <li><a href="./Bio/DB/SAM.html">Bio::DB::SAM</a>
87
89
 
88
90
  <li><a href="./Bio/DB/SAM/Library.html">Bio::DB::SAM::Library</a>
@@ -107,11 +109,9 @@
107
109
 
108
110
  <li><a href="./Bio/DB/Tag.html">Bio::DB::Tag</a>
109
111
 
110
- <li><a href="./LibC.html">LibC</a>
111
-
112
- <li><a href="./Pileup.html">Pileup</a>
112
+ <li><a href="./Bio/DB/Vcf.html">Bio::DB::Vcf</a>
113
113
 
114
- <li><a href="./Vcf.html">Vcf</a>
114
+ <li><a href="./LibC.html">LibC</a>
115
115
 
116
116
  </ul>
117
117
  </nav>
@@ -124,6 +124,8 @@
124
124
 
125
125
  <div id="description" class="description">
126
126
 
127
+ <p>require ‘bio/db/pileup’ require ‘bio/db/vcf’</p>
128
+
127
129
  </div><!-- description -->
128
130
 
129
131
 
data/doc/created.rid CHANGED
@@ -1,10 +1,10 @@
1
- Wed, 09 Nov 2011 21:18:55 +0000
1
+ Fri, 13 Jan 2012 10:07:15 +0000
2
+ ./lib/bio/db/pileup.rb Thu, 12 Jan 2012 15:37:18 +0000
3
+ ./lib/bio/db/sam/bam.rb Thu, 12 Jan 2012 15:31:33 +0000
2
4
  ./lib/bio/db/sam/faidx.rb Wed, 02 Nov 2011 11:50:27 +0000
3
- ./LICENSE.txt Wed, 02 Nov 2011 11:50:27 +0000
4
- ./lib/bio/db/sam/pileup.rb Wed, 02 Nov 2011 11:50:27 +0000
5
- ./lib/bio/db/sam/sam.rb Mon, 07 Nov 2011 10:04:59 +0000
6
5
  ./lib/bio/db/sam/library.rb Wed, 02 Nov 2011 13:28:41 +0000
6
+ ./lib/bio/db/sam/sam.rb Mon, 07 Nov 2011 10:04:59 +0000
7
+ ./lib/bio/db/sam.rb Thu, 12 Jan 2012 15:38:07 +0000
8
+ ./lib/bio/db/vcf.rb Thu, 12 Jan 2012 15:52:37 +0000
7
9
  ./lib/bio-samtools.rb Wed, 02 Nov 2011 16:15:52 +0000
8
- ./lib/bio/db/sam/vcf.rb Wed, 09 Nov 2011 20:53:50 +0000
9
- ./lib/bio/db/sam/bam.rb Wed, 02 Nov 2011 13:43:07 +0000
10
- ./lib/bio/db/sam.rb Wed, 09 Nov 2011 21:03:13 +0000
10
+ ./LICENSE.txt Wed, 02 Nov 2011 11:50:27 +0000
data/doc/index.html CHANGED
@@ -65,6 +65,8 @@
65
65
 
66
66
  <li><a href="./Bio/DB/Alignment.html">Bio::DB::Alignment</a>
67
67
 
68
+ <li><a href="./Bio/DB/Pileup.html">Bio::DB::Pileup</a>
69
+
68
70
  <li><a href="./Bio/DB/SAM.html">Bio::DB::SAM</a>
69
71
 
70
72
  <li><a href="./Bio/DB/SAM/Library.html">Bio::DB::SAM::Library</a>
@@ -89,11 +91,9 @@
89
91
 
90
92
  <li><a href="./Bio/DB/Tag.html">Bio::DB::Tag</a>
91
93
 
92
- <li><a href="./LibC.html">LibC</a>
93
-
94
- <li><a href="./Pileup.html">Pileup</a>
94
+ <li><a href="./Bio/DB/Vcf.html">Bio::DB::Vcf</a>
95
95
 
96
- <li><a href="./Vcf.html">Vcf</a>
96
+ <li><a href="./LibC.html">LibC</a>
97
97
 
98
98
  </ul>
99
99
  </nav>
@@ -1 +1 @@
1
- var search_data = {"index":{"info":[["Bio","","Bio.html","","<p>require ‘rubygems’ require ‘ffi’\n\n<pre class=\"ruby\"><span class=\"ruby-identifier\">require</span> <span class=\"ruby-string\">'bio/db/sam/faidx'</span>\n<span class=\"ruby-identifier\">require</span> <span class=\"ruby-string\">'bio/db/sam/sam'</span>\n</pre>\n<p>require ‘rubygems’ …\n"],["Bio::DB","","Bio/DB.html","",""],["Bio::DB::Alignment","","Bio/DB/Alignment.html","",""],["Bio::DB::SAM","","Bio/DB/SAM.html","",""],["Bio::DB::SAM::Library","","Bio/DB/SAM/Library.html","",""],["Bio::DB::SAM::Tools","","Bio/DB/SAM/Tools.html","",""],["Bio::DB::SAM::Tools::Bam1CoreT","","Bio/DB/SAM/Tools/Bam1CoreT.html","",""],["Bio::DB::SAM::Tools::Bam1T","","Bio/DB/SAM/Tools/Bam1T.html","",""],["Bio::DB::SAM::Tools::BamHeaderT","","Bio/DB/SAM/Tools/BamHeaderT.html","","<p>typedef struct {\n\n<pre>int32_t n_targets;\nchar **target_name;\nuint32_t *target_len;\nvoid *dict, *hash, *rg2lib; ...</pre>\n"],["Bio::DB::SAM::Tools::BamPileup1T","","Bio/DB/SAM/Tools/BamPileup1T.html","",""],["Bio::DB::SAM::Tools::SamfileT","","Bio/DB/SAM/Tools/SamfileT.html","","<p>typedef struct {\n\n<pre>int type;\nunion {\n tamFile tamr;\n bamFile bam;\n FILE *tamw;\n} x; ...</pre>\n"],["Bio::DB::SAM::Tools::SamfileTX","","Bio/DB/SAM/Tools/SamfileTX.html","",""],["Bio::DB::SAMException","","Bio/DB/SAMException.html","",""],["Bio::DB::Sam","","Bio/DB/Sam.html","",""],["Bio::DB::Tag","","Bio/DB/Tag.html","",""],["LibC","","LibC.html","",""],["Pileup","","Pileup.html","","<p>Pileup \n<p>A class representing information in SAMTools pileup format\n<p>Author &mdash; Dan MacLean (dan.maclean@tsl …\n"],["Vcf","","Vcf.html","","<p>Vcf \n<p>A class representing information in Variant Call Format Forked from vcfruby\nat github.com/jesserod/vcfruby …\n"],["average_coverage","Bio::DB::Sam","Bio/DB/Sam.html#method-i-average_coverage","(chromosome, qstart, len)","<p>Returns the average coverage of a region in a bam file.\n"],["bam_sort","Bio::DB::SAM::Tools","Bio/DB/SAM/Tools.html#method-c-bam_sort","(bam_filename, bam_output_prefix)",""],["chromosome_coverage","Bio::DB::Sam","Bio/DB/Sam.html#method-i-chromosome_coverage","(chromosome, qstart, len)","<p>Returns an array with the coverage at each possition in the queried region\nThis is a simple average coverage …\n"],["close","Bio::DB::Sam","Bio/DB/Sam.html#method-i-close","()","<p>Closes the sam file and destroys the C pointers using the functions\nprovided by libbam\n"],["deprecated_pileup","Bio::DB::Sam","Bio/DB/Sam.html#method-i-deprecated_pileup","( cmd )","<p>utility method that does not use the samtools API, it calls samtools\ndirectly as if on the command line …\n"],["fetch","Bio::DB::Sam","Bio/DB/Sam.html#method-i-fetch","(chromosome, qstart, qend)","<p>Returns an array of Alignments on a given region.\n"],["fetch_reference","Bio::DB::Sam","Bio/DB/Sam.html#method-i-fetch_reference","(chromosome, qstart,qend)","<p>Returns the sequence for a given region.\n"],["fetch_with_function","Bio::DB::Sam","Bio/DB/Sam.html#method-i-fetch_with_function","(chromosome, qstart, qend, function)","<p>Executes a function on each Alignment inside the queried region of the\nchromosome. The chromosome can …\n"],["filename","Bio::DB::SAM::Library","Bio/DB/SAM/Library.html#method-c-filename","()","<p>Return the path with the file name of the library for the specific\noperating system\n"],["finalize","Bio::DB::Alignment","Bio/DB/Alignment.html#method-c-finalize","(object_id)",""],["finalize","Bio::DB::Sam","Bio/DB/Sam.html#method-c-finalize","(id)","<p>Destructor method that closes the file before letting the object be garbage\ncollected.\n"],["index_stats","Bio::DB::Sam","Bio/DB/Sam.html#method-i-index_stats","()",""],["int_or_raw","Vcf","Vcf.html#method-i-int_or_raw","(x)",""],["load_index","Bio::DB::Sam","Bio/DB/Sam.html#method-i-load_index","()","<p>Loads the bam index to be used for fetching. If the index doesn’t exists\nthe index is built provided …\n"],["load_reference","Bio::DB::Sam","Bio/DB/Sam.html#method-i-load_reference","()","<p>Loads the reference file to be able to query regions of it. This requires\nthe fai index to exist in the …\n"],["merge","Bio::DB::Sam","Bio/DB/Sam.html#method-c-merge","(files, merged_file, headers, add_RG, by_qname)","<p>Merges n BAM files. This doesn’t require to create a SAM object\n<p>files &mdash; An array with the paths to the files. …\n"],["mpileup","Bio::DB::Sam","Bio/DB/Sam.html#method-i-mpileup","( opts )","<p>calls the mpileup function, opts is a hash of options identical to the\ncommand line options for mpileup. …\n"],["mpileup_plus","Bio::DB::Sam","Bio/DB/Sam.html#method-i-mpileup_plus","( opts )","<p>experimental method that spawns a samtools mpileup | bcftools view process\nand supports returning of …\n"],["new","Bio::DB::Alignment","Bio/DB/Alignment.html#method-c-new","()",""],["new","Bio::DB::SAMException","Bio/DB/SAMException.html#method-c-new","()","<p>we can add further variables to give information of the excpetion\n"],["new","Bio::DB::Sam","Bio/DB/Sam.html#method-c-new","(optsa={})","<p>To make a new sam object. Initialize expects a hash optsa with the\nfollowing elemets:\n<p>fasta &mdash; The fasta …\n"],["new","Pileup","Pileup.html#method-c-new","(pile_up_line)","<p>creates the Pileup object\n\n<pre>pile_up_line = &quot;seq2\\t151\\tG\\tG\\t36\\t0\\t99\\t12\\t...........A\\t:9&lt;;;7=&lt;&lt;&lt;&lt;&lt;&quot; ...</pre>\n"],["new","Vcf","Vcf.html#method-c-new","(line=nil, sample_names=nil)","<p>create the vcf object, use the ordered list of sample names to label\nsamples if provided [‘A’, ‘B’, ‘C’], …\n"],["non_ref_count","Pileup","Pileup.html#method-i-non_ref_count","()","<p>returns the total non-reference bases in the reads at this position\n"],["non_refs","Pileup","Pileup.html#method-i-non_refs","()","<p>Calculate the total count of each non-reference nucleotide and return a\nhash of all 4 nt counts, returns …\n"],["open","Bio::DB::Sam","Bio/DB/Sam.html#method-i-open","()","<p>Function that actually opens the sam file Throws a SAMException if the file\ncan’t be open.\n"],["parse_line","Vcf","Vcf.html#method-i-parse_line","(line, sample_names=nil)","<p>gets the info in the Vcf lines and parses the\n"],["qname","Bio::DB::SAM::Tools::Bam1T","Bio/DB/SAM/Tools/Bam1T.html#method-i-qname","()",""],["query_string","Bio::DB::Sam","Bio/DB/Sam.html#method-i-query_string","(chromosome, qstart,qend)","<p>Generates a query sting to be used by the region parser in samtools. In\nprinciple, you shouldn’t need …\n"],["ref_count","Pileup","Pileup.html#method-i-ref_count","()","<p>returns the count of reference-bases in the reads at this position\n"],["sam=","Bio::DB::Alignment","Bio/DB/Alignment.html#method-i-sam-3D","(sam)",""],["set","Bio::DB::Alignment","Bio/DB/Alignment.html#method-i-set","(bam_alignment, header)",""],["set","Bio::DB::Tag","Bio/DB/Tag.html#method-i-set","(str)",""],["text","Bio::DB::SAM::Tools::BamHeaderT","Bio/DB/SAM/Tools/BamHeaderT.html#method-i-text","()",""],["text=","Bio::DB::SAM::Tools::BamHeaderT","Bio/DB/SAM/Tools/BamHeaderT.html#method-i-text-3D","(str)",""],["to_s","Bio::DB::Sam","Bio/DB/Sam.html#method-i-to_s","()","<p>Prints a description of the sam file in a text format containg if it is\nbinary or text, the path and …\n"],["LICENSE","","LICENSE_txt.html","","<p>Copyright © 2011 Raoul J.P. Bonnal\n<p>Permission is hereby granted, free of charge, to any person obtaining …\n"]],"searchIndex":["bio","db","alignment","sam","library","tools","bam1coret","bam1t","bamheadert","bampileup1t","samfilet","samfiletx","samexception","sam","tag","libc","pileup","vcf","average_coverage()","bam_sort()","chromosome_coverage()","close()","deprecated_pileup()","fetch()","fetch_reference()","fetch_with_function()","filename()","finalize()","finalize()","index_stats()","int_or_raw()","load_index()","load_reference()","merge()","mpileup()","mpileup_plus()","new()","new()","new()","new()","new()","non_ref_count()","non_refs()","open()","parse_line()","qname()","query_string()","ref_count()","sam=()","set()","set()","text()","text=()","to_s()","license"],"longSearchIndex":["bio","bio::db","bio::db::alignment","bio::db::sam","bio::db::sam::library","bio::db::sam::tools","bio::db::sam::tools::bam1coret","bio::db::sam::tools::bam1t","bio::db::sam::tools::bamheadert","bio::db::sam::tools::bampileup1t","bio::db::sam::tools::samfilet","bio::db::sam::tools::samfiletx","bio::db::samexception","bio::db::sam","bio::db::tag","libc","pileup","vcf","bio::db::sam#average_coverage()","bio::db::sam::tools::bam_sort()","bio::db::sam#chromosome_coverage()","bio::db::sam#close()","bio::db::sam#deprecated_pileup()","bio::db::sam#fetch()","bio::db::sam#fetch_reference()","bio::db::sam#fetch_with_function()","bio::db::sam::library::filename()","bio::db::alignment::finalize()","bio::db::sam::finalize()","bio::db::sam#index_stats()","vcf#int_or_raw()","bio::db::sam#load_index()","bio::db::sam#load_reference()","bio::db::sam::merge()","bio::db::sam#mpileup()","bio::db::sam#mpileup_plus()","bio::db::alignment::new()","bio::db::samexception::new()","bio::db::sam::new()","pileup::new()","vcf::new()","pileup#non_ref_count()","pileup#non_refs()","bio::db::sam#open()","vcf#parse_line()","bio::db::sam::tools::bam1t#qname()","bio::db::sam#query_string()","pileup#ref_count()","bio::db::alignment#sam=()","bio::db::alignment#set()","bio::db::tag#set()","bio::db::sam::tools::bamheadert#text()","bio::db::sam::tools::bamheadert#text=()","bio::db::sam#to_s()",""]}}
1
+ var search_data = {"index":{"searchIndex":["bio","db","alignment","pileup","sam","library","tools","bam1coret","bam1t","bamheadert","bampileup1t","samfilet","samfiletx","samexception","sam","tag","vcf","libc","average_coverage()","bam_sort()","chromosome_coverage()","close()","deprecated_pileup()","fetch()","fetch_reference()","fetch_with_function()","filename()","finalize()","finalize()","index_stats()","int_or_raw()","load_index()","load_reference()","merge()","mpileup()","mpileup_plus()","new()","new()","new()","new()","new()","non_ref_count()","non_refs()","open()","parse_line()","qname()","query_string()","ref_count()","sam=()","set()","set()","text()","text=()","to_s()","license"],"longSearchIndex":["bio","bio::db","bio::db::alignment","bio::db::pileup","bio::db::sam","bio::db::sam::library","bio::db::sam::tools","bio::db::sam::tools::bam1coret","bio::db::sam::tools::bam1t","bio::db::sam::tools::bamheadert","bio::db::sam::tools::bampileup1t","bio::db::sam::tools::samfilet","bio::db::sam::tools::samfiletx","bio::db::samexception","bio::db::sam","bio::db::tag","bio::db::vcf","libc","bio::db::sam#average_coverage()","bio::db::sam::tools::bam_sort()","bio::db::sam#chromosome_coverage()","bio::db::sam#close()","bio::db::sam#deprecated_pileup()","bio::db::sam#fetch()","bio::db::sam#fetch_reference()","bio::db::sam#fetch_with_function()","bio::db::sam::library::filename()","bio::db::alignment::finalize()","bio::db::sam::finalize()","bio::db::sam#index_stats()","bio::db::vcf#int_or_raw()","bio::db::sam#load_index()","bio::db::sam#load_reference()","bio::db::sam::merge()","bio::db::sam#mpileup()","bio::db::sam#mpileup_plus()","bio::db::alignment::new()","bio::db::pileup::new()","bio::db::samexception::new()","bio::db::sam::new()","bio::db::vcf::new()","bio::db::pileup#non_ref_count()","bio::db::pileup#non_refs()","bio::db::sam#open()","bio::db::vcf#parse_line()","bio::db::sam::tools::bam1t#qname()","bio::db::sam#query_string()","bio::db::pileup#ref_count()","bio::db::alignment#sam=()","bio::db::alignment#set()","bio::db::tag#set()","bio::db::sam::tools::bamheadert#text()","bio::db::sam::tools::bamheadert#text=()","bio::db::sam#to_s()",""],"info":[["Bio","","Bio.html","","<p>Bio::DB::Pileup \n<p>A class representing information in SAMTools pileup format\n<p>Author &mdash; Dan MacLean (dan.maclean@tsl …\n"],["Bio::DB","","Bio/DB.html","",""],["Bio::DB::Alignment","","Bio/DB/Alignment.html","",""],["Bio::DB::Pileup","","Bio/DB/Pileup.html","",""],["Bio::DB::SAM","","Bio/DB/SAM.html","",""],["Bio::DB::SAM::Library","","Bio/DB/SAM/Library.html","",""],["Bio::DB::SAM::Tools","","Bio/DB/SAM/Tools.html","",""],["Bio::DB::SAM::Tools::Bam1CoreT","","Bio/DB/SAM/Tools/Bam1CoreT.html","",""],["Bio::DB::SAM::Tools::Bam1T","","Bio/DB/SAM/Tools/Bam1T.html","",""],["Bio::DB::SAM::Tools::BamHeaderT","","Bio/DB/SAM/Tools/BamHeaderT.html","","<p>typedef struct {\n\n<pre>int32_t n_targets;\nchar **target_name;\nuint32_t *target_len;\nvoid *dict, *hash, *rg2lib; ...</pre>\n"],["Bio::DB::SAM::Tools::BamPileup1T","","Bio/DB/SAM/Tools/BamPileup1T.html","",""],["Bio::DB::SAM::Tools::SamfileT","","Bio/DB/SAM/Tools/SamfileT.html","","<p>typedef struct {\n\n<pre>int type;\nunion {\n tamFile tamr;\n bamFile bam;\n FILE *tamw;\n} x; ...</pre>\n"],["Bio::DB::SAM::Tools::SamfileTX","","Bio/DB/SAM/Tools/SamfileTX.html","",""],["Bio::DB::SAMException","","Bio/DB/SAMException.html","",""],["Bio::DB::Sam","","Bio/DB/Sam.html","",""],["Bio::DB::Tag","","Bio/DB/Tag.html","",""],["Bio::DB::Vcf","","Bio/DB/Vcf.html","",""],["LibC","","LibC.html","","<p>require ‘bio/db/pileup require ‘bio/db/vcf’\n"],["average_coverage","Bio::DB::Sam","Bio/DB/Sam.html#method-i-average_coverage","(chromosome, qstart, len)","<p>Returns the average coverage of a region in a bam file.\n"],["bam_sort","Bio::DB::SAM::Tools","Bio/DB/SAM/Tools.html#method-c-bam_sort","(bam_filename, bam_output_prefix)",""],["chromosome_coverage","Bio::DB::Sam","Bio/DB/Sam.html#method-i-chromosome_coverage","(chromosome, qstart, len)","<p>Returns an array with the coverage at each possition in the queried region\nThis is a simple average coverage …\n"],["close","Bio::DB::Sam","Bio/DB/Sam.html#method-i-close","()","<p>Closes the sam file and destroys the C pointers using the functions\nprovided by libbam\n"],["deprecated_pileup","Bio::DB::Sam","Bio/DB/Sam.html#method-i-deprecated_pileup","( cmd )","<p>utility method that does not use the samtools API, it calls samtools\ndirectly as if on the command line …\n"],["fetch","Bio::DB::Sam","Bio/DB/Sam.html#method-i-fetch","(chromosome, qstart, qend)","<p>Returns an array of Alignments on a given region.\n"],["fetch_reference","Bio::DB::Sam","Bio/DB/Sam.html#method-i-fetch_reference","(chromosome, qstart,qend)","<p>Returns the sequence for a given region.\n"],["fetch_with_function","Bio::DB::Sam","Bio/DB/Sam.html#method-i-fetch_with_function","(chromosome, qstart, qend, function)","<p>Executes a function on each Alignment inside the queried region of the\nchromosome. The chromosome can …\n"],["filename","Bio::DB::SAM::Library","Bio/DB/SAM/Library.html#method-c-filename","()","<p>Return the path with the file name of the library for the specific\noperating system\n"],["finalize","Bio::DB::Alignment","Bio/DB/Alignment.html#method-c-finalize","(object_id)",""],["finalize","Bio::DB::Sam","Bio/DB/Sam.html#method-c-finalize","(id)","<p>Destructor method that closes the file before letting the object be garbage\ncollected.\n"],["index_stats","Bio::DB::Sam","Bio/DB/Sam.html#method-i-index_stats","()",""],["int_or_raw","Bio::DB::Vcf","Bio/DB/Vcf.html#method-i-int_or_raw","(x)",""],["load_index","Bio::DB::Sam","Bio/DB/Sam.html#method-i-load_index","()","<p>Loads the bam index to be used for fetching. If the index doesn’t exists\nthe index is built provided …\n"],["load_reference","Bio::DB::Sam","Bio/DB/Sam.html#method-i-load_reference","()","<p>Loads the reference file to be able to query regions of it. This requires\nthe fai index to exist in the …\n"],["merge","Bio::DB::Sam","Bio/DB/Sam.html#method-c-merge","(files, merged_file, headers, add_RG, by_qname)","<p>Merges n BAM files. This doesn’t require to create a SAM object\n<p>files &mdash; An array with the paths to the files. …\n"],["mpileup","Bio::DB::Sam","Bio/DB/Sam.html#method-i-mpileup","( opts )","<p>calls the mpileup function, opts is a hash of options identical to the\ncommand line options for mpileup. …\n"],["mpileup_plus","Bio::DB::Sam","Bio/DB/Sam.html#method-i-mpileup_plus","( opts )","<p>experimental method that spawns a samtools mpileup | bcftools view process\nand supports returning of …\n"],["new","Bio::DB::Alignment","Bio/DB/Alignment.html#method-c-new","()",""],["new","Bio::DB::Pileup","Bio/DB/Pileup.html#method-c-new","(pile_up_line)","<p>creates the Pileup object\n\n<pre>pile_up_line = &quot;seq2\\t151\\tG\\tG\\t36\\t0\\t99\\t12\\t...........A\\t:9&lt;;;7=&lt;&lt;&lt;&lt;&lt;&quot; ...</pre>\n"],["new","Bio::DB::SAMException","Bio/DB/SAMException.html#method-c-new","()","<p>we can add further variables to give information of the excpetion\n"],["new","Bio::DB::Sam","Bio/DB/Sam.html#method-c-new","(optsa={})","<p>To make a new sam object. Initialize expects a hash optsa with the\nfollowing elemets:\n<p>fasta &mdash; The fasta …\n"],["new","Bio::DB::Vcf","Bio/DB/Vcf.html#method-c-new","(line=nil, sample_names=nil)","<p>create the vcf object, use the ordered list of sample names to label\nsamples if provided [‘A’, ‘B’, ‘C’], …\n"],["non_ref_count","Bio::DB::Pileup","Bio/DB/Pileup.html#method-i-non_ref_count","()","<p>returns the total non-reference bases in the reads at this position\n"],["non_refs","Bio::DB::Pileup","Bio/DB/Pileup.html#method-i-non_refs","()","<p>Calculate the total count of each non-reference nucleotide and return a\nhash of all 4 nt counts, returns …\n"],["open","Bio::DB::Sam","Bio/DB/Sam.html#method-i-open","()","<p>Function that actually opens the sam file Throws a SAMException if the file\ncan’t be open.\n"],["parse_line","Bio::DB::Vcf","Bio/DB/Vcf.html#method-i-parse_line","(line, sample_names=nil)","<p>gets the info in the Vcf lines and parses it, setting the attributes\n"],["qname","Bio::DB::SAM::Tools::Bam1T","Bio/DB/SAM/Tools/Bam1T.html#method-i-qname","()",""],["query_string","Bio::DB::Sam","Bio/DB/Sam.html#method-i-query_string","(chromosome, qstart,qend)","<p>Generates a query sting to be used by the region parser in samtools. In\nprinciple, you shouldn’t need …\n"],["ref_count","Bio::DB::Pileup","Bio/DB/Pileup.html#method-i-ref_count","()","<p>returns the count of reference-bases in the reads at this position\n"],["sam=","Bio::DB::Alignment","Bio/DB/Alignment.html#method-i-sam-3D","(sam)",""],["set","Bio::DB::Alignment","Bio/DB/Alignment.html#method-i-set","(bam_alignment, header)",""],["set","Bio::DB::Tag","Bio/DB/Tag.html#method-i-set","(str)",""],["text","Bio::DB::SAM::Tools::BamHeaderT","Bio/DB/SAM/Tools/BamHeaderT.html#method-i-text","()",""],["text=","Bio::DB::SAM::Tools::BamHeaderT","Bio/DB/SAM/Tools/BamHeaderT.html#method-i-text-3D","(str)",""],["to_s","Bio::DB::Sam","Bio/DB/Sam.html#method-i-to_s","()","<p>Prints a description of the sam file in a text format containg if it is\nbinary or text, the path and …\n"],["LICENSE","","LICENSE_txt.html","","<p>Copyright © 2011 Raoul J.P. Bonnal\n<p>Permission is hereby granted, free of charge, to any person obtaining …\n"]]}}
@@ -65,6 +65,8 @@
65
65
 
66
66
  <li><a href="../Bio/DB/Alignment.html">Bio::DB::Alignment</a>
67
67
 
68
+ <li><a href="../Bio/DB/Pileup.html">Bio::DB::Pileup</a>
69
+
68
70
  <li><a href="../Bio/DB/SAM.html">Bio::DB::SAM</a>
69
71
 
70
72
  <li><a href="../Bio/DB/SAM/Library.html">Bio::DB::SAM::Library</a>
@@ -89,11 +91,9 @@
89
91
 
90
92
  <li><a href="../Bio/DB/Tag.html">Bio::DB::Tag</a>
91
93
 
92
- <li><a href="../LibC.html">LibC</a>
93
-
94
- <li><a href="../Pileup.html">Pileup</a>
94
+ <li><a href="../Bio/DB/Vcf.html">Bio::DB::Vcf</a>
95
95
 
96
- <li><a href="../Vcf.html">Vcf</a>
96
+ <li><a href="../LibC.html">LibC</a>
97
97
 
98
98
  </ul>
99
99
  </nav>
@@ -0,0 +1,171 @@
1
+ <!DOCTYPE html>
2
+
3
+ <html>
4
+ <head>
5
+ <meta content="text/html; charset=UTF-8" http-equiv="Content-Type">
6
+
7
+ <title>LICENSE</title>
8
+
9
+ <link type="text/css" media="screen" href="../../../rdoc.css" rel="stylesheet">
10
+
11
+ <script type="text/javascript">
12
+ var rdoc_rel_prefix = "../../../";
13
+ </script>
14
+
15
+ <script type="text/javascript" charset="utf-8" src="../../../js/jquery.js"></script>
16
+ <script type="text/javascript" charset="utf-8" src="../../../js/navigation.js"></script>
17
+ <script type="text/javascript" charset="utf-8" src="../../../js/search_index.js"></script>
18
+ <script type="text/javascript" charset="utf-8" src="../../../js/search.js"></script>
19
+ <script type="text/javascript" charset="utf-8" src="../../../js/searcher.js"></script>
20
+ <script type="text/javascript" charset="utf-8" src="../../../js/darkfish.js"></script>
21
+
22
+
23
+ <body class="file">
24
+ <nav id="metadata">
25
+ <nav id="home-section" class="section">
26
+ <h3 class="section-header">
27
+ <a href="../../../index.html">Home</a>
28
+ <a href="../../../table_of_contents.html#classes">Classes</a>
29
+ <a href="../../../table_of_contents.html#methods">Methods</a>
30
+ </h3>
31
+ </nav>
32
+
33
+
34
+ <nav id="search-section" class="section project-section" class="initially-hidden">
35
+ <form action="#" method="get" accept-charset="utf-8">
36
+ <h3 class="section-header">
37
+ <input type="text" name="search" placeholder="Search" id="search-field"
38
+ title="Type to search, Up and Down to navigate, Enter to load">
39
+ </h3>
40
+ </form>
41
+
42
+ <ul id="search-results" class="initially-hidden"></ul>
43
+ </nav>
44
+
45
+
46
+ <div id="project-metadata">
47
+ <nav id="fileindex-section" class="section project-section">
48
+ <h3 class="section-header">Pages</h3>
49
+
50
+ <ul>
51
+
52
+ <li class="file"><a href="../../../LICENSE_txt.html">LICENSE</a>
53
+
54
+ </ul>
55
+ </nav>
56
+
57
+ <nav id="classindex-section" class="section project-section">
58
+ <h3 class="section-header">Class and Module Index</h3>
59
+
60
+ <ul class="link-list">
61
+
62
+ <li><a href="../../../Bio.html">Bio</a>
63
+
64
+ <li><a href="../../../Bio/DB.html">Bio::DB</a>
65
+
66
+ <li><a href="../../../Bio/DB/Alignment.html">Bio::DB::Alignment</a>
67
+
68
+ <li><a href="../../../Bio/DB/Pileup.html">Bio::DB::Pileup</a>
69
+
70
+ <li><a href="../../../Bio/DB/SAM.html">Bio::DB::SAM</a>
71
+
72
+ <li><a href="../../../Bio/DB/SAM/Library.html">Bio::DB::SAM::Library</a>
73
+
74
+ <li><a href="../../../Bio/DB/SAM/Tools.html">Bio::DB::SAM::Tools</a>
75
+
76
+ <li><a href="../../../Bio/DB/SAM/Tools/Bam1CoreT.html">Bio::DB::SAM::Tools::Bam1CoreT</a>
77
+
78
+ <li><a href="../../../Bio/DB/SAM/Tools/Bam1T.html">Bio::DB::SAM::Tools::Bam1T</a>
79
+
80
+ <li><a href="../../../Bio/DB/SAM/Tools/BamHeaderT.html">Bio::DB::SAM::Tools::BamHeaderT</a>
81
+
82
+ <li><a href="../../../Bio/DB/SAM/Tools/BamPileup1T.html">Bio::DB::SAM::Tools::BamPileup1T</a>
83
+
84
+ <li><a href="../../../Bio/DB/SAM/Tools/SamfileT.html">Bio::DB::SAM::Tools::SamfileT</a>
85
+
86
+ <li><a href="../../../Bio/DB/SAM/Tools/SamfileTX.html">Bio::DB::SAM::Tools::SamfileTX</a>
87
+
88
+ <li><a href="../../../Bio/DB/SAMException.html">Bio::DB::SAMException</a>
89
+
90
+ <li><a href="../../../Bio/DB/Sam.html">Bio::DB::Sam</a>
91
+
92
+ <li><a href="../../../Bio/DB/Tag.html">Bio::DB::Tag</a>
93
+
94
+ <li><a href="../../../Bio/DB/Vcf.html">Bio::DB::Vcf</a>
95
+
96
+ <li><a href="../../../LibC.html">LibC</a>
97
+
98
+ </ul>
99
+ </nav>
100
+
101
+ </div>
102
+ </nav>
103
+
104
+ <div id="documentation" class="description">
105
+
106
+ <h1 id="label-Bio%3A%3ADB%3A%3APileup+"><a href="../../../Bio/DB/Pileup.html">Bio::DB::Pileup</a> </h1>
107
+
108
+ <p>A class representing information in SAMTools pileup format</p>
109
+ <dl class="rdoc-list note-list"><dt>Author
110
+ <dd>
111
+ <p>Dan MacLean (tsl at dan.maclean.ac.uk)</p>
112
+ </dd></dl>
113
+
114
+ <p>Pileup is described at <a
115
+ href="http://sourceforge.net/apps/mediawiki/samtools/index.php?title=SAM_FAQ#I_do_not_understand_the_columns_in_the_pileup_output">sourceforge.net/apps/mediawiki/samtools/index.php?title=SAM_FAQ#I_do_not_understand_the_columns_in_the_pileup_output</a>.
116
+ Briefly (when you invoke pileup with the -c option):</p>
117
+ <ul><li>
118
+ <p>1 reference sequence name</p>
119
+ </li><li>
120
+ <p>2 reference coordinate</p>
121
+ </li><li>
122
+ <p>(3) reference base, or `*‘ for an indel line</p>
123
+ </li><li>
124
+ <p>(4) genotype where heterozygotes are encoded in the IUB code: M=A/C, R=A/G,
125
+ W=A/T, S=C/G, Y=C/T and K=G/T; indels are indicated by, for example, +A,
126
+ -A or +CC/-C. There is no difference between */+A or +A/*.</p>
127
+ </li><li>
128
+ <p>(5) Phred-scaled likelihood that the genotype is wrong, which is also
129
+ called `consensus quality’.</p>
130
+ </li><li>
131
+ <p>(6) Phred-scaled likelihood that the genotype is identical to the
132
+ reference, which is also called `SNP quality’. Suppose the reference base
133
+ is A and in alignment we see 17 G and 3 A. We will get a low consensus
134
+ quality because it is difficult to distinguish an A/G heterozygote from a
135
+ G/G homozygote. We will get a high SNP quality, though, because the
136
+ evidence of a SNP is very strong.</p>
137
+ </li><li>
138
+ <p>(7) root mean square (RMS) mapping quality</p>
139
+ </li><li>
140
+ <p>8 # reads covering the position</p>
141
+ </li><li>
142
+ <p>9 read bases at a SNP line (check the manual page for more information);
143
+ the 1st indel allele otherwise</p>
144
+ </li><li>
145
+ <p>10 base quality at a SNP line; the 2nd indel allele otherwise</p>
146
+ </li><li>
147
+ <p>(11) indel line only: # reads directly supporting the 1st indel allele</p>
148
+ </li><li>
149
+ <p>(12) indel line only: # reads directly supporting the 2nd indel allele</p>
150
+ </li><li>
151
+ <p>(13) indel line only: # reads supporting a third indel allele</p>
152
+ </li></ul>
153
+
154
+ <p>If pileup is invoked without `-c’, indel lines and columns between 3 and 7
155
+ inclusive will not be outputted.</p>
156
+
157
+ <p>NB mpileup uses the 6 column output format eg
158
+ “seq2t151tGtGt36t0t99t12t.….……At:9&lt;;;7=&lt;&lt;&lt;&lt;&lt;” Pileup
159
+ provides accessors for all columns (6 or 10 column format) and a few other
160
+ useful methods</p>
161
+
162
+ </div>
163
+
164
+
165
+
166
+ <footer id="validator-badges">
167
+ <p><a href="http://validator.w3.org/check/referer">[Validate]</a>
168
+ <p>Generated by <a href="https://github.com/rdoc/rdoc">RDoc</a> 3.11.
169
+ <p>Generated with the <a href="http://deveiate.org/projects/Darkfish-Rdoc/">Darkfish Rdoc Generator</a> 3.
170
+ </footer>
171
+