<?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/27311?offset=60</link>
	<atom:link href="https://bioinformaticsonline.com/related/27311?offset=60" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34380/chsminer-a-gui-tool-to-identify-chromosomal-homologous-segments</guid>
	<pubDate>Sat, 18 Nov 2017 16:55:49 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34380/chsminer-a-gui-tool-to-identify-chromosomal-homologous-segments</link>
	<title><![CDATA[CHSMiner: a GUI tool to identify chromosomal homologous segments]]></title>
	<description><![CDATA[<div id="ASec1">
<h3>Background</h3>
<p>The identification of chromosomal homologous segments (CHS) within and between genomes is essential for comparative genomics. Various processes including insertion/deletion and inversion could cause the degeneration of CHSs.</p>
</div>
<div id="ASec2">
<h3>Results</h3>
<p>Here we present a Java software CHSMiner that detects CHSs based on shared gene content alone. It implements fast greedy search algorithm and rigorous statistical validation, and its friendly graphical interface allows interactive visualization of the results. We tested the software on both simulated and biological realistic data and compared its performance with similar existing software and data source.</p>
</div>
<div id="ASec3">
<h3>Conclusion</h3>
<p>CHSMiner is characterized by its integrated workflow, fast speed and convenient usage. It will be useful for both experimentalists and bioinformaticians interested in the structure and evolution of genomes.</p>
<p>&nbsp;</p>
<p>https://github.com/zhenwang100/CHSMiner</p>
</div><p>Address of the bookmark: <a href="https://almob.biomedcentral.com/articles/10.1186/1748-7188-4-2" rel="nofollow">https://almob.biomedcentral.com/articles/10.1186/1748-7188-4-2</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/12787/integrative-genomics-viewer-igv-tutorial</guid>
	<pubDate>Sat, 12 Jul 2014 15:16:23 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/12787/integrative-genomics-viewer-igv-tutorial</link>
	<title><![CDATA[Integrative Genomics Viewer (IGV) tutorial]]></title>
	<description><![CDATA[<p>The <a href="http://www.broadinstitute.org/igv/">Integrative Genomics Viewer (IGV)</a> from the Broad Center allows you to view several types of data files involved in any NGS analysis that employs a reference genome, including how reads from a dataset are mapped, gene annotations, and predicted genetic variants.</p>
<p>http://www.broadinstitute.org/igv/</p><p>Address of the bookmark: <a href="https://wikis.utexas.edu/display/bioiteam/Integrative+Genomics+Viewer+%28IGV%29+tutorial" rel="nofollow">https://wikis.utexas.edu/display/bioiteam/Integrative+Genomics+Viewer+%28IGV%29+tutorial</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34567/jobtree-based-python-wrapper-to-run-the-genome-simulation-tool-suite-evolver</guid>
	<pubDate>Fri, 08 Dec 2017 16:26:32 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34567/jobtree-based-python-wrapper-to-run-the-genome-simulation-tool-suite-evolver</link>
	<title><![CDATA[jobTree based python wrapper to run the genome simulation tool suite Evolver]]></title>
	<description><![CDATA[<p><span>evolverSimControl</span><span>&nbsp;(</span><span>eSC</span><span>) can be used to simulate multi-chromosome genome evolution on an arbitrary phylogeny (</span><a href="http://evolution.genetics.washington.edu/phylip/newicktree.html">Newick format</a><span>). In addition to simply running evolver,&nbsp;</span><span>eSC</span><span>&nbsp;also automatically creates statistical summaries of the simulation as it runs including text and image files. Also included are convenience scripts to: check on a running simulation and see detailed status and logging information; extract fasta sequence files from the leaf nodes of a completed simulation; extract pairwise multiple alignment files (</span><a href="http://genome.ucsc.edu/FAQ/FAQformat.html#format5">.maf</a><span>) from leaf and branch nodes from a completed simulation and with the help of&nbsp;</span><a href="https://github.com/dentearl/mafTools/">mafJoin</a><span>, join them together into a single maf covering the entire simulation.</span></p><p>Address of the bookmark: <a href="https://github.com/dentearl/evolverSimControl" rel="nofollow">https://github.com/dentearl/evolverSimControl</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/12963/cosmos-our-workflow-management-system-for-ngs-data</guid>
	<pubDate>Wed, 23 Jul 2014 07:29:14 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/12963/cosmos-our-workflow-management-system-for-ngs-data</link>
	<title><![CDATA[COSMOS, our workflow management system for NGS data]]></title>
	<description><![CDATA[<p><strong>COSMOS</strong>, our Python-based management system for implementing large-scale parallel workflows focusing on, but not restricted to, large-scale short-read "NGS" sequencing data is open-access published via <a href="http://bioinformatics.oxfordjournals.org/content/early/2014/06/29/bioinformatics.btu385.abstract">Advance Access</a> in <em>Bioinformatics</em> (<a href="http://scholar.harvard.edu/lancaster/publications/cosmos-python-library-massively-parallel-workflows">Gafni et al. 2014</a>).&nbsp; It is also available for download for non-commercial academic and research purposes at:</p>
<p><strong>&nbsp;<a href="http://cosmos.hms.harvard.edu/">http://cosmos.hms.harvard.edu/</a></strong>.</p><p>Address of the bookmark: <a href="https://cosmos.hms.harvard.edu/" rel="nofollow">https://cosmos.hms.harvard.edu/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34922/camsa-a-tool-for-comparative-analysis-and-merging-of-scaffold-assemblies</guid>
	<pubDate>Thu, 28 Dec 2017 09:10:26 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34922/camsa-a-tool-for-comparative-analysis-and-merging-of-scaffold-assemblies</link>
	<title><![CDATA[CAMSA :: a tool for Comparative Analysis and Merging of Scaffold Assemblies]]></title>
	<description><![CDATA[<p>CAMSA &ndash; is a tool for&nbsp;<span>C</span>omparative&nbsp;<span>A</span>nalysis and&nbsp;<span>M</span>erging of&nbsp;<span>S</span>caffold&nbsp;<span>A</span>ssemblies, distributed both as a standalone software package and as Python library under the MIT license.</p>
<p>Main features:</p>
<ol>
<li>works with any number of scaffold assemblies in de-novo non-progressive fashion</li>
<li>allows to simultaneously work with scaffold assemblies obtained from any&nbsp;<em>in silico</em>&nbsp;and&nbsp;<em>in vitro</em>&nbsp;techniques, supporting multiple existing formats via built-in converters</li>
<li>creates an extensive report with several comparative quality metrics (both on assembly level and on the level of individual assembly points)</li>
<li>constructs a merged combined scaffold assembly</li>
<li>provides an interactive framework for a visual comparative analysis of the given assemblies</li>
</ol><p>Address of the bookmark: <a href="https://cblab.org/camsa/" rel="nofollow">https://cblab.org/camsa/</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/researchlabs/view/12995/national-center-for-bioinformatics-ncb</guid>
  <pubDate>Wed, 23 Jul 2014 14:10:49 -0500</pubDate>
  <link></link>
  <title><![CDATA[National Center for Bioinformatics (NCB)]]></title>
  <description><![CDATA[
<p>NCB is offering M.Phil and Ph.D programs in the area of Bioinformatics. The major goal of NCB is to promote quality training and research in the area of Bioinformatics. Bioinformatics originated as a cross-disciplinary field as the need for computational sections to research problem raised in biomedicine. </p>

<p>More at http://ncb.qau.edu.pk/</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36607/tarean-a-computational-tool-for-identification-and-characterization-of-satellite-dna-from-unassembled-short-reads</guid>
	<pubDate>Tue, 15 May 2018 02:53:11 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36607/tarean-a-computational-tool-for-identification-and-characterization-of-satellite-dna-from-unassembled-short-reads</link>
	<title><![CDATA[TAREAN: A computational tool for identification and characterization of satellite DNA from unassembled short reads]]></title>
	<description><![CDATA[<p><strong>TA</strong>ndem&nbsp;<strong>RE</strong>peat&nbsp;<strong>AN</strong>alyzer -TAREAN &ndash; is a computational pipeline for&nbsp;<strong>unsupervised identification of satellite repeats</strong>&nbsp;from unassembled sequence reads. The pipeline uses low-pass whole genome sequence reads and performs their graph-based clustering. Resulting clusters, representing all types of repeats, are then examined for the presence of circular structures and putative satellite repeats are reported.</p>
<p><em><strong>How to use TAREAN</strong></em>:</p>
<ul>
<li>Install a local instance of the pipeline using its source code available from&nbsp;<a href="https://bitbucket.org/petrnovak/repex_tarean" target="_blank" title="TAREAN source code">bitbucket repository</a>.</li>
<li>Use&nbsp; public Galaxy-based server at&nbsp;<a href="https://repeatexplorer-elixir.cerit-sc.cz/" target="_blank">https://repeatexplorer-elixir.cerit-sc.cz/</a>. The server is provided in frame of the&nbsp;<a href="https://www.elixir-czech.cz/" target="_blank">Elixir CZ project</a>&nbsp;and is maintained by&nbsp;<a href="https://www.cesnet.cz/" target="_blank">CESNET</a>&nbsp;and&nbsp;<a href="https://www.cerit-sc.cz/en/index.html" target="_blank">CERIT-SC</a>. Simple registration is required to use this service.</li>
</ul>
<p>Development of TAREAN was supported by&nbsp;<a href="https://www.elixir-czech.cz/" target="_blank" title="ELIXIR-CZ">ELIXIR CZ</a>&nbsp;research infrastructure project (MEYS Grant No: LM2015047).</p>
<p><strong><em>References</em></strong></p>
<p>Novak, P., Avila Robledillo, L., Koblizkova, A., Vrbova, I., Neumann, P., Macas, J. (2017) &ndash;&nbsp;<a href="https://academic.oup.com/nar/article/3574061/" target="_blank">TAREAN: a computational tool for identification and characterization of satellite DNA from unassembled short reads</a>.&nbsp;<em>Nucleic Acids Res.</em>, doi:10.1093/nar/gkx257</p><p>Address of the bookmark: <a href="https://bitbucket.org/petrnovak/repex_tarean" rel="nofollow">https://bitbucket.org/petrnovak/repex_tarean</a></p>]]></description>
	<dc:creator>Surabhi Chaudhary</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/13276/senior-research-fellow-at-nit-rourkela</guid>
  <pubDate>Wed, 30 Jul 2014 00:53:13 -0500</pubDate>
  <link></link>
  <title><![CDATA[Senior Research Fellow at NIT, Rourkela]]></title>
  <description><![CDATA[
<p>NATIONAL INSTITUTE OF TECHNOLOGY, ROURKELA – 769 008(ORISSA)<br />SPONSORED RESEARCH, INDUSTRIAL CONSULTANCY &amp; CONTINUING EDUCATION</p>

<p>ADVERTISEMENT NO: NITR/SR/CH-BIF/2014/30</p>

<p>Applications are invited on prescribed format for the following assignment in a purely time bound research project undertaken in the Department of Biotechnology &amp; Medical Engineering of the Institute.</p>

<p>1. Name of the Temporary Post : Senior Research Fellow-01<br />2. Name of the Research Project: “ Bioinformatics Infrastructure Facility (BIF)”<br />3. Name of the Sponsoring Agency: DBT, Government of India, 4 Tenure of the Project : 12th Five year Plan<br />5 Tenure of the Assignment : 01 year [Likely to be extended for 04 more years]<br />6 Job Description : BIF Maintenance and Active Research in Bioinformatics<br />7. Consolidated monthly compensation / Fellowship: Rs.18,000/- P.M.</p>

<p>8. Essential Qualifications and experience: B.Tech with valid GATE Score or M.Tech degree in Biotechnology/Bioinformatics/Computer Science/Computational Biology<br />9. Desirable Qualifications/ Experiences: Experience of Programming in PERL,R, Python, Unix and Visual Studio + Knowledge in NGS data analysis work flows ,WGS and statistical packages such as CRAN-R,MATLAB etc.</p>

<p>10. Accommodation : Bachelor accommodation in the Institute may be provided subject to availability.<br />11. For technical information on the project, the candidate may contact the Principal Investigator at the following address:</p>

<p>Name : Prof. Mukesh K Gupta<br />Address : Dept. of Biotechnology &amp; Medical Engineering,<br />N.I.T.Rourkela-769 008<br />Telephone No : 0661-2462294<br />E-mail : guptam@nitrkl.ac.in</p>

<p>Eligible persons may apply in the prescribed format (available in the Institute Website)affixed with coloured photographs to be submitted in duplicate along with photo copies of relevant certificates, grade/ mark sheets, publications etc., to Asst. Registrar, SRICCE,<br />National Institute of Technology, Rourkela–769 008 before 22.08.2014. The cover should be super- scribed clearly the post applied for &amp; Name of the Project.</p>

<p>Mere possession of minimum qualification does not guarantee invitation to the interview.<br />Candidates will be short listed based on merit and need of the project.</p>

<p>Advertisement:</p>

<p>http://www.nitrkl.ac.in/IntraWeb/Jobs_Tenders/Jobs/ProjectFellowship/2014/141707192838_1.pdf</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36833/bfc-a-standalone-high-performance-tool-for-correcting-sequencing-errors-from-illumina-sequencing-data</guid>
	<pubDate>Thu, 31 May 2018 09:35:23 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36833/bfc-a-standalone-high-performance-tool-for-correcting-sequencing-errors-from-illumina-sequencing-data</link>
	<title><![CDATA[BFC: a standalone high-performance tool for correcting sequencing errors from Illumina sequencing data]]></title>
	<description><![CDATA[BFC is a standalone high-performance tool for correcting sequencing errors from Illumina sequencing data. It is specifically designed for high-coverage whole-genome human data, though also performs well for small genomes.

The BFC algorithm is a variant of the classical spectrum alignment algorithm introduced by Pevzner et al (2001). It uses an exhaustive search to find a k-mer path through a read that minimizes a heuristic objective function jointly considering penalties on correction, quality and k-mer support. This algorithm was first implemented in my fermi assembler and then refined a few times in fermi, fermi2 and now in BFC. In the k-mer counting phase, BFC uses a blocked bloom filter to filter out most singleton k-mers and keeps the rest in a hash table (Melsted and Pritchard, 2011). The use of bloom filter is how BFC is named, though other correctors such as Lighter and Bless actually rely more on bloom filter than BFC.

https://github.com/lh3/bfc<p>Address of the bookmark: <a href="https://github.com/lh3/bfc" rel="nofollow">https://github.com/lh3/bfc</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/13510/studentship-and-traineeship-in-bioinformatics-at-barkatullah-university-bhopal</guid>
  <pubDate>Thu, 07 Aug 2014 16:57:00 -0500</pubDate>
  <link></link>
  <title><![CDATA[Studentship and Traineeship in Bioinformatics at Barkatullah University, Bhopal]]></title>
  <description><![CDATA[
<p>Department of Biotechnology &amp; Bioinformatics Center<br />Barkatullah University, Bhopal – 462 026</p>

<p>Studentship and Traineeship in Bioinformatics</p>

<p>Applications are invited on plain paper from suitable candidates for Studentship and Traineeship (One each) at Bioinformatics Sub-Center as detailed below:</p>

<p>1. Studentship: Studentship is for those who have completed M. Sc. Degrees in Life Science.</p>

<p>Number of seats : One</p>

<p>Duration : Six months</p>

<p>Eligibility : Passed M.Sc. degree in Life Sciences.</p>

<p>Fellowship : Rs. 5000/- (Five thousand only) per month</p>

<p>2. Traineeship: Traineeship is for those who have completed M. Sc. Degrees in Life Science/Registered Ph. D. student in Life Sciences.</p>

<p>Number of seats : One</p>

<p>Duration : Six months</p>

<p>Eligibility : Passed M.Sc. degree in Life Sciences/ Registered Ph. D. student in Life Sciences</p>

<p>Fellowship : Rs. 5000/- (Five thousand only) per month</p>

<p>Preferences will be given to person who has experience in Bioinformatics and Computer<br />sciences. The application along with detailed bio-data should reach the undersigned, on or before 25th August 2014. Both, the studentship and the traineeship are temporary, will be discontinued after the six months from the date of Joining. It may be discontinued in-between without any notice, if the work is not found satisfactory.</p>

<p>Advertisement www.bioinfobubpl.nic.in/Advertisement_st.pdf</p>
]]></description>
</item>

</channel>
</rss>