<?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/32709?offset=540</link>
	<atom:link href="https://bioinformaticsonline.com/related/32709?offset=540" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/40895/tadpole-an-assembler-error-corrector-and-read-extender</guid>
	<pubDate>Tue, 04 Feb 2020 23:35:40 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/40895/tadpole-an-assembler-error-corrector-and-read-extender</link>
	<title><![CDATA[Tadpole: an assembler, error-corrector, and read-extender]]></title>
	<description><![CDATA[<p><span>Tadpole is a kmer-based assembler, with additional capabilities of error-correcting and extending reads. It does not do any complicated graph analysis or scaffolding, and therefore, is not particularly good for diploid organisms.&nbsp;</span><span>Tadpole is very conservative and optimized for correctness rather than length; which is to say, it stops at every branch, and condenses every repeat. Also, it does not currently do scaffolding.</span></p>
<p>&nbsp;</p>
<p><span><span>To error-correct reads:</span><br><strong>tadpole.sh in=reads.fq out=corrected.fq mode=correct</strong><br><br><span>To extend reads by 50bp in each direction:</span><br><strong>tadpole.sh in=reads.fq out=extended.fq mode=extend el=50 er=50</strong><br><br><span>To error-correct and extend at the same time, using a kmer length of 62:</span><br><strong>tadpole.sh in=reads.fq out=extended.fq mode=extend el=50 er=50 k=62 ecc=t</strong></span></p>
<p>&nbsp;</p>
<p>More at&nbsp;<a href="http://seqanswers.com/forums/showthread.php?t=61445">http://seqanswers.com/forums/showthread.php?t=61445</a></p><p>Address of the bookmark: <a href="https://jgi.doe.gov/data-and-tools/bbtools/bb-tools-user-guide/tadpole-guide/" rel="nofollow">https://jgi.doe.gov/data-and-tools/bbtools/bb-tools-user-guide/tadpole-guide/</a></p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/2726/comparison-of-short-read-de-novo-alignment-algorithms</guid>
	<pubDate>Wed, 21 Aug 2013 07:56:01 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/2726/comparison-of-short-read-de-novo-alignment-algorithms</link>
	<title><![CDATA[Comparison of Short Read De Novo Alignment Algorithms]]></title>
	<description><![CDATA[<p>Excellent article to introduce different sequencing methods along with tools for de novo assembly of sequencing reads and their relevant references.</p>
<p>Title:&nbsp;<strong>Comparison of Short Read De Novo Alignment Algorithms&nbsp;</strong></p>
<p>Author<strong>: Nikhil Gopal</strong></p><p>Address of the bookmark: <a href="http://biochem218.stanford.edu/Projects%202011/Gopal%202011.pdf" rel="nofollow">http://biochem218.stanford.edu/Projects%202011/Gopal%202011.pdf</a></p>]]></description>
	<dc:creator>Rahul Agarwal</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/35345/rgfa-powerful-and-convenient-handling-of-assembly-graphs</guid>
	<pubDate>Thu, 25 Jan 2018 05:47:53 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/35345/rgfa-powerful-and-convenient-handling-of-assembly-graphs</link>
	<title><![CDATA[RGFA: powerful and convenient handling of assembly graphs]]></title>
	<description><![CDATA[<p><span>RGFA, an implementation of the proposed GFA specification in Ruby. It allows the user to conveniently parse, edit and write GFA files. Complex operations such as the separation of the implicit instances of repeats and the merging of linear paths can be performed. A typical application of RGFA is the editing of a graph, to finish the assembly of a sequence, using information not available to the assembler. We illustrate a use case, in which the assembly of a repetitive metagenomic fosmid insert was completed using a script based on RGFA.</span></p>
<p><span>https://github.com/ggonnella/rgfa</span></p><p>Address of the bookmark: <a href="https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5103826/" rel="nofollow">https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5103826/</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/29217/bioinformatics-openings-at-sri-venkateswara-college-university-of-delhi</guid>
  <pubDate>Tue, 20 Sep 2016 05:43:24 -0500</pubDate>
  <link></link>
  <title><![CDATA[Bioinformatics openings at Sri Venkateswara College, University of Delhi]]></title>
  <description><![CDATA[
<p>Bioinformatics center</p>

<p>Sri Venkateswara College (University of Delhi)</p>

<p>New Delhi- 110021</p>

<p>1. Junior Research Fellow (1 Post)</p>

<p>Applications are invited for the post of Junior Research Fellow (JRF) under DST funded project which is purely temporary and is strictly for project duration only.</p>

<p>Title of project</p>

<p>No. of post</p>

<p>Remuneration (Rs.)</p>

<p>“Computational assisted Design and Synthesis of Novel Antimalarial Agents Embodying Structural Diversity Suitable for Protease Inhibitors”</p>

<p>(One)</p>

<p>Fellowship and HRA as per DST guidelines</p>

<p>Qualification</p>

<p>Post Graduate Degree in Basic Science (M.Sc./M.Tech in Bioinformatics/Biophysics) from a recognized University in India or abroad with at least 55% marks with NET qualification or Graduate Degree in Professional Course with NET Qualification or Post Graduate Degree in Professional Course.</p>

<p>Desirable</p>

<p>Fair knowledge of Computer Aided Drug Designing (CADD), Protein Structure modeling, molecular docking, and simulations are preferable.</p>

<p>2. Traineeship (1 Post)</p>

<p>Applications are invited for the position of traineeship in DBT-BTISnet funded Bioinformatics Infrastructure Facility (BIF) to carry out project work in the area of Bioinformatics.</p>

<p>Qualification</p>

<p>Applicant should be possess PG degree/PG diploma in Bioinformatics for traineeship. The traineeship is awarded for a period of six months from the date of joining and is not extendable. The selected candidates are entitled to receive a stipend of Rs. 8000/- per month (consolidate) for a period of 6 months.</p>

<p>=====================================================================</p>

<p>3. Studentship (1 Post)</p>

<p>Applications are invited for the position of Studentship in DBT-BTISnet funded Bioinformatics Infrastructure Facility (BIF) to carry out project work in the area of Bioinformatics.</p>

<p>Qualification</p>

<p>Candidates pursuing the Final Year of Post Graduate Degree in Basic Science (M.Sc.) or Post Graduate/ Graduate Degree in Professional Course (M.Tech/B.Tech) in Bioinformatics from a recognized University in India or abroad. The selected candidates are entitled to receive a stipend of Rs. 8000/- per month (consolidate) for a period of 6 months.</p>

<p>How to Apply?</p>

<p>Applicants are required to send applications on plain paper, stating the name, address, date of birth, educational qualification, experience and Institute, along with attested photocopies of mark sheets and certificates etc. by September 20, 2016 to:</p>

<p>The Coordinator</p>

<p>Bioinformatics Center, Sri Venkateswara College</p>

<p>Benito Juarez Road, Dhaula Kuan, New Delhi- 110021</p>

<p>Applications may also be sent by email to contact@bic-svc.ac.in. Strictly mention "Application for JRF, Traineeship or Studentship" in the subject line as the case may be.</p>

<p>Short listed candidates will be called for an interview. Canvassing in any form will be a disqualification. No TA/DA will be paid either for attending the interview or joining the post.</p>

<p>For more details visit our lab webpage: http://www.bic-svc.ac.in</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37291/transrate-understanding-your-transcriptome-assembly</guid>
	<pubDate>Fri, 13 Jul 2018 07:49:26 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37291/transrate-understanding-your-transcriptome-assembly</link>
	<title><![CDATA[transrate: Understanding your transcriptome assembly]]></title>
	<description><![CDATA[<p><span>Transrate is software for&nbsp;</span><em>de-novo</em><span>&nbsp;transcriptome assembly quality analysis. It examines your assembly in detail and compares it to experimental evidence such as the sequencing reads, reporting quality scores for contigs and assemblies. This allows you to choose between assemblers and parameters, filter out the bad contigs from an assembly, and help decide when to stop trying to improve the assembly.</span></p><p>Address of the bookmark: <a href="http://hibberdlab.com/transrate/index.html" rel="nofollow">http://hibberdlab.com/transrate/index.html</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/29282/cosmic</guid>
	<pubDate>Sat, 01 Oct 2016 15:04:10 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/29282/cosmic</link>
	<title><![CDATA[COSMIC]]></title>
	<description><![CDATA[<p>The accurate description and annotation of structural variants can be complex. &nbsp;This is due to the different resolution that variants are reported from traditional&nbsp;cytogenetic coordinates down to the actual base pair positions. Furthermore, multiple&nbsp;rearrangements in a single area of the genome can make cataloguing and interpreting&nbsp;their effects challenging.&nbsp;</p>
<p>The Rearrangement Overview page describes the one or more breakpoints which make up a structural&nbsp;variant. A breakpoint is defined as a region or point where the sample sequence has altered&nbsp;from the reference sequence. Minimum interpretation is made of this data. One variant event&nbsp;can consist of one or multiple breakpoints. The Syntax (shown above the table) gives a detailed description of the variant and its location &nbsp;(e.g. chr11:g.36585230_76606619del, a deletion of&nbsp;roughly 40Mb on chromosome 11). Syntax is based on HGVS mutation nomenclature recommendations&nbsp;[http://www.hgvs.org/rec.html].&nbsp;</p>
<p>http://cancer.sanger.ac.uk/cosmic/help/rearrangement/overview</p><p>Address of the bookmark: <a href="http://cancer.sanger.ac.uk/cosmic/help/rearrangement/overview" rel="nofollow">http://cancer.sanger.ac.uk/cosmic/help/rearrangement/overview</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/38505/allhic-phasing-and-scaffolding-polyploid-genomes-based-on-hi-c-data</guid>
	<pubDate>Thu, 20 Dec 2018 12:03:32 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/38505/allhic-phasing-and-scaffolding-polyploid-genomes-based-on-hi-c-data</link>
	<title><![CDATA[ALLHiC: Phasing and scaffolding polyploid genomes based on Hi-C data]]></title>
	<description><![CDATA[<p><span>The major problem of scaffolding polyploid genome is that Hi-C signals are frequently detected between allelic haplotypes and any existing stat of art Hi-C scaffolding program links the allelic haplotypes together. To solve the problem, we developed a new Hi-C scaffolding pipeline, called ALLHIC, specifically tailored to the polyploid genomes. ALLHIC pipeline contains a total of 5 steps:&nbsp;</span><em>prune</em><span>,&nbsp;</span><em>partition</em><span>,&nbsp;</span><em>rescue</em><span>,&nbsp;</span><em>optimize</em><span>&nbsp;and&nbsp;</span><em>build</em><span>.</span></p><p>Address of the bookmark: <a href="https://github.com/tangerzhang/ALLHiC/wiki" rel="nofollow">https://github.com/tangerzhang/ALLHiC/wiki</a></p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/38755/svaba-genome-wide-detection-of-structural-variants-and-indels-by-local-assembly</guid>
	<pubDate>Mon, 21 Jan 2019 17:58:56 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/38755/svaba-genome-wide-detection-of-structural-variants-and-indels-by-local-assembly</link>
	<title><![CDATA[SvABA: Genome-wide detection of structural variants and indels by local assembly]]></title>
	<description><![CDATA[<p><span>SvABA is a method for detecting structural variants in sequencing data using genome-wide local assembly. Under the hood, SvABA uses a custom implementation of&nbsp;</span><a href="https://github.com/jts/sga">SGA</a><span>&nbsp;(String Graph Assembler) by Jared Simpson, and&nbsp;</span><a href="https://github.com/lh3/bwa">BWA-MEM</a><span>&nbsp;by Heng Li. Contigs are assembled for every 25kb window (with some small overlap) for every region in the genome. The default is to use only clipped, discordant, unmapped and indel reads, although this can be customized to any set of reads at the command line using&nbsp;</span><a href="https://github.com/walaj/VariantBam">VariantBam</a><span>&nbsp;rules. These contigs are then immediately aligned to the reference with BWA-MEM and parsed to identify variants. Sequencing reads are then realigned to the contigs with BWA-MEM, and variants are scored by their read support.</span></p><p>Address of the bookmark: <a href="https://github.com/walaj/svaba" rel="nofollow">https://github.com/walaj/svaba</a></p>]]></description>
	<dc:creator>Abhimanyu Singh</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/39856/tritex-sequence-assembly-pipeline-for-triticeae-genomes</guid>
	<pubDate>Tue, 20 Aug 2019 09:47:14 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/39856/tritex-sequence-assembly-pipeline-for-triticeae-genomes</link>
	<title><![CDATA[TRITEX sequence assembly pipeline for Triticeae genomes]]></title>
	<description><![CDATA[<div>
<p>The pipeline is open-source and hosted in a public Bitbucket&nbsp;<a href="https://bitbucket.org/tritexassembly/tritexassembly.bitbucket.io/src/master/">repository</a>.</p>
</div>
<div>
<p>TRITEX has been run on highly inbred genotypes of barley (<em>Hordeum vulgare</em>), tetraploid wheat (<em>Triticum turgidum</em>) and hexaploid wheat (<em>T. aestivum</em>) with reasonable results: super-scaffold N50 values in the range of dozens of Mb and pseudomolecules with better gene space representation than a BAC-by-BAC assembly. It has never been tested and is not expected to work on heterozygous or autopolyploid genomes.</p>
</div>
<div>
<p>A protocol for generating chromosome-conformation capture sequencing (Hi-C) data suitable for use with the pipeline is described in&nbsp;<a href="https://bio-protocol.org/e2955">Himmelbach et al. 2018</a>. Refer to the&nbsp;<a href="https://www.10xgenomics.com/resources/technical-notes/">technical notes</a>&nbsp;of 10X Genomics on how to generate Chromium data.</p>
</div><p>Address of the bookmark: <a href="https://tritexassembly.bitbucket.io/" rel="nofollow">https://tritexassembly.bitbucket.io/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/file/view/29654/randomness-and-probability</guid>
	<pubDate>Tue, 08 Nov 2016 07:17:32 -0600</pubDate>
	<link>https://bioinformaticsonline.com/file/view/29654/randomness-and-probability</link>
	<title><![CDATA[Randomness and Probability]]></title>
	<description><![CDATA[<p>Randomness and Probability</p><p>Randomness and probability are two differnet concepts: probaility is a measure (according to measure theory) which measures the randomness. Randomness is the object to be measured by probability.&nbsp;For example, probability is a mapping from randomness to the real number between 0 and 1. The similar examples are that the entropy measures the uncertanity; product of length and width measures the area of rectangle etc.</p><p><strong>Please see &ldquo;A mathematical theory of ability measure&rdquo; by N. Kong ets for more examples to answer&nbsp;this question.</strong></p>]]></description>
	<dc:creator>Jit</dc:creator>
	<enclosure url="https://bioinformaticsonline.com/file/download/29654" length="598559" type="application/pdf" />
</item>

</channel>
</rss>