<?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/19090?offset=1250</link>
	<atom:link href="https://bioinformaticsonline.com/related/19090?offset=1250" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	
<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/26567/ra-at-university-of-pune</guid>
  <pubDate>Mon, 07 Mar 2016 03:48:33 -0600</pubDate>
  <link></link>
  <title><![CDATA[RA at University of Pune]]></title>
  <description><![CDATA[
<p>Research Associate Job vacancies in University of Pune on temporary basis</p>

<p>No. of Post : 01</p>

<p>Department : Science and Technology</p>

<p>Qualifications : Ph.D. with specialization in Bioinformatics/Machine Learning/ Mathematical Biology/ Computational Biology/ Systems Biology with a minimum of 55% marks in M. Sc. (50% for candidates belongs to reserved category) or equivalent grade.  Candidates who have submitted their Ph.D. thesis and are waiting for award of Ph.D. are also eligible. OR M. Sc. Bioinformatics with two years of research experience in the areas mentioned above, a minimum of 55% marks in M.Sc. (50% for candidates belongs to reserved categories) or equivalent grade and at least one publication in Science Citation Index (SCI) journal. Preference will be given to B.I.N.C. /J.R.F. /N.E.T. /S.E.T. qualified candidates.  </p>

<p>Emoluments : Rs. 20,000/- (Including H.R.A.) per month.<br />How to apply</p>

<p>The complete application along with necessary documents and certificates should reach to 'The Director, Bioinformatics Centre, Savitribai Phule Pune University (Formerly University of Pune), Caneshkhind Road. Pune - 411 007 on or before 21st March, 2016 within official hours except Sundays (i.e. 10.20 am to 06.00 pm).</p>

<p>More at http://collegecirculars.unipune.ac.in/sites/documents/Job%20Openings/Forms/AllItems.aspx</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/pages/view/36842/gap-filling-or-contigs-extensions-tools</guid>
	<pubDate>Fri, 01 Jun 2018 08:07:32 -0500</pubDate>
	<link>https://bioinformaticsonline.com/pages/view/36842/gap-filling-or-contigs-extensions-tools</link>
	<title><![CDATA[Gap filling or Contigs extensions tools !]]></title>
	<description><![CDATA[
<p>There are many tools to perform gap filling using Illumina short reads, for example "GapFiller: a de novo assembly approach to fill the gap within paired reads" or "Toward almost closed genomes with GapFiller". There are also some tools like GAPresolution that can help to perform local re-assemblies using 454 reads. We used GAPresolution but it is not a very good software, it is useful only in some specific situations.</p>

<p>Take a look at the PRICE software from the DeRisi lab. Its meant to do something very similar. http://derisilab.ucsf.edu/index.php?page=software</p>

<p>You could also look at SSPACE (http://www.baseclear.com/landingpages/basetools-a-wide-range-of-bioinformatics-solutions/sspacev12/), ATLAS tools (http://www.hgsc.bcm.tmc.edu/content/bcm-hgsc-software), and SCARPA (http://compbio.cs.toronto.edu/hapsembler/scarpa.html).</p>

<p>See the PAGIT protocol: http://www.sanger.ac.uk/resources/software/pagit/ </p>

<p>In particular, take a look at the IMAGE tool: http://genomebiology.com/2010/11/4/R41 </p>

<p>Also SOAPdenovo has ha function for scaffolding. Not sure about ABYSS</p>

<p>Here there is a useful explanation of several tools.</p>

<p>https://bioinformaticsonline.com/search?q=scaffolding&amp;entity_type=object&amp;entity_subtype=bookmarks&amp;offset=0&amp;search_type=entities</p>

<p>I could be wrong, but the above answers to your hypothetical scenario appear to miss the point that you aren't interested in assembling the full genome, just the 100 kb part you're interested in. I suggest the following algorithm:</p>

<p>1. Start with the initial assembly C0 of the contigs you have identified as overlapping your region of interest, and the set S of reads those contigs contain. Let C = C0.</p>

<p>2. Repeat:<br />a. Identify paired-end reads (not in C) for which one or both ends align within, or extending, contigs in C.<br />b. Identify unpaired reads that align extending these new paired-end reads.<br />c. Construct a new assembly C' from C and the new reads identified in (a) and (b).<br />d. Trim C' so it does not extend more than 100 kb to either end of C0. Set C = C'.<br />e. Let S' denote the reads that contribute to C'. If S' does not contain any reads not present in S, stop. Otherwise, Set S = S'.</p>

<p>3. If you don't have a complete assembly of the region of interest, generate an STS for each end of each contig, probe a library for clones including these STSes, subclone these clones into a paired-end sequencing vector, and generate paired-end reads for this library; then try steps (1) and (2) again, adding these new sequencing reads to what you had before.</p>

<p>4. If your average sequencing depth for the region of interest exceeds 25 or so without filling all gaps, it is likely that the remaining gaps represent sequences that are not getting cloned in your sequencing vectors. Try different sequencing vectors.</p>
]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/41559/dahak-benchmarking-and-containerization-of-tools-for-analysis-of-complex-non-clinical-metagenomes</guid>
	<pubDate>Thu, 09 Apr 2020 04:56:09 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/41559/dahak-benchmarking-and-containerization-of-tools-for-analysis-of-complex-non-clinical-metagenomes</link>
	<title><![CDATA[Dahak: benchmarking and containerization of tools for analysis of complex non-clinical metagenomes.]]></title>
	<description><![CDATA[<p><span>Dahak is a software suite that integrates state-of-the-art open source tools for metagenomic analyses. Tools in the dahak software suite will perform various steps in metagenomic analysis workflows including data pre-processing, metagenome assembly, taxonomic and functional classification, genome binning, and gene assignment. We aim to deliver the analytical framework as a robust and reliable containerized workflow system, which will be free from dependency, installation, and execution problems typically associated with other open-source bioinformatics solutions. This will maximize the transparency, data provenance (i.e., the process of tracing the origins of data and its movement through the workflow), and reproducibility.</span></p>
<p><span>More at&nbsp;<a href="https://dahak-metagenomics.github.io/dahak/">https://dahak-metagenomics.github.io/dahak/</a></span></p><p>Address of the bookmark: <a href="https://github.com/dahak-metagenomics/dahak" rel="nofollow">https://github.com/dahak-metagenomics/dahak</a></p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/blog/view/43260/bioinformatics-tools-for-telomere-to-telomere-assembly</guid>
	<pubDate>Tue, 17 Aug 2021 13:17:09 -0500</pubDate>
	<link>https://bioinformaticsonline.com/blog/view/43260/bioinformatics-tools-for-telomere-to-telomere-assembly</link>
	<title><![CDATA[Bioinformatics tools for telomere to telomere assembly !]]></title>
	<description><![CDATA[<p>●&nbsp;<a href="https://github.com/arangrhie/merfin" target="_blank">Merfin</a>&nbsp;&ndash; k-mer-based assembly and variant calling evaluation for improved consensus accuracy (Arang Rhie)<br />●&nbsp;<a href="https://www.biorxiv.org/content/10.1101/2020.11.11.378133v1" target="_blank">PanGenie</a>&nbsp;&ndash; algorithm that leverages a pangenome reference built from haplotype-resolved genome assemblies in conjunction with k-mer count information from raw, short-read sequencing data to genotype a wide spectrum of genetic variation (Tobias Marschall)<br />●&nbsp;<a href="https://github.com/ConesaLab/SQANTI3" target="_blank">SQANTI3</a>&nbsp;&ndash; an automated pipeline for the classification of long-read transcripts that can assess the quality of data and the preprocessing pipeline (Roc&iacute;o Amor&iacute;n de Heged&uuml;s&nbsp;<a href="https://twitter.com/rocioadh" target="_blank">@rocioadh</a>)<br />●&nbsp;<a href="https://github.com/GenomeRIK/tama" target="_blank">tama</a>&nbsp;(Transcriptome Annotation by Modular Algorithms) &ndash; software designed for processing Iso-Seq data and other long-read transcriptome data (Richard Kuo&nbsp;<a href="https://twitter.com/GenomeRIK" target="_blank">@GenomeRIK</a>)<br />●&nbsp;<a href="https://github.com/PacificBiosciences/pbAA" target="_blank">pbaa</a>&nbsp;(PacBio Amplicon Analysis) &ndash; separates complex mixtures of amplicon targets from genomic samples to cluster and generate high-quality consensus sequences from HiFi reads (Zev Kronenberg&nbsp;<a href="https://twitter.com/zevkronenberg" target="_blank">@zevkronenberg</a>)<br />●&nbsp;<a href="https://github.com/yuanyuan929/bellerophon" target="_blank">bellerophon</a>&nbsp;&ndash; analyzes MHC typing and other low-complexity gene amplicon data; performs allele calling while detecting polymorphic sites within the sequences and removing potential chimeric sequence variants (Yuanyuan Cheng&nbsp;<a href="https://twitter.com/Yuanyuan929" target="_blank">@Yuanyuan929</a>)<br />●&nbsp;<a href="https://github.com/amwenger/svpack" target="_blank">svpack</a>&nbsp;&ndash; tools for filtering, comparing, and annotating structural variant (SV) calls in VCF format (Aaron Wenger)<br />●&nbsp;<a href="https://github.com/AntonBankevich/jumboDB" target="_blank">JumboDB</a>&nbsp;&ndash; tool for de Bruijn graph construction (Anton Bankevich&nbsp;<a href="https://twitter.com/AntonBankevich" target="_blank">@AntonBankevich</a>)<br />●&nbsp;<a href="https://github.com/ksahlin/ultra" target="_blank">uLTRA</a>&nbsp;&ndash; tool for splice alignment of long transcriptomic reads to a genome, guided by a database of exon annotations. (Kristoffer Sahlin&nbsp;<a href="https://twitter.com/krsahlin" target="_blank">@krsahlin</a>)<br />●&nbsp;<a href="https://www.biorxiv.org/content/10.1101/2021.01.25.428044v1.full.pdf" target="_blank">LeafGo</a>&nbsp;&ndash; workflow to rapidly produce high-quality de novo plant genomes (Luca Ermini&nbsp;<a href="https://twitter.com/ermini_luca" target="_blank">@ermini_luca</a>)</p><p>Reference:</p><p>https://www.pacb.com/blog/young-investigators-share-stellar-science-career-advice-and-bioinformatics-tools-at-smrt-leiden-2021/</p><p>&nbsp;</p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/26336/project-fellow-bioinformatics-at-central-university-of-himachal-pradesh</guid>
  <pubDate>Tue, 09 Feb 2016 03:58:00 -0600</pubDate>
  <link></link>
  <title><![CDATA[Project Fellow Bioinformatics at Central University of Himachal Pradesh]]></title>
  <description><![CDATA[
<p>Project Fellow Bioinformatics</p>

<p>Eligibility : MSc(Bio-Chemistry, Bio-Informatics)</p>

<p>Location : Kulu</p>

<p>Last Date : 07 Mar 2016</p>

<p>Hiring Process : Face to Face Interview<br />Central University of Himachal Pradesh</p>

<p>Project Fellow Bioinformatics Job in Central University of Himachal Pradesh</p>

<p>Project (MRP) entitled: “A project proposal on targeting novel prokaryotic ubiquitin like post-translational modification pathway for therapeutic interventions against Mycobacterium tuberculosis” (No. MRP-MAJOR-MICR-2013-26840)</p>

<p>Essential Qualification: 1. Master degree in Bioinformatics/Biochemistry/Biotechnology/Environmental Science/Microbiology or any branch of Life Sciences with a minimum of 55% marks for general category (50% in case of SC/ST/PH) 2. UGC/CSIR NET, GATE qualified candidates will be given preference. Desirable Qualification: Experience in basic Bioinformatics and Molecular Biology techniques.</p>

<p>Age: Below 40 years as on 01/10/2015.</p>

<p>No.of Post: 1</p>

<p>Salary: NET/GATE qualified candidate: Rs. 16,000/-p.m. for initial two years and Rs. 18,000/- p.m. for the third year. Non-NET/GATE candidates: Rs. 14,000/-p.m. for initial two years and Rs. 16,000/-p.m. for the third year.</p>

<p>Mode of Selection: The selection shall be made on the basis of merit. The eligible candidates are required to appear for interview before the duly constituted Selection Committee for the purpose. The scheduled date, time and venue for the interview shall be intimated to the eligible candidates through phone/ e-mail.<br />How to apply</p>

<p>Last date for the receipt of applications is 07.03.2016. </p>

<p>More at http://www.cuhimachal.ac.in/news_all.aspx</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/videolist/watch/8481/des-higgins-visualizing-multiple-sequence-alignments</guid>
	<pubDate>Wed, 26 Feb 2014 00:50:08 -0600</pubDate>
	<link>https://bioinformaticsonline.com/videolist/watch/8481/des-higgins-visualizing-multiple-sequence-alignments</link>
	<title><![CDATA[Des Higgins: Visualizing Multiple Sequence Alignments]]></title>
	<description><![CDATA[<iframe width="" height="" src="https://www.youtube-nocookie.com/embed/IQkOK3dsWs4" frameborder="0" allowfullscreen></iframe>Copyright Broad Institute, 2013. All rights reserved.
Des Higgins (http://www.bioinf.ucd.ie) gives a very entertaining introduction to the visualization of multiple sequence alignment, and to his widely-used Clustal tool. He highlights the emerging challenge of managing alignments with a very large number of sequences, and presents several approaches to this challenge, including faster algorithms and abstract views of clusters of alignments. This talk was presented at VIZBI 2011, an international conference series on visualizing biological data (http://www.vizbi.org) funded by NIH & EMBO.

For information about data visualization efforts at the Broad Institute, please visit:
http://www.broadinstitute.org/node/1363/]]></description>
	
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/26378/centurion</guid>
	<pubDate>Fri, 12 Feb 2016 04:45:41 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/26378/centurion</link>
	<title><![CDATA[Centurion]]></title>
	<description><![CDATA[<p>Although centromeres are essential for life and are the subject of extensive research, centromere locations in yeast genomes are difficult to infer, and in most species they are still unknown. Recently, the chromatin conformation assay Hi-C has been re-purposed for diverse applications, including de novo genome assembly, deconvolution of metagenomic samples, and inference of centromere locations. We describe a method, Centurion, that jointly infers the locations of all centromeres in a single yeast genome by exploiting the centromeres&rsquo; tendency to cluster in 3D space. We first demonstrate the accuracy of Centurion in identifying known centromere locations from high coverage Hi-C data of budding yeast and a human malaria parasite. We then use two metagenomic samples with relatively low coverage Hi-C data to infer centromere locations for each chromosome in 14 different yeast species. For yeasts with large centromeres (e.g., S. pombe) Centurion predicts the exact centromere locations. For seven yeasts with point centromeres, Centurion predicts most of the centromeres at an average of 5~kb distance from their known locations. Finally, we predict centromere coordinates for six yeast species that currently lack centromere annotations. These results suggest that Centurion can be used for centromere identification for a large number of yeast species, even with a limited amount of Hi-C sequencing.</p>
<p>Paper:http://www.ncbi.nlm.nih.gov/pubmed/25940625</p>
<p>More at http://cbio.ensmp.fr/centurion/</p><p>Address of the bookmark: <a href="http://cbio.ensmp.fr/centurion/" rel="nofollow">http://cbio.ensmp.fr/centurion/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/35896/phylographer-graph-visualization-tool</guid>
	<pubDate>Wed, 07 Mar 2018 18:11:25 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/35896/phylographer-graph-visualization-tool</link>
	<title><![CDATA[PhyloGrapher - Graph Visualization Tool]]></title>
	<description><![CDATA[<p><strong>PhyloGrapher</strong><span>&nbsp;is a program designed to visualize and study evolutionary relationships within families of homologous genes or proteins (elements).&nbsp;</span><strong>PhyloGrapher</strong><span>&nbsp;is a drawing tool that generates custom graphs for a given set of elements. In general, it is possible to use&nbsp;</span><strong>PhyloGrapher</strong><span>&nbsp;to visualize any type of relations between elements.&nbsp;</span></p>
<p><span>https://www.youtube.com/watch?v=WgufqYMHCvM</span></p><p>Address of the bookmark: <a href="http://www.atgc.org/PhyloGrapher/PhyloGrapher_Welcome.html" rel="nofollow">http://www.atgc.org/PhyloGrapher/PhyloGrapher_Welcome.html</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/researchlabs/view/26391/radka-reifova-lab</guid>
  <pubDate>Mon, 15 Feb 2016 06:00:48 -0600</pubDate>
  <link></link>
  <title><![CDATA[Radka Reifová Lab]]></title>
  <description><![CDATA[
<p>We are generally interested in the mechanisms of species origin from a molecular and ecological perspective. Particularly, we are interested in the role of sex chromosomes in speciation. Most of our research is done on birds and mammals. Currently, we focus our research on two hybridizing song birds, the Common nightingale (Luscinia megarhynchos) and the Thrush Nightingale (L. luscinia). Combining population genomic and ecological approaches we try to elucidate the genetic architecture of reproductive isolation and understand the role of interspecific competition and song convergence in the evolution of reproductive isolation between the species. </p>

<p>More at http://web.natur.cuni.cz/~radkas/index.php?page=research</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36905/d-genies-a-tool-for-dotplot-large-genomes-in-an-interactive-efficient-and-simple-way</guid>
	<pubDate>Mon, 11 Jun 2018 09:41:22 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36905/d-genies-a-tool-for-dotplot-large-genomes-in-an-interactive-efficient-and-simple-way</link>
	<title><![CDATA[D-GENIES: A tool for Dotplot large Genomes in an Interactive, Efficient and Simple way]]></title>
	<description><![CDATA[D-GENIES – for Dotplot large Genomes in an Interactive, Efficient and Simple way – is an online tool designed to compare two genomes. It supports large genome and you can interact with the dot plot to improve the visualisation.

We use minimap version 2 to align the two genomes. Then, the PAF file is parsed and plotted into an interactive plot written with d3.js library.

D-Genies also allows to display dot plots from other aligners by uploading their PAF or MAF alignment file.

http://dgenies.toulouse.inra.fr/<p>Address of the bookmark: <a href="http://dgenies.toulouse.inra.fr/" rel="nofollow">http://dgenies.toulouse.inra.fr/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

</channel>
</rss>