<?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/31566?offset=1590</link>
	<atom:link href="https://bioinformaticsonline.com/related/31566?offset=1590" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/pages/view/44371/steps-to-find-all-the-repeats-in-the-genome</guid>
	<pubDate>Thu, 31 Aug 2023 02:43:28 -0500</pubDate>
	<link>https://bioinformaticsonline.com/pages/view/44371/steps-to-find-all-the-repeats-in-the-genome</link>
	<title><![CDATA[Steps to find all the repeats in the genome !]]></title>
	<description><![CDATA[<div><p>To find repeats in a genome from 2 to 9 length using a Perl script, you can use the RepeatMasker tool with the "--length" option<a href="https://mobilednajournal.biomedcentral.com/articles/10.1186/1759-8753-5-13" target="_blank">[0]</a>. Here's a step-by-step guide:</p></div><div><ol>
<li>Install RepeatMasker: First, you need to install RepeatMasker on your system. You can download it from the RepeatMasker website<a href="https://mobilednajournal.biomedcentral.com/articles/10.1186/1759-8753-5-13" target="_blank">[0]</a>.</li>
</ol></div><div><ol>
<li>Prepare the genome sequence: Make sure you have the genome sequence in a FASTA file format. Let's assume the file is named "genome.fasta".</li>
</ol><blockquote><p>./RepeatMasker -pa &lt;number_of_processors&gt; -nolow -norna -no_is -div &lt;divergence_value&gt; -lib RepeatMaskerLib.embl -gff -xsmall -small -poly -species &lt;species_name&gt; -dir &lt;output_directory&gt; -length &lt;min_length&gt;-&lt;max_length&gt; genome.fasta</p></blockquote><div><p>Replace the following placeholders with appropriate values:</p><ul>
<li><code>&lt;number_of_processors&gt;</code>: The number of processors/threads you want to use for parallel processing.</li>
<li><code>&lt;divergence_value&gt;</code>: The divergence value for the species you are analyzing. You can find divergence values for different species in the RepeatMasker documentation<a href="https://mobilednajournal.biomedcentral.com/articles/10.1186/1759-8753-5-13" target="_blank">[0]</a>.</li>
<li><code>&lt;species_name&gt;</code>: The name of the species you are analyzing.</li>
<li><code>&lt;output_directory&gt;</code>: The directory where you want the output files to be saved.</li>
<li><code>&lt;min_length&gt;</code>&nbsp;and&nbsp;<code>&lt;max_length&gt;</code>: The minimum and maximum lengths of the repeats you want to find (in this case, 2 and 9).</li>
</ul></div><div><ol>
<li>Analyze the output: RepeatMasker will generate several output files, including a .out file. You can parse this file to extract the information you need. There is a Perl tool called "one_code_to_find_them_all.pl" that can help you parse RepeatMasker output files<a href="https://mobilednajournal.biomedcentral.com/articles/10.1186/1759-8753-5-13" target="_blank">[0]</a>. You can download it from the source provided.</li>
</ol></div><div><ol>
<li>Use the provided Perl script: Once you have the "one_code_to_find_them_all.pl" script, you can run it to conveniently parse the RepeatMasker output files. Here's an example of how to use it:</li>
</ol><blockquote><p>perl one_code_to_find_them_all.pl --rm &lt;RepeatMasker_out_file&gt; --length &lt;length_file&gt;</p></blockquote></div><p>&nbsp;</p></div><div><div><p>Replace&nbsp;<code>&lt;RepeatMasker_out_file&gt;</code>&nbsp;with the path to your RepeatMasker .out file, and&nbsp;<code>&lt;length_file&gt;</code>&nbsp;with the path to a file containing the lengths of the reference elements.</p></div><div><p>This script will generate several output files, including .log.txt and .copynumber.csv, which contain quantitative information about the identified repeat elements.</p></div><div><p>Remember to adjust the parameters and options according to your specific needs and the characteristics of your genome.</p></div></div>]]></description>
	<dc:creator>Neel</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/22966/ra-bioinformatics-at-icged</guid>
  <pubDate>Sun, 28 Jun 2015 12:24:01 -0500</pubDate>
  <link></link>
  <title><![CDATA[RA Bioinformatics at ICGED]]></title>
  <description><![CDATA[
<p>Research Associate Position at ICGEB, New Delhi with Dr. Amit Sharma</p>

<p>Starting 15th July 2015, the position relates to a project specifically for in silico drug docking, screening, design, optimisation and linkage with active chemists. </p>

<p>Experience in many docking softwares and operating systems is essential. </p>

<p>Additional experience in bioinformatics and computational biology tools will be useful. </p>

<p>Submit curriculum vitae to: sb.icgeb@gmail.com</p>

<p>Closing date: 5 July 2015</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/pages/view/44637/tools-to-access-the-quality-of-your-assembled-genome</guid>
	<pubDate>Thu, 08 Aug 2024 23:31:18 -0500</pubDate>
	<link>https://bioinformaticsonline.com/pages/view/44637/tools-to-access-the-quality-of-your-assembled-genome</link>
	<title><![CDATA[Tools to access the quality of your assembled genome !]]></title>
	<description><![CDATA[<ul dir="auto">
<li><a href="https://github.com/linsalrob/fasta_validator">FASTA VALIDATOR</a>&nbsp;+&nbsp;<a href="https://github.com/shenwei356/seqkit">SEQKIT RMDUP</a>: FASTA validation</li>
<li><a href="https://genometools.org/tools/gt_gff3validator.html">GENOMETOOLS GT GFF3VALIDATOR</a>: GFF3 validation</li>
<li><a href="https://github.com/PlantandFoodResearch/assemblathon2-analysis/blob/a93cba25d847434f7eadc04e63b58c567c46a56d/assemblathon_stats.pl">ASSEMBLATHON STATS</a>: Assembly statistics</li>
<li><a href="https://genometools.org/tools/gt_stat.html">GENOMETOOLS GT STAT</a>: Annotation statistics</li>
<li><a href="https://github.com/ncbi/fcs">NCBI FCS ADAPTOR</a>: Adaptor contamination pass/fail</li>
<li><a href="https://github.com/ncbi/fcs">NCBI FCS GX</a>: Foreign organism contamination pass/fail</li>
<li><a href="https://gitlab.com/ezlab/busco">BUSCO</a>: Gene-space completeness estimation</li>
<li><a href="https://github.com/tolkit/telomeric-identifier">TIDK</a>: Telomere repeat identification</li>
<li><a href="https://github.com/oushujun/LTR_retriever/blob/master/LAI">LAI</a>: Continuity of repetitive sequences</li>
<li><a href="https://github.com/DerrickWood/kraken2">KRAKEN2</a>: Taxonomy classification</li>
<li><a href="https://github.com/igvteam/juicebox.js">HIC CONTACT MAP</a>: Alignment and visualisation of HiC data</li>
<li><a href="https://github.com/mummer4/mummer">MUMMER</a>&nbsp;&rarr;&nbsp;<a href="http://circos.ca/documentation/">CIRCOS</a>&nbsp;+&nbsp;<a href="https://plotly.com/">DOTPLOT</a>&nbsp;&amp;&nbsp;<a href="https://github.com/lh3/minimap2">MINIMAP2</a>&nbsp;&rarr;&nbsp;<a href="https://github.com/schneebergerlab/plotsr">PLOTSR</a>: Synteny analysis</li>
<li><a href="https://github.com/marbl/merqury">MERQURY</a>: K-mer completeness, consensus quality and phasing assessment</li>
</ul>]]></description>
	<dc:creator>LEGE</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/news/view/23160/opencpu</guid>
	<pubDate>Sun, 05 Jul 2015 18:34:46 -0500</pubDate>
	<link>https://bioinformaticsonline.com/news/view/23160/opencpu</link>
	<title><![CDATA[OpenCPU]]></title>
	<description><![CDATA[<p>OpenCPU is a system for embedded scientific computing and reproducible research. The OpenCPU server provides a reliable and interoperable <a href="https://www.opencpu.org/api.html">HTTP API</a> for data analysis based on R.</p><p>The OpenCPU <a href="https://www.opencpu.org/jslib.html">JavaScript client library</a> provides the most seamless integration of R and JavaScript available today.</p><p>OpenCPU uses standard R packaging to develop, ship and deploy web applications. Several open source <a href="https://www.opencpu.org/apps.html">example apps</a> are available from Github.</p><p>Installing your own OpenCPU server is <a href="https://www.opencpu.org/download.html">super easy</a> and only takes a few minutes.</p><p>More at https://www.opencpu.org/</p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/blog/view/44766/genome-simulation-with-slim-and-msprime</guid>
	<pubDate>Fri, 31 Jan 2025 12:47:43 -0600</pubDate>
	<link>https://bioinformaticsonline.com/blog/view/44766/genome-simulation-with-slim-and-msprime</link>
	<title><![CDATA[Genome Simulation with SLiM and msprime]]></title>
	<description><![CDATA[<p>Genome simulation is an essential tool in population genetics, enabling researchers to model evolutionary processes and study genetic variation. Two widely used simulation tools in this field are <strong style="font-size: 12.8px;">SLiM</strong><span style="font-size: 12.8px; font-weight: normal;"> and </span><strong style="font-size: 12.8px;">msprime</strong><span style="font-size: 12.8px; font-weight: normal;">. While both serve different purposes, they can be used together with the </span><strong style="font-size: 12.8px;">slendr</strong><span style="font-size: 12.8px; font-weight: normal;"> framework to compare simulation outputs effectively.</span></p><h2>Overview of SLiM and msprime</h2><h3>SLiM: Forward Genetic Simulator</h3><p>SLiM is a <strong>free, open-source</strong> tool designed for forward genetic simulations. It allows researchers to model complex evolutionary scenarios, including selection, recombination, and demographic events, making it particularly useful for studying adaptation and selection in populations.</p><p><strong>Key Features of SLiM:</strong></p><ul>
<li>
<p>Simulates population evolution forward in time</p>
</li>
<li>
<p>Supports custom evolutionary models using an embedded scripting language</p>
</li>
<li>
<p>Allows modeling of spatial and ecological dynamics</p>
</li>
<li>
<p>Provides high flexibility and extensibility for user-defined scenarios</p>
</li>
<li>
<p>Available on GitHub as an open-source project</p>
</li>
</ul><h3>msprime: Ancestry and Mutation Simulator</h3><p>msprime is an efficient, <strong>open-source</strong> tool that simulates ancestry and mutations using a coalescent framework. It is known for its high-speed performance and low memory requirements, making it a popular choice for large-scale genomic simulations.</p><p><strong>Key Features of msprime:</strong></p><ul>
<li>
<p>Implements coalescent simulations for ancestry modeling</p>
</li>
<li>
<p>Efficiently simulates large population histories</p>
</li>
<li>
<p>Supports the addition of mutations to genealogies</p>
</li>
<li>
<p>Developed using an open-source community model</p>
</li>
<li>
<p>Often faster and more memory-efficient than alternative simulators</p>
</li>
</ul><h2>Using SLiM and msprime with slendr</h2><p>Both SLiM and msprime can be integrated with <strong>slendr</strong>, a framework that facilitates structured population genetic simulations. This integration allows for seamless comparison of simulation outputs.</p><h3>How They Work Together:</h3><ul>
<li>
<p>SLiM and msprime simulations can be analyzed within slendr.</p>
</li>
<li>
<p>The <strong>ts_read()</strong> function in slendr enables loading and comparing tree sequence outputs from both simulators.</p>
</li>
<li>
<p>This integration allows researchers to validate simulation results and gain deeper insights into evolutionary processes.</p>
</li>
</ul><h2>Performance Considerations</h2><p>While SLiM offers powerful forward simulations with extensive customization, msprime is often preferred for its <strong>speed and memory efficiency</strong> when simulating ancestry and mutations. The choice between the two depends on the research goals:</p><ul>
<li>
<p><strong>For detailed evolutionary modeling with selection and recombination:</strong> Use SLiM.</p>
</li>
<li>
<p><strong>For large-scale coalescent simulations with mutations:</strong> Use msprime.</p>
</li>
<li>
<p><strong>For comparing different simulation models and their outputs:</strong> Use slendr to integrate SLiM and msprime results.</p>
</li>
</ul><h2>Conclusion</h2><p>SLiM and msprime are valuable tools for genome simulation, each serving distinct but complementary purposes in population genetics research. By leveraging the strengths of both simulators with slendr, researchers can conduct robust and efficient evolutionary simulations, enhancing our understanding of genetic diversity and adaptation.</p><p>For more information, check out the official GitHub repositories for <strong>SLiM</strong> and <strong>msprime</strong>, and explore the <strong>slendr</strong> framework for streamlined simulation workflow</p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/24042/research-associate-bioinformatician-university-of-bristol</guid>
  <pubDate>Wed, 26 Aug 2015 05:46:29 -0500</pubDate>
  <link></link>
  <title><![CDATA[Research Associate Bioinformatician @ University of Bristol]]></title>
  <description><![CDATA[
<p>This 0.5 fte role will have specific responsibility for the bioinformatic side of a Health Innovation Challenged Fund (HICF) research project investigating the application of Next Generation Sequencing (NGS) technologies to the analysis of Minimal Residual Disease (MRD) in childhood Acute Lymphoblastic Leukaemia (ALL). The successful candidate will be responsible for designing and implementing an analysis pipeline primarily to fit with the clinical need, but with the capacity to answer innovative research questions.</p>

<p>For informal enquiries please contact Anne Walsh via email: anne.walsh@bristol.ac.uk.</p>

<p>Apply at http://www.bris.ac.uk/jobs/find/details.html?nPostingID=3639&amp;nPostingTargetID=13346&amp;option=28&amp;sort=DESC&amp;respnr=1&amp;ID=Q50FK026203F3VBQBV7V77V83&amp;JobNum=ACAD101624&amp;Resultsperpage=10&amp;lg=UK&amp;mask=uobext</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/blog/view/45240/pg2-making-pangenome-graphs-easier-to-understand</guid>
	<pubDate>Tue, 18 Aug 2026 04:38:23 -0500</pubDate>
	<link>https://bioinformaticsonline.com/blog/view/45240/pg2-making-pangenome-graphs-easier-to-understand</link>
	<title><![CDATA[PG2: Making Pangenome Graphs Easier to Understand]]></title>
	<description><![CDATA[<p>Genomics is moving beyond the traditional approach of studying DNA using a single reference genome. Today, researchers are increasingly using pangenomes, which represent genetic information from multiple genomes and capture a much broader range of genetic diversity.</p><p>However, pangenome graphs can be highly complex, making them difficult to visualize and interpret. A recent study published in BMC Bioinformatics introduces PG2 (PanGenoGrapher), an open-source, web-based tool designed to address this challenge.&nbsp;The source code and user guide are openly available on GitHub at https://github.com/iVis-at-Bilkent/pangenographer. A publicly accessible sample deployment is hosted at http://pg2.cs.bilkent.edu.tr. In addition, a demonstration video illustrating the primary use cases of PG2 is available at https://www.youtube.com/watch?v=yCd7-aGY6CQ.</p><p>PG2 combines advanced graph-layout algorithms with an interactive visualization platform. It allows researchers to explore genomic paths, identify variations, and examine relationships between different parts of a pangenome graph more easily.</p><p>This is important because visualization can play a major role in bioinformatics. When complex genomic information is presented clearly, researchers can more easily identify patterns, understand genetic variation, and generate new biological insights.</p><p>The development of PG2 represents a step toward making pangenome analysis more accessible and intuitive. As genomic datasets continue to grow and graph-based representations become more common, tools like PG2 can help researchers navigate this increasing complexity.</p><p>Ultimately, PG2 demonstrates how combining genomics, graph algorithms, and interactive visualization can make sophisticated biological data easier to understand and analyze.</p><p>Reference: Solun, G. K., Dogrusoz, U., Bing&ouml;l, Z., &amp; Alkan, C. (2026). PG2: algorithms and a web-based tool for effective layout and visual analysis of pangenome graphs. BMC Bioinformatics. DOI: 10.1186/s12859-026-06555-4.</p>]]></description>
	<dc:creator>Jitendra Narayan</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/23283/ra-bioinformatics-at-iisr</guid>
  <pubDate>Mon, 13 Jul 2015 02:12:10 -0500</pubDate>
  <link></link>
  <title><![CDATA[RA Bioinformatics at IISR]]></title>
  <description><![CDATA[
<p>Bioinformatics Research Associate at Indian Institute of Spice Research</p>

<p>Pay Scale: Rs. 40,000/-per month +HRA (as admissible) for Ph.D. holders and Rs. 38,000/-p.m. + HRA (as admissible) for Master degree holder</p>

<p>Qualifications: a)Essential :</p>

<p>Ph.D.in Biotechnology/ Molecular B iology/ Genetics &amp; Plant Breeding/ Bioinformatics ( Should have the degree in life sciences at gra duate level) OR Post - Graduation in Biotechnology/ Molecular Biology/ Bioinformati cs/Genetics &amp; Plant Breeding</p>

<p>or equivalent with at least two years of research experience and 60% marks. ( should have a degree in life sciences at graduate level)</p>

<p>b) Desirable :</p>

<p>1. Working experience in plant molecular biology</p>

<p>2. Knowledge of Computational Genomics/Proteomics/ Bioinformatics</p>

<p>3. Working knowledge on Computer programming</p>

<p>Walk-in Interview will be held at The Indian Institute of Spices Research, Marikunnu P.O., Kozikode-673012, Kerala on 28/7/2015 at 10.00 AM.</p>

<p>For more details: http://www.spices.res.in/pdf/Mining%20and%20Validation%20Website.pdf</p>
]]></description>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/23403/bioinformatics-project-assistant-at-vector-control-research-centre-vcrc-puducherry</guid>
  <pubDate>Sun, 19 Jul 2015 19:22:07 -0500</pubDate>
  <link></link>
  <title><![CDATA[Bioinformatics Project Assistant at Vector Control Research Centre (VCRC), Puducherry.]]></title>
  <description><![CDATA[
<p>Applications are invited upto 27.07.2015 for filling up of one post of Project Assistant (UNRESERVED) to work under ICMR funded Non-Institutional adhoc project entitled “Biomedical Informatics centre’s of ICMR” at Vector Control Research Centre (VCRC), Puducherry.</p>

<p>Desirable qualification: M.Sc (Life Sciences) with Bioinformatics knowledge and hands on molecular biology tools.</p>

<p>Age: Not exceeding 30 years on the last date of receipt of application</p>

<p>Job work: Molecular modelling studies, Database curation, Metagenomic studies on Dengue virus</p>

<p>Advertisement: http://vcrc.res.in/writereaddata/BIPrj15.pdf</p>
]]></description>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/23496/bioinformatics-scientist-at-nin</guid>
  <pubDate>Sat, 25 Jul 2015 22:07:49 -0500</pubDate>
  <link></link>
  <title><![CDATA[Bioinformatics Scientist at NIN]]></title>
  <description><![CDATA[
<p>No.NIN/PERS/Sch-88/2015-16/</p>

<p>WALK-IN-INTERVIEW (EMPLOYMENT NOTIFICATION)</p>

<p>Eligible candidates are invited to apply for the following post on the ad hoc research project entitled “Biomedical Informatics Centre’s of ICMR” - funded by ICMR at this Institute. The Applications will be received from the individuals on 31st July, 2015 between 9:30 A.M. and 10:30 A.M. at Conference Hall, NIN, Tarnaka, Hyderabad.</p>

<p>Late applications will not be entertained after 10:30 A.M. at any circumstances.</p>

<p>The Candidates may download the Application Form from NIN website: www.ninindia.org</p>

<p>Selection Procedure: Written test and Interview will be conducted to the eligible candidates, if the large numbers of candidates are found to be eligible in the screening. If the lesser number of candidates are found to be eligible in the screening, interview will be conducted only to the short listed candidates for final selection. The names of the shortlisted candidates will be displayed on the Notice Board, which is kept in front of the Conference Hall by 11:30 A.M.</p>

<p>Date of Written Test / Interview: 31st July, 2015. The essential qualification, experience, consolidated Pay and service tenure are as under:</p>

<p>1. Scientist-II (no. of vacancies -1 No.) (UR)</p>

<p>Essential Qualifications :</p>

<p>(i) First Class Master’s Degree in Bio-informatics/ Life Sciences form a recognized University with 4 years R&amp;D experience in the biomedical informatics subject. (or)</p>

<p>(ii) 2nd Class M.Sc./ M.Tech. in Bio-informatics + Ph.D. in the relevant subject from recognized University with 4 years research experience in the biomedical informatics subject. </p>

<p>Age limit : Not exceeding 40 years. Cons.</p>

<p>Pay : Rs.45,954/- p.m. plus 30% HRA p.m. (fixed) without any other allowances.</p>

<p>Tenure : Initially upto 29th February, 2016 and extendable for three more years based on the performance of the candidate and funds position.</p>

<p>Note: Age relaxation will be given to the deserving Candidates. The short listed candidates should bring all original certificates of educational qualification (from SSC onwards), experience, SC/ST/OBC Community Certificate / PH Certificates along with a pass port size photograph and set of Photo copies duly attested for attending the Written Test/Interview. The persons belonging to Other Backward Category should bring the latest O.B.C. (Non-creamy layer) Certificate issued by the respective Tahsildar/ MRO specifically issued for the purpose of applying for Central Government Post. No TA/DA will be paid for attending the Written Test /Interview.</p>

<p>GENERAL CONDITIONS: The conditions of employment will be the same as are for the project staff on contract basis. The candidates have no right to claim for any regular employment at this Institute. The Director In-charge &amp; Appointing Authority has the right to accept / reject any application without assigning any reason/s and no correspondence in this matter will be entertained. </p>

<p>More at http://ninindia.org/31July2015.pdf</p>
]]></description>
</item>

</channel>
</rss>