<?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/30555?offset=110</link>
	<atom:link href="https://bioinformaticsonline.com/related/30555?offset=110" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/30130/scaffmatch</guid>
	<pubDate>Tue, 13 Dec 2016 10:23:56 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/30130/scaffmatch</link>
	<title><![CDATA[ScaffMatch]]></title>
	<description><![CDATA[<p>caffMatch is a novel scaffolding tool based on Maximum-Weight Matching able to produce high-quality scaffolds from NGS data (reads and contigs). The tool is written in Python 2.7. It also includes a bash script wrapper that calls aligner in case one needs to first map reads to contigs (instead of providing .sam files).</p>
<p>The arguments accepted by ScaffMatch are:</p>
<p>&nbsp; -w) Working directory -- this is the directory where ScaffMatch files are stored. These are .sam files produced after mapping reads to contigs and the resulting scaffolds file `scaffolds.fa` fasta file;</p>
<p>&nbsp; -c) Contig fasta file;</p>
<p>&nbsp; -m) Command line argument with no options. It is used when .sam files are used instead of reads .fastq files. Do not use this option if you provide reads files;</p>
<p>&nbsp; -1) (Comma separated list of) either .fastq or .sam file(s) corresponding to the first read of the read pair;</p>
<p>&nbsp; -2) (Comma separated list of) either .fastq or .sam file(s) corresponding to the second read of the read pair;</p>
<p>&nbsp; -i) (Comma separated list of) insert size(s) of the library(-ies);</p>
<p>&nbsp; -s) (Comma separated list of) library(-ies) standard deviation(s) of insert size(s);</p>
<p>&nbsp; -t) Bundle threshold. Pairs of contigs supported by number of read pairs less than the value of this argument are discarded. Optional argument, by default it is equal to 5;</p>
<p>&nbsp; -g) Matching heuristics: use `max_weight` for Maximum Weight Matching heuristics with the Insertion step, use `backbone` for Maximum Weight Matching heuristics without the Insertion step, use `greedy` for Greedy Matching heuristics;</p>
<p>&nbsp; -l) Log file - where to store the logs. Optional argument. By default, stdout is used.</p><p>Address of the bookmark: <a href="http://alan.cs.gsu.edu/NGS/?q=content/scaffmatch" rel="nofollow">http://alan.cs.gsu.edu/NGS/?q=content/scaffmatch</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/videolist/watch/2759/dynamic-programming-alignment</guid>
	<pubDate>Thu, 22 Aug 2013 09:38:28 -0500</pubDate>
	<link>https://bioinformaticsonline.com/videolist/watch/2759/dynamic-programming-alignment</link>
	<title><![CDATA[Dynamic Programming Alignment]]></title>
	<description><![CDATA[<iframe width="" height="" src="https://www.youtube-nocookie.com/embed/EWJnDMKBEv0" frameborder="0" allowfullscreen></iframe>lecture 9, Chem. C100, Spring 2013, UCLA]]></description>
	
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/30236/pyscaf</guid>
	<pubDate>Mon, 19 Dec 2016 14:20:33 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/30236/pyscaf</link>
	<title><![CDATA[pyScaf]]></title>
	<description><![CDATA[<p>pyScaf orders contigs from genome assemblies utilising several types of information:</p>
<ul>
<li>paired-end (PE) and/or mate-pair libraries (<a href="https://github.com/lpryszcz/pyScaf#ngs-based-scaffolding">NGS-based mode</a>)</li>
<li>long reads (<a href="https://github.com/lpryszcz/pyScaf#scaffolding-based-on-long-reads">NGS-based mode</a>)</li>
<li>synteny to the genome of some related species (<a href="https://github.com/lpryszcz/pyScaf#reference-based-scaffolding">reference-based mode</a>)</li>
</ul>
<p>Scaffolding&nbsp;</p>
<p>In reference-based mode, pyScaf uses synteny to the genome of closely related species in order to order contigs and estimate distances between adjacent contigs.</p>
<p>Contigs are aligned globally (end-to-end) onto reference chromosomes, ignoring:</p>
<ul>
<li>matches not satisfying cut-offs (<code>--identity</code>&nbsp;and&nbsp;<code>--overlap</code>)</li>
<li>suboptimal matches (only best match of each query to reference is kept)</li>
<li>and removing overlapping matches on reference.</li>
</ul>
<p>In preliminary tests, pyScaf performed superbly on simulated heterozygous genomes based on&nbsp;<em>C. parapsilosis</em>&nbsp;(13 Mb; CANPA) and&nbsp;<em>A. thaliana</em>&nbsp;(119 Mb; ARATH) chromosomes, reconstructing correctly all chromosomes always for CANPA and nearly always for ARATH (<a href="https://www.dropbox.com/sh/bb7lwggo40xrwtc/AAAZ7pByVQQQ-WhUXZVeJaZVa/pyScaf?dl=0">Figures in dropbox</a>,&nbsp;<a href="https://docs.google.com/spreadsheets/d/1InBExy-qKDLj-upd8tlPItVSKc4mLepZjZxB31ii9OY/edit#gid=2036953672">CANPA table</a>,&nbsp;<a href="https://docs.google.com/spreadsheets/d/1InBExy-qKDLj-upd8tlPItVSKc4mLepZjZxB31ii9OY/edit#gid=1920757821">ARATH table</a>).<br>Runs took ~0.5 min for CANPA on&nbsp;<code>4 CPUs</code>&nbsp;and ~2 min for ARATH on&nbsp;<code>16 CPUs</code>.</p>
<p><span>Important remarks:</span></p>
<ul>
<li>Reduce your assembly before (fasta2homozygous.py) as any redundancy will likely break the synteny.</li>
<li>pyScaf works better with contigs than scaffolds, as scaffolds are often affected by mis-assemblies (no&nbsp;<em>de novo assembler</em>&nbsp;/ scaffolder is perfect...), which breaks synteny.</li>
<li>pyScaf works very well if divergence between reference genome and assembled contigs is below 20% at nucleotide level.</li>
<li>pyScaf deals with large rearrangements ie. deletions, insertion, inversions, translocations.&nbsp;<span>Note however, this is experimental implementation!</span></li>
<li>Consider closing gaps after scaffolding.</li>
</ul><p>Address of the bookmark: <a href="https://github.com/lpryszcz/pyScaf" rel="nofollow">https://github.com/lpryszcz/pyScaf</a></p>]]></description>
	<dc:creator>Bulbul</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/30304/mcscan</guid>
	<pubDate>Thu, 22 Dec 2016 03:53:58 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/30304/mcscan</link>
	<title><![CDATA[MCscan]]></title>
	<description><![CDATA[<p><span>MCscan is a computer program that can simultaneously scan multiple genomes to identify homologous chromosomal regions and subsequently align these regions using genes as anchors. This is the toolset for generating the synteny correspondences in&nbsp;</span><a href="http://chibba.agtec.uga.edu/duplication">Plant Genome Duplication Database</a><span>. It is intended as an easy-to-use and quick way to identify conserved gene arrays both within the same genome and across different genomes.</span></p>
<p><span>More at&nbsp;http://chibba.agtec.uga.edu/duplication/mcscan/</span></p><p>Address of the bookmark: <a href="http://chibba.agtec.uga.edu/duplication/mcscan/" rel="nofollow">http://chibba.agtec.uga.edu/duplication/mcscan/</a></p>]]></description>
	<dc:creator>Bulbul</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/30538/gkno</guid>
	<pubDate>Tue, 17 Jan 2017 03:35:34 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/30538/gkno</link>
	<title><![CDATA[GKNO]]></title>
	<description><![CDATA[<p><span>gkno opens the world of complex bioinformatic analysis to people of all level of computational expertise. This site contains documentation, tutorials and information on all the tools that comprise gkno.</span></p>
<p><span>More at&nbsp;http://gkno.me/</span></p><p>Address of the bookmark: <a href="http://gkno.me/" rel="nofollow">http://gkno.me/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/31087/bedtools</guid>
	<pubDate>Fri, 24 Feb 2017 04:50:44 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/31087/bedtools</link>
	<title><![CDATA[bedtools]]></title>
	<description><![CDATA[<p>Collectively, the&nbsp;<strong>bedtools</strong>&nbsp;utilities are a swiss-army knife of tools for a wide-range of genomics analysis tasks. The most widely-used tools enable&nbsp;<em>genome arithmetic</em>: that is, set theory on the genome. For example,&nbsp;<strong>bedtools</strong>&nbsp;allows one to<em>intersect</em>,&nbsp;<em>merge</em>,&nbsp;<em>count</em>,&nbsp;<em>complement</em>, and&nbsp;<em>shuffle</em>&nbsp;genomic intervals from multiple files in widely-used genomic file formats such as BAM, BED, GFF/GTF, VCF. While each individual tool is designed to do a relatively simple task (e.g.,&nbsp;<em>intersect</em>&nbsp;two interval files), quite sophisticated analyses can be conducted by combining multiple bedtools operations on the UNIX command line.</p>
<p><strong>bedtools</strong>&nbsp;is developed in the&nbsp;<a href="http://quinlanlab.org/">Quinlan laboratory</a>&nbsp;at the&nbsp;<a href="http://www.utah.edu/">University of Utah</a>&nbsp;and benefits from fantastic contributions made by scientists worldwide.</p><p>Address of the bookmark: <a href="http://bedtools.readthedocs.io/en/latest/index.html" rel="nofollow">http://bedtools.readthedocs.io/en/latest/index.html</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/31105/understanding-pacbio</guid>
	<pubDate>Fri, 24 Feb 2017 10:17:36 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/31105/understanding-pacbio</link>
	<title><![CDATA[Understanding PacBio]]></title>
	<description><![CDATA[<p>This tutorial includes resources for learning more about PacBio data and bioinformatics analysis, and includes content suitable for both beginners and experts. Below are links to training modules (webinars and PowerPoint presentations) to help you get started with your data processing, as well as information for specialized applications.</p>
<p>Training Resources:</p>
<ul>
<li><a href="https://github.com/PacificBiosciences/Bioinformatics-Training/wiki/Bioinformatics-Workshop">Bioinformatics Workshop (Webinars)</a></li>
<li><a href="https://github.com/PacificBiosciences/Bioinformatics-Training/wiki/Bioinformatics-Training-Slides">Bioinformatics Training Slides</a></li>
</ul>
<p>Specialized Applications:</p>
<ul>
<li><a href="https://github.com/PacificBiosciences/Bioinformatics-Training/wiki/De-Novo-Assembly">De Novo Assembly</a></li>
<li><a href="https://github.com/PacificBiosciences/cDNA_primer/wiki">Transcriptome analysis</a></li>
<li><a href="https://github.com/PacificBiosciences/Bioinformatics-Training/wiki/Base-modification-analysis">Base Modification Analysis</a></li>
<li><a href="https://github.com/PacificBiosciences/Bioinformatics-Training/wiki/Barcoding">Barcoding</a></li>
<li><a href="https://github.com/PacificBiosciences/Bioinformatics-Training/wiki/Data-Analysis-Tools">Data Analysis Tools</a></li>
<li><a href="https://github.com/PacificBiosciences/Bioinformatics-Training/wiki/Minor-Variants-and-Phasing-Analysis">Minor Variants and Phasing Analysis</a></li>
</ul><p>Address of the bookmark: <a href="https://github.com/PacificBiosciences/Bioinformatics-Training/wiki" rel="nofollow">https://github.com/PacificBiosciences/Bioinformatics-Training/wiki</a></p>]]></description>
	<dc:creator>Jitendra Narayan</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36739/blasr-mapping-single-molecule-sequencing-reads-using-basic-local-alignment-with-successive-refinement-blasr-theory-and-application</guid>
	<pubDate>Wed, 23 May 2018 06:54:32 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36739/blasr-mapping-single-molecule-sequencing-reads-using-basic-local-alignment-with-successive-refinement-blasr-theory-and-application</link>
	<title><![CDATA[BlasR Mapping single molecule sequencing reads using Basic Local Alignment with Successive Refinement (BLASR): Theory and Application,]]></title>
	<description><![CDATA[<p><span>BLASR (Basic Local Alignment with Successive Refinement) for mapping Single Molecule Sequencing (SMS) reads that are thousands to tens of thousands of bases long with divergence between the read and genome dominated by insertion and deletion error.</span></p>
<p>Here is how I use the blasr to align PacBio reads to the contigs (target.fasta). The &ldquo;target.fasta.sa&rdquo; is the suffix array from &ldquo;target.fasta&rdquo; generated by sawriter.</p>
<blockquote>
<p>blasr query.fa ./target.fasta -sa ./target.fasta.sa -bestn 40 -maxScore -500 -m 4 -nproc 24 -out target.m4 -maxLCPLength 15</p>
</blockquote>
<p>the output format option &ldquo;-m 4&Prime; generate the alignment coordinate. Not fully documented, but I can explain that to you.&nbsp;</p>
<p>I use a 24 cores / 48G ram server for the alignment. It took about 2 to 3 hours aligning 3G PacBio Reads to 10^6 sequences of short read contigs with a mean 3.5kbp length.</p><p>Address of the bookmark: <a href="http://bix.ucsd.edu/projects/blasr/" rel="nofollow">http://bix.ucsd.edu/projects/blasr/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36800/genomemapper-simultaneous-alignment-of-short-reads-against-multiple-genomes</guid>
	<pubDate>Fri, 25 May 2018 09:29:44 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36800/genomemapper-simultaneous-alignment-of-short-reads-against-multiple-genomes</link>
	<title><![CDATA[GenomeMapper: Simultaneous alignment of short reads against multiple genomes]]></title>
	<description><![CDATA[GenomeMapper is a short read mapping tool designed for accurate read alignments. It quickly aligns millions of reads either with ungapped or gapped alignments. It can be used to align against multiple genomes simulanteously or against a single reference. If you are unsure which one is the appropriate GenomeMapper, you might want to use the latter

https://www.ncbi.nlm.nih.gov/pmc/articles/PMC2768987/<p>Address of the bookmark: <a href="http://1001genomes.org/software/genomemapper.html" rel="nofollow">http://1001genomes.org/software/genomemapper.html</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/32011/fools-guide</guid>
	<pubDate>Sun, 02 Apr 2017 14:31:18 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/32011/fools-guide</link>
	<title><![CDATA[Fools guide]]></title>
	<description><![CDATA[<p><span>This website and accompaning documents are intended as a tool to help researchers dealing with non-model organisms acquire and process transcriptomic high-throughput sequencing data without having to learn extensive bioinformatics skills. It covers all steps from tissue collection, sample preparation and computer setup, through addressing biological questions with gene expression and SNP data.</span></p>
<p>http://sfg.stanford.edu/denovo.html</p>
<p>http://sfg.stanford.edu/sequencing.html</p>
<p>http://sfg.stanford.edu/BLAST.html</p>
<p>http://sfg.stanford.edu/denovo.html&nbsp;</p><p>Address of the bookmark: <a href="http://sfg.stanford.edu/guide.html" rel="nofollow">http://sfg.stanford.edu/guide.html</a></p>]]></description>
	<dc:creator>Poonam Mahapatra</dc:creator>
</item>

</channel>
</rss>