<?xml version='1.0'?><rss version="2.0" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:georss="http://www.georss.org/georss" xmlns:atom="http://www.w3.org/2005/Atom" >
<channel>
	<title><![CDATA[BOL: Related items]]></title>
	<link>https://bioinformaticsonline.com/related/37650?offset=110</link>
	<atom:link href="https://bioinformaticsonline.com/related/37650?offset=110" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/news/view/4288/new-born-babies-get-ready-to-know-their-whole-genome-soon</guid>
	<pubDate>Thu, 05 Sep 2013 07:24:02 -0500</pubDate>
	<link>https://bioinformaticsonline.com/news/view/4288/new-born-babies-get-ready-to-know-their-whole-genome-soon</link>
	<title><![CDATA[New born babies get ready to know their whole genome soon!!!]]></title>
	<description><![CDATA[<p>USA launch a pilot projects to examine medical information of newborn baby, which are being funded by the Eunice Kennedy Shriver National Institute of Child Health and Human Development (NICHD) and the National Human Genome Research Institute (NHGRI), both parts of the National Institutes of Health.</p><p>Awards of $5 million to four grantees have been made in fiscal year 2013 under the Genomic Sequencing and Newborn Screening Disorders research program. The program will be funded at $25 million over five years, as funds are made available.</p><p>"Hundreds of US babies will be pioneers in genomic medicine through a&nbsp;US$25-million programme to sequence their genomes&nbsp;soon after they are born."</p><p><strong>Source</strong>:</p><p><a href="http://blogs.nature.com/news/2013/09/scientists-to-sequence-hundreds-of-newborns-genomes.html">http://blogs.nature.com/news/2013/09/scientists-to-sequence-hundreds-of-newborns-genomes.html</a></p><p><a href="http://www.genome.gov/27554919">http://www.genome.gov/27554919</a></p>]]></description>
	<dc:creator>Rahul Agarwal</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/33976/goldgenomes-online-database</guid>
	<pubDate>Wed, 26 Jul 2017 07:49:29 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/33976/goldgenomes-online-database</link>
	<title><![CDATA[GOLD:Genomes Online Database]]></title>
	<description><![CDATA[<p><span>GOLD</span><span>:Genomes Online Database, is a World Wide Web resource for comprehensive access to information regarding genome and metagenome sequencing projects, and their associated metadata, around the world.</span></p>
<p>https://gold.jgi.doe.gov/</p><p>Address of the bookmark: <a href="https://gold.jgi.doe.gov/" rel="nofollow">https://gold.jgi.doe.gov/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/file/view/36945/download-blasr-13-version</guid>
	<pubDate>Fri, 15 Jun 2018 03:01:20 -0500</pubDate>
	<link>https://bioinformaticsonline.com/file/view/36945/download-blasr-13-version</link>
	<title><![CDATA[Download blasr 1.3 version]]></title>
	<description><![CDATA[<p>DOWNLOAD LINK: https://github.com/BioInf-Wuerzburg/proovread/raw/master/util/blasr-1.3.1/blasr</p><p>I'm running "OPERA-LG_v2.0.5/bin/preprocess_reads.pl" and have the following error:</p><p>fail to open file './temporarySam'</p><p><br />[bwa_aln_core] write to the disk... 0.09 sec<br />[bwa_aln_core] 70778880 sequences have been processed.<br />[bwa_aln_core] calculate SA coordinate... 161.35 sec<br />[bwa_aln_core] write to the disk... 0.06 sec<br />[bwa_aln_core] 70989574 sequences have been processed.<br />[main] Version: 0.7.15-r1140<br />[main] CMD: bwa aln -t 30 all_p_ctg.fa -<br />[main] Real time: 2402.523 sec; CPU: 53429.488 sec<br />[E::hts_open_format] Failed to open file temporarySam<br />samtools sort: can't open "temporarySam": No such file or directory<br />[bwa_aln_core] convert to sequence coordinate... 1.00 sec<br />[bwa_aln_core] refine gapped alignments... 6.07 sec<br />[bwa_aln_core] print alignments... PREPROCESS:<br />Fastq format is recognized<br />[Thu Jun 14 18:16:47 2018] Building bwa index...<br />bwa index -p all_p_ctg.fa /home/urbe/Tools/OPERA-LG_v2.0.6/all_p_ctg.fa<br />[Thu Jun 14 18:18:35 2018] Finding the SA coordinates of the reads using BWA aln...<br />[Thu Jun 14 18:58:37 2018] Generate alignments of reads using bwa sampe...<br />bwa samse -n 1 all_p_ctg.fa read.sai - | grep '\(^@\|XT:A:U\)' | /usr/local/bin/samtools view -S -h -b -F 0x4 - | /usr/local/bin/samtools sort -@ 20 -no - temporarySam &gt; FALCON-Unzip-Scaff.bam<br />Mapping long-reads using blasr...<br />/home/urbe/Tools/SSpace/SSPACE-LongRead_v1-1/blasr -nproc 40 -m 1 -minMatch 5 -bestn 10 -noSplitSubreads -advanceExactMatches 1 -nCandidates 1 -maxAnchorsPerPosition 1 -sdpTupleSize 7 /media/urbe/MyDDrive/ONTdata/allONT/allONT.fasta /home/urbe/Tools/OPERA-LG_v2.0.6/all_p_ctg.fa | cut -d ' ' -f1-5,7-12 | sed 's/ /\t/g' &gt; FALCON-Unzip-Scaff.map<br />sh: 1: /home/urbe/Tools/SSpace/SSPACE-LongRead_v1-1/blasr: Permission denied<br />Sorting mapping results...<br />sort -k1,1 -k9,9g FALCON-Unzip-Scaff.map &gt; FALCON-Unzip-Scaff.map.sort<br />Analyzing sorted results...<br />Extracting linking information...<br />i3 2000 5000<br />i2 1000 2000<br />i4 5000 15000<br />i0 -200 300<br />i5 15000 40000<br />i1 300 1000<br />Repeat detection...<br />/home/urbe/Tools/OPERA-LG_v2.0.6/bin//filter_conflicting_edge.pl pairedEdges_i0 contig_length.dat 100 2<br />Illegal division by zero at /home/urbe/Tools/OPERA-LG_v2.0.6/bin//filter_conflicting_edge.pl line 93.<br />readline() on closed filehandle FILE at bin/OPERA-long-read.pl line 250.<br />rm anchor_contig_info.dat contig_length.dat filtered_edges.dat filtered_edges_cov.dat *.sai<br />rm: cannot remove 'anchor_contig_info.dat': No such file or directory<br />mv FALCON-Unzip-Scaff.bam FALCON-Unzip-Scaff-with-repeat.bam<br />/home/urbe/Tools/OPERA-LG_v2.0.6/bin//filter_repeat.pl FALCON-Unzip-Scaff-with-repeat.bam repeat.dat | /usr/local/bin/samtools view - -h -S -b &gt; FALCON-Unzip-Scaff.bam<br />rm FALCON-Unzip-Scaff-with-repeat.bam<br />/home/urbe/Tools/OPERA-LG_v2.0.6/bin/OPERA-LG config &gt; log<br />Analyzing 1 library: FALCON-Unzip-Scaff.bam<br />min library mean : 0<br />minimum contig length is 500<br />Current library: 1 out of 7<br />Analyzing file: pairedEdges_no_repeat_i0<br />Analyzing file: pairedEdges_no_repeat_i1<br />Analyzing file: pairedEdges_no_repeat_i2<br />Analyzing file: pairedEdges_no_repeat_i3<br />Analyzing file: pairedEdges_no_repeat_i4<br />Analyzing file: pairedEdges_no_repeat_i5<br />ln -s results/scaffoldSeq.fasta scaffoldSeq.fasta</p><p>To resolve this, try downloading blasr version 1.3 above and re-run :)</p>]]></description>
	<dc:creator>Jit</dc:creator>
	<enclosure url="https://bioinformaticsonline.com/file/download/36945" length="0" type="inode/x-empty" />
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/41673/lr-gapcloser-a-tiling-path-based-gap-closer-that-uses-long-reads-to-complete-genome-assembly</guid>
	<pubDate>Thu, 14 May 2020 15:09:52 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/41673/lr-gapcloser-a-tiling-path-based-gap-closer-that-uses-long-reads-to-complete-genome-assembly</link>
	<title><![CDATA[LR_Gapcloser: a tiling path-based gap closer that uses long reads to complete genome assembly]]></title>
	<description><![CDATA[<p>LR_Gapcloser is a gap closing tool using long reads from studied species. The long reads could be downloaed from public read archive database (for instance, NCBI SRA database ) or be your own data. Then they are fragmented and aligned to scaffolds using BWA mem algorithm in BWA package. In the package, we provided a compiled bwa, so the user needn't to install bwa. LR_Gapcloser uses the alignments to find the bridging that cross the gap, and then fills the long read original sequence into the genomic gaps.</p><p>Address of the bookmark: <a href="https://github.com/CAFS-bioinformatics/LR_Gapcloser" rel="nofollow">https://github.com/CAFS-bioinformatics/LR_Gapcloser</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/38053/swgis-v20-a-seqword-genomic-island-sniffer</guid>
	<pubDate>Thu, 01 Nov 2018 12:35:52 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/38053/swgis-v20-a-seqword-genomic-island-sniffer</link>
	<title><![CDATA[swgis v2.0 : a seqword genomic island sniffer]]></title>
	<description><![CDATA[<p><strong>swgis v2.0</strong>&nbsp;is the modified version of the seqword genomic island sniffer. this version is specifically optimized for predicting genomic islands in eukaryotic genomes. swgis v2.0 was tested on several eukaryotic species of different lineages. all identified genomic islands were deposited in the&nbsp;<a href="http://eugi.bi.up.ac.za/" title="Go to EuGI database">eugi database</a>.</p>
<p><a href="http://eugi.bi.up.ac.za/download_swgis/swgisv2.0.zip" title="Download SWGIS v2.0">download swgis v2.0</a></p><p>Address of the bookmark: <a href="http://eugi.bi.up.ac.za/eugi_download_swgis.php" rel="nofollow">http://eugi.bi.up.ac.za/eugi_download_swgis.php</a></p>]]></description>
	<dc:creator>Abhimanyu Singh</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/41896/kad-assessing-genome-assemblies-using-k-mer-copies-in-assemblies-and-k-mer-abundance-in-illumina-reads</guid>
	<pubDate>Fri, 19 Jun 2020 07:34:12 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/41896/kad-assessing-genome-assemblies-using-k-mer-copies-in-assemblies-and-k-mer-abundance-in-illumina-reads</link>
	<title><![CDATA[KAD: Assessing genome assemblies using K-mer copies in assemblies and K-mer abundance in Illumina reads]]></title>
	<description><![CDATA[<p>KAD is designed for evaluating the accuracy of nucleotide base quality of genome assemblies. Briefly, abundance of k-mers are quantified for both sequencing reads and assembly sequences. Comparison of the two values results in a single value per k-mer, K-mer Abundance Difference (KAD), which indicates how well the assembly matches read data for each k-mer.</p>
<p><a href="https://render.githubusercontent.com/render/math?math=KAD=log_{2}\begin{pmatrix}\frac{c%2Bm}{m(n%2B1)}\end{pmatrix}" target="_blank"><img src="https://render.githubusercontent.com/render/math?math=KAD=log_{2}\begin{pmatrix}\frac{c%2Bm}{m(n%2B1)}\end{pmatrix}" alt="image" style="border: 0px;"></a></p>
<p>where,&nbsp;<em>c</em>&nbsp;is the count of a k-mer from reads,&nbsp;<em>m</em>&nbsp;is the mode of counts of read k-mers, and&nbsp;<em>n</em>&nbsp;is the copy of the k-mer in the assembly.</p><p>Address of the bookmark: <a href="https://github.com/liu3zhenlab/KAD" rel="nofollow">https://github.com/liu3zhenlab/KAD</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/43801/smudgeplot-inference-of-ploidy-and-heterozygosity-structure-using-whole-genome-sequencing-data</guid>
	<pubDate>Fri, 25 Feb 2022 04:42:09 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/43801/smudgeplot-inference-of-ploidy-and-heterozygosity-structure-using-whole-genome-sequencing-data</link>
	<title><![CDATA[Smudgeplot: Inference of ploidy and heterozygosity structure using whole genome sequencing data]]></title>
	<description><![CDATA[<p dir="auto">This tool extracts heterozygous kmer pairs from kmer count databases and performs gymnastics with them. We are able to disentangle genome structure by comparing the sum of kmer pair coverages (CovA + CovB) to their relative coverage (CovB / (CovA + CovB)). Such an approach also allows us to analyze obscure genomes with duplications, various ploidy levels, etc.</p>
<p dir="auto">Smudgeplots are computed from raw or even better from trimmed reads and show the haplotype structure using heterozygous kmer pairs. For example:</p>
<p dir="auto"><a href="https://user-images.githubusercontent.com/8181573/45959760-f1032d00-c01a-11e8-8576-ff0512c33da9.png" target="_blank"><img src="https://user-images.githubusercontent.com/8181573/45959760-f1032d00-c01a-11e8-8576-ff0512c33da9.png" alt="smudgeexample" style="border: 0px;"></a></p><p>Address of the bookmark: <a href="https://github.com/KamilSJaron/smudgeplot" rel="nofollow">https://github.com/KamilSJaron/smudgeplot</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/videolist/watch/11249/how-to-sequence-the-human-genome-mark-j-kiel</guid>
	<pubDate>Fri, 30 May 2014 13:24:11 -0500</pubDate>
	<link>https://bioinformaticsonline.com/videolist/watch/11249/how-to-sequence-the-human-genome-mark-j-kiel</link>
	<title><![CDATA[How to sequence the human genome - Mark J. Kiel]]></title>
	<description><![CDATA[<iframe width="" height="" src="https://www.youtube-nocookie.com/embed/MvuYATh7Y74" frameborder="0" allowfullscreen></iframe>View full lesson: http://ed.ted.com/lessons/how-to-sequence-the-human-genome-mark-j-kiel

Your genome, every human's genome, consists of a unique DNA sequence of A's, T's, C's and G's that tell your cells how to operate. Thanks to technological advances, scientists are now able to know the sequence of letters that makes up an individual genome relatively quickly and inexpensively. Mark J. Kiel takes an in-depth look at the science behind the sequence.

Lesson by Mark J. Kiel, animation by Marc Christoforidis.]]></description>
	
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/30144/bima-v3-an-aligner-customized-for-mate-pair-library-sequencing</guid>
	<pubDate>Wed, 14 Dec 2016 15:20:00 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/30144/bima-v3-an-aligner-customized-for-mate-pair-library-sequencing</link>
	<title><![CDATA[BIMA V3: an aligner customized for mate pair library sequencing]]></title>
	<description><![CDATA[<p>Summary: Mate pair library sequencing is an effective and economical method for detecting genomic structural variants and chromosomal abnormalities. Unfortunately, the mapping and alignment of mate pair read pairs to a reference genome is a challenging and <br>time consuming process for most NGS alignment programs. Large insert sizes, introduction of library preparation protocol artifacts (biotin junction reads, paired-end read contamination, chimeras, etc.), and presence of structural variant breakpoints within reads increases mapping and alignment complexity. We describe an algorithm that is up to 20 times faster and 25% more accurate than popular NGS alignment programs when processing mate pair sequencing. <br>Availability: http://bioinformaticstools.mayo.edu/research/bima/ <br>Contact: vasmatzis.george@mayo.edu</p><p>Address of the bookmark: <a href="http://bioinformatics.oxfordjournals.org/content/early/2014/02/12/bioinformatics.btu078.full.pdf" rel="nofollow">http://bioinformatics.oxfordjournals.org/content/early/2014/02/12/bioinformatics.btu078.full.pdf</a></p>]]></description>
	<dc:creator>Abhimanyu Singh</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/31156/splitbam-splits-a-bam-by-chromosomes</guid>
	<pubDate>Tue, 28 Feb 2017 09:01:28 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/31156/splitbam-splits-a-bam-by-chromosomes</link>
	<title><![CDATA[splitbam: splits a BAM by chromosomes]]></title>
	<description><![CDATA[<p><strong>splitbam</strong>&nbsp;splits a BAM by chromosomes.</p>
<p>Using the reference sequence dictionary (<code>*.dict</code>), it also creates some empty BAM files if no sam record was found for a chromosome. A pair of 'mock' SAM-Records can also be added to those empty BAMs to avoid some tools (like samtools) to crash.</p>
<h1>Usage</h1>
<p><code>java -jar splitbam.jar -p OUT/__CHROM__/__CHROM__.bam -R ref.fasta (bam|sam|stdin)</code></p>
<h1>Options</h1>
<ul>
<li>-h help; This screen.</li>
<li>-R (indexed reference file) REQUIRED.</li>
<li>-u (unmapped chromosome name): default:Unmapped</li>
<li>-e | --empty : generate EMPTY bams for chromosome having no read mapped</li>
<li>-m | --mock : if option '-e', add a mock pair of sam records to the empty bam</li>
<li>-p (output file/bam pattern) REQUIRED. MUST contain&nbsp;<strong><code>__CHROM__</code></strong>&nbsp;and end with .bam</li>
<li>-s assume input is sorted.</li>
<li>-x | --index create index.</li>
<li>-t | --tmp (dir) tmp file directory</li>
<li>-G (file) chrom-group file (see below)</li>
</ul><p>Address of the bookmark: <a href="https://code.google.com/archive/p/jvarkit/wikis/SplitBam.wiki" rel="nofollow">https://code.google.com/archive/p/jvarkit/wikis/SplitBam.wiki</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

</channel>
</rss>