<?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/14191?offset=40</link>
	<atom:link href="https://bioinformaticsonline.com/related/14191?offset=40" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/40351/repeatmodeler2-automated-genomic-discovery-of-transposable-element-families</guid>
	<pubDate>Mon, 02 Dec 2019 06:52:29 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/40351/repeatmodeler2-automated-genomic-discovery-of-transposable-element-families</link>
	<title><![CDATA[RepeatModeler2: automated genomic discovery of transposable element families]]></title>
	<description><![CDATA[<p><span>RepeatModeler2 represents a valuable addition to the genome annotation toolkit that will enhance the identification and study of TEs in eukaryotic genome sequences. RepeatModeler2 is available as source code or a containerized package under an open license (</span><a href="https://github.com/Dfam-consortium/RepeatModeler">https://github.com/Dfam-consortium/RepeatModeler</a><span>,&nbsp;</span><a href="https://github.com/Dfam-consortium/TETools">https://github.com/Dfam-consortium/TETools</a><span>).</span></p><p>Address of the bookmark: <a href="https://github.com/Dfam-consortium/TETools" rel="nofollow">https://github.com/Dfam-consortium/TETools</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/12593/visiting-scientist-computational-genomics-two-positions</guid>
  <pubDate>Mon, 07 Jul 2014 22:53:41 -0500</pubDate>
  <link></link>
  <title><![CDATA[Visiting Scientist - Computational Genomics (two positions)]]></title>
  <description><![CDATA[
<p>Scientific/Managerial &amp; International Recruitment</p>

<p>ICRISAT seeks applications from Indian nationals Visiting Scientist-Computational Genomics (2 positions), to be part of a team of Centre of Excellence in Genomics (CEG), (www.icrisat.org/ceg) to work on legume genomics projects.  The positions will be based at ICRISAT’s Headquarters in Patancheru, Hyderabad, India.</p>

<p>ICRISAT is a non-profit, non-political organization that conducts agricultural research for development in Asia and sub-Saharan Africa with a wide array of partners throughout the world. Covering 6.5 million square kilometers of land in 55 countries, the semi-arid tropics is home to over 2 billion people, with 650 million of these are the poorest of the poor. ICRISAT and its partners help empower those living in the semi-arid tropics, especially smallholder farmers, to overcome poverty, hunger, malnutrition and a degraded environment through more efficient and profitable agriculture. ICRISAT is headquartered in Greater Hyderabad, Andhra Pradesh, India and belongs to the Consortium of Centers supported by the Consultative Group on International Agricultural Research (CGIAR).</p>

<p>The Job: Responsibilities for these positions include:</p>

<p>    Analyzing and handling large-scale next generation sequencing DNA and RNA data<br />    Data mining and development of pipelines and troubleshooting<br />    Genome diversity analysis such as SNPs, Indels, Structural Variations, population structure<br />    Genome wide association study (GWAS) related analysis- LD analysis, hapmap and trait mapping<br />    Expression analysis based on RNA-Seq data, annotation, gene ontology and metabolic pathway analysis<br />    Epigenome analysis, small RNA identification<br />    Gene family analysis, sequence level protein analysis, orthology/paralogy and molecular modelling<br />    Compiling and analysis of results, writing reports and research papers</p>

<p>The Person:  Ph.D. or MSc/MTech/PGDCA with two years research experience in Biotechnology, Computational biology, Agricultural/ Plant Biotechnology, Genetics, Molecular Biology or related discipline. Good knowledge of programming/scripting in at least two of following languages: Perl, C, C++, R, Shell Scripting and Python is plus.</p>

<p>How to apply: Please apply latest by 20 July 2014.  The application should include the name of the position applied for, a letter of motivation, a full Curriculum Vita (CV), and the names and contact information of three references that are knowledgeable of the candidate’s professional qualifications and work experience. Technical details and more information about these positions can be obtained from R.K.VARSHNEY@CGIAR.ORG. All applications will be acknowledged, however only short listed candidates will be contacted.</p>

<p>Apply here https://recruit.zoho.com/ats/Portal.na?digest=T642sgLYWZOStExJ77cPrcM*sIMGZETWw4yPxngbmHA-</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/33586/genetic-mapper-svg-genetic-map-drawer</guid>
	<pubDate>Sun, 18 Jun 2017 14:11:10 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/33586/genetic-mapper-svg-genetic-map-drawer</link>
	<title><![CDATA[Genetic-mapper: SVG Genetic Map Drawer]]></title>
	<description><![CDATA[<p><span>Genetic-mapper is a perl script able to draw publication-ready vectorial genetic maps.</span></p>
<p>Perl script for creating a publication-ready vectorial genetic/linkage map in Scalable Vector Graphics (SVG) format. The resulting file can either be submitted for publication and edited with any vectorial drawing software like&nbsp;<a href="https://inkscape.org/">Inkscape</a>&nbsp;and&nbsp;<a href="http://www.adobe.com/uk/products/illustrator.html">Abobe Illustrator(R)</a>.</p>
<p>The input file must be a text file with at least the marker name (ID), linkage group (LG) and the position (POS) separeted by tabulations. Additionally a logarithm of odds (LOD score) can be provided. Any extra parameter will be ignored.</p>
<pre><code>map.tsv

ID&lt;tab&gt;LG&lt;tab&gt;POS&lt;tab&gt;LOD
13519  12     0       0.250840894
2718   12     1.0     0.250840893
11040  12     1.6     0.252843341
...</code></pre>
<p>https://github.com/pseudogene/genetic-mapper</p><p>Address of the bookmark: <a href="https://github.com/pseudogene/genetic-mapper" rel="nofollow">https://github.com/pseudogene/genetic-mapper</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/11030/r-programming-and-jobs-website</guid>
	<pubDate>Sun, 25 May 2014 14:43:57 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/11030/r-programming-and-jobs-website</link>
	<title><![CDATA[R programming and Jobs website]]></title>
	<description><![CDATA[<p>Welcome to the R Jobs section of ProgrammingR.com. If your organization has an R employment opportunity that you would like to have posted here, submit it via the <a href="http://www.programmingr.com/contact" title="contact page">contact page</a>. Prospective employees: use the contact information provided in the position listing to apply or contact the hiring organization.</p><p>Address of the bookmark: <a href="http://www.programmingr.com/category/stype/r-job-listings/" rel="nofollow">http://www.programmingr.com/category/stype/r-job-listings/</a></p>]]></description>
	<dc:creator>Pragati Singh</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/blog/view/44773/genetic-basis-of-tail-loss-evolution</guid>
	<pubDate>Tue, 04 Mar 2025 12:12:36 -0600</pubDate>
	<link>https://bioinformaticsonline.com/blog/view/44773/genetic-basis-of-tail-loss-evolution</link>
	<title><![CDATA[Genetic basis of tail-loss evolution]]></title>
	<description><![CDATA[<p>The paper <em>"On the genetic basis of tail-loss evolution in humans and apes (https://www.nature.com/articles/s41586-024-07095-8)"</em>, published in <em>Nature</em>, investigates the genetic mechanisms that led to the loss of tails in humans and apes. The study suggests that a specific genetic mutation, involving the insertion of an <em>Alu</em> element (a type of transposable DNA sequence), played a critical role in the evolutionary transition from tailed primates to tailless hominoids.</p><h3><strong>Key Findings of the Study:</strong></h3><ol>
<li>
<p><strong>Alu Insertion and Tail Loss:</strong><br /> The researchers discovered an <em>Alu</em>-mediated genetic change in a common ancestor of modern apes and humans. This change disrupted the normal function of a gene involved in tail development, leading to the suppression of tail formation.</p>
</li>
<li>
<p><strong>Gene Disruption Mechanism:</strong><br /> The <em>Alu</em> insertion was found within a regulatory region of the <em>TBXT</em> gene (also known as <em>T</em> or <em>Brachyury</em>), which is crucial for tail development in vertebrates. This insertion likely altered the gene's expression patterns, leading to tail reduction over evolutionary time.</p>
</li>
<li>
<p><strong>Functional Evidence from Model Organisms:</strong><br /> To test their hypothesis, the researchers introduced similar genetic modifications in mice. The modified mice exhibited shortened or absent tails, supporting the idea that the identified mutation played a role in tail loss in hominoids.</p>
</li>
<li>
<p><strong>Evolutionary Implications:</strong><br /> The findings suggest that small, random genomic changes&mdash;such as transposable element insertions&mdash;can have profound effects on body morphology. This study provides evidence that mobile DNA elements (like <em>Alu</em>) can drive major evolutionary transitions.</p>
</li>
<li>
<p><strong>Relevance to Human Evolution:</strong><br /> Understanding the genetic basis of tail loss helps in reconstructing the evolutionary history of hominins (the lineage that includes humans and our extinct relatives). It also sheds light on how genetic variations contribute to anatomical diversity among primates.</p>
</li>
</ol><h3><strong>Significance of the Study:</strong></h3><p>This research highlights the role of transposable elements in shaping evolutionary traits and provides a concrete genetic explanation for a defining characteristic of humans and great apes. It also demonstrates how mutations in regulatory regions of developmental genes can lead to significant anatomical changes.</p>]]></description>
	<dc:creator>LEGE</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/pages/view/11181/perl-one-liner-for-bioinformatician</guid>
	<pubDate>Fri, 30 May 2014 05:49:07 -0500</pubDate>
	<link>https://bioinformaticsonline.com/pages/view/11181/perl-one-liner-for-bioinformatician</link>
	<title><![CDATA[Perl one-liner for bioinformatician !!!]]></title>
	<description><![CDATA[<p>With the emergence of NGS technologies, and sequencing data most of the bioinformaticians mung and wrangle around massive amounts of genomics text. There are several "standardized" file formats (FASTQ, SAM, VCF, etc.) and some tools for manipulating them (fastx toolkit, samtools, vcftools, etc.), there are still times where knowing a little bit of Perl onliner is extremely helpful.</p><p>Perl one-liners are small and awesome Perl programs that fit in a single line of code and they do one thing really well. These things include changing line spacing, numbering lines, doing calculations, converting and substituting text, deleting and printing certain lines, parsing logs, editing files in-place, doing statistics, carrying out system administration tasks, updating a bunch of files at once, and many more. Perl one-liners will make you the shell warrior. Anything that took you minutes to solve, will now take you seconds!<br /><br />perl -pe '$\="\n"'&nbsp; &nbsp;<br />#double space a file<br /><br />perl -pe '$_ .= "\n" unless /^$/' <br />#double space a file except blank lines<br /><br />perl -pe '$_.="\n"x7' <br />#7 space in a line.<br /><br />perl -ne 'print unless /^$/' <br />#remove all blank lines<br /><br />perl -lne 'print if length($_) &lt; 20' <br />#print all lines with length less than 20.<br /><br />perl -00 -pe '' <br />#If there are multiple spaces, delete all leaving one(make the file a single spaced file).<br /><br />perl -00 -pe '$_.="\n"x4' <br />#Expand single blank lines into 4 consecutive blank lines<br /><br />perl -pe '$_ = "$. $_"'<br />#Number all lines in a file<br /><br />perl -pe '$_ = ++$a." $_" if /./' <br />#Number only non-empty lines in a file<br /><br />perl -ne 'print ++$a." $_" if /./' <br />#Number and print only non-empty lines in a file<br /><br />perl -pe '$_ = ++$a." $_" if /regex/' <br />#Number only lines that match a pattern<br /><br />perl -ne 'print ++$a." $_" if /regex/' <br />#Number and print only lines that match a pattern<br /><br />perl -ne 'printf "%-5d %s", $., $_ if /regex/' <br />#Left align lines with 5 white spaces if matches a pattern (perl -ne 'printf "%-5d %s", $., $_' : for all the lines)<br /><br />perl -le 'print scalar(grep{/./}&lt;&gt;)' <br />#prints the total number of non-empty lines in a file<br /><br />perl -lne '$a++ if /regex/; END {print $a+0}' <br />#print the total number of lines that matches the pattern<br /><br />perl -alne 'print scalar @F' <br />#print the total number fields(words) in each line.<br /><br />perl -alne '$t += @F; END { print $t}' <br />#Find total number of words in the file<br /><br />perl -alne 'map { /regex/ &amp;&amp; $t++ } @F; END { print $t }' <br />#find total number of fields that match the pattern<br /><br />perl -lne '/regex/ &amp;&amp; $t++; END { print $t }' <br />#Find total number of lines that match a pattern<br /><br />perl -le '$n = 20; $m = 35; ($m,$n) = ($n,$m%$n) while $n; print $m' <br />#will calculate the GCD of two numbers.<br /><br />perl -le '$a = $n = 20; $b = $m = 35; ($m,$n) = ($n,$m%$n) while $n; print $a*$b/$m' <br />#will calculate lcd of 20 and 35.<br /><br />perl -le '$n=10; $min=5; $max=15; $, = " "; print map { int(rand($max-$min))+$min } 1..$n' <br />#Generates 10 random numbers between 5 and 15.<br /><br />perl -le 'print map { ("a".."z",&rdquo;0&rdquo;..&rdquo;9&rdquo;)[rand 36] } 1..8'<br />#Generates a 8 character password from a to z and number 0 &ndash; 9.<br /><br />perl -le 'print map { ("a",&rdquo;t&rdquo;,&rdquo;g&rdquo;,&rdquo;c&rdquo;)[rand 4] } 1..20'<br />#Generates a 20 nucleotide long random residue.<br /><br />perl -le 'print "a"x50'<br />#generate a string of &lsquo;x&rsquo; 50 character long<br /><br />perl -le 'print join ", ", map { ord } split //, "hello world"'<br />#Will print the ascii value of the string hello world.<br /><br />perl -le '@ascii = (99, 111, 100, 105, 110, 103); print pack("C*", @ascii)'<br />#converts ascii values into character strings.<br /><br />perl -le '@odd = grep {$_ % 2 == 1} 1..100; print "@odd"'<br />#Generates an array of odd numbers.<br /><br />perl -le '@even = grep {$_ % 2 == 0} 1..100; print "@even"'<br />#Generate an array of even numbers<br /><br />perl -lpe 'y/A-Za-z/N-ZA-Mn-za-m/' file <br />#Convert the entire file into 13 characters offset(ROT13)<br /><br />perl -nle 'print uc' <br />#Convert all text to uppercase:<br /><br />perl -nle 'print lc' <br />#Convert text to lowercase:<br /><br />perl -nle 'print ucfirst lc' <br />#Convert only first letter of first word to uppercas<br /><br />perl -ple 'y/A-Za-z/a-zA-Z/' <br />#Convert upper case to lower case and vice versa<br /><br />perl -ple 's/(\w+)/\u$1/g' <br />#Camel Casing<br /><br />perl -pe 's|\n|\r\n|' <br />#Convert unix new lines into DOS new lines:<br /><br />perl -pe 's|\r\n|\n|' <br />#Convert DOS newlines into unix new line<br /><br />perl -pe 's|\n|\r|' <br />#Convert unix newlines into MAC newlines:<br /><br />perl -pe '/regexp/ &amp;&amp; s/foo/bar/' <br />#Substitute a foo with a bar in a line with a regexp.</p><p>Reference/Sources:</p><p>http://genomics-array.blogspot.in/2010/11/some-unixperl-oneliners-for.html</p><p><a href="http://genomespot.blogspot.com/2013/08/a-selection-of-useful-bash-one-liners.html">http://genomespot.blogspot.com/2013/08/a-selection-of-useful-bash-one-liners.html</a></p><p><a href="http://biowize.wordpress.com/2012/06/15/command-line-magic-for-your-gene-annotations/">http://biowize.wordpress.com/2012/06/15/command-line-magic-for-your-gene-annotations/</a></p><p><a href="http://genomics-array.blogspot.com/2010/11/some-unixperl-oneliners-for.html">http://genomics-array.blogspot.com/2010/11/some-unixperl-oneliners-for.html</a></p><p><a href="http://bioexpressblog.wordpress.com/2013/04/05/split-multi-fasta-sequence-file/">http://bioexpressblog.wordpress.com/2013/04/05/split-multi-fasta-sequence-file/</a></p>]]></description>
	<dc:creator>Abhimanyu Singh</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/videolist/watch/11311/stephen-friend-the-hunt-for-unexpected-genetic-heroes</guid>
	<pubDate>Sat, 31 May 2014 14:31:47 -0500</pubDate>
	<link>https://bioinformaticsonline.com/videolist/watch/11311/stephen-friend-the-hunt-for-unexpected-genetic-heroes</link>
	<title><![CDATA[Stephen Friend: The hunt for "unexpected genetic heroes"]]></title>
	<description><![CDATA[<iframe width="" height="" src="https://www.youtube-nocookie.com/embed/Yagdvqn2YMU" frameborder="0" allowfullscreen></iframe>What can we learn from people with the genetics to get sick — who don't? With most inherited diseases, only some family members will develop the disease, while others who carry the same genetic risks dodge it. Stephen Friend suggests we start studying those family members who stay healthy. Hear about the Resilience Project, a massive effort to collect genetic materials that may help decode inherited disorders.

TEDTalks is a daily video podcast of the best talks and performances from the TED Conference, where the world's leading thinkers and doers give the talk of their lives in 18 minutes (or less). Look for talks on Technology, Entertainment and Design -- plus science, business, global issues, the arts and much more.
Find closed captions and translated subtitles in many languages at http://www.ted.com/translate

Follow TED news on Twitter: http://www.twitter.com/tednews
Like TED on Facebook: https://www.facebook.com/TED

Subscribe to our channel: http://www.youtube.com/user/TEDtalksDirector]]></description>
	
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/26252/recombination-detection-tool</guid>
	<pubDate>Tue, 02 Feb 2016 10:11:14 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/26252/recombination-detection-tool</link>
	<title><![CDATA[Recombination detection tool]]></title>
	<description><![CDATA[<p>A program to detect recombination hotspots using population genetic data.</p>
<p>More at https://github.com/auton1/LDhot</p><p>Address of the bookmark: <a href="https://github.com/auton1/LDhot" rel="nofollow">https://github.com/auton1/LDhot</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/12896/inspire-faculty-scheme-a-component-of-%E2%80%9Cassured-opportunity-for-research-career-aorc%E2%80%9D-under-inspire</guid>
  <pubDate>Sat, 19 Jul 2014 14:59:30 -0500</pubDate>
  <link></link>
  <title><![CDATA[INSPIRE Faculty Scheme: a component of “Assured Opportunity for Research Career (AORC)” under INSPIRE.]]></title>
  <description><![CDATA[
<p>Ministry of Science and Technology, Department of Science and Technology</p>

<p>7th ADVERTISEMENT – 2014 (2)</p>

<p>INSPIRE Faculty Scheme: a component of “Assured Opportunity for Research Career (AORC)” under INSPIRE.</p>

<p>The Department of Science and Technology, Government of India, has launched the “Innovation in Science Pursuit for Inspired Research (INSPIRE)” [http://www.inspire-dst.gov.in] program in 2008.</p>

<p>The program aims to attract talent for study of science and careers with research. INSPIRE includes many components. The importance of Assured Career Opportunity in R&amp;D sector has been recognized.</p>

<p>INSPIRE Faculty Scheme opens up an “Assured Opportunity for Research Career (AORC)” for young researchers in the age group of 27-32 years. It offers a contractual research awards to young achievers and opportunity for independent research in the near term and emerge as a future leader in the long term.</p>

<p>Eligibility</p>

<p>Essential Indian citizens and people of Indian origin including NRI/PIO status with PhD (in science, mathematics, engineering, pharmacy, medicine, and agriculture related subjects) from any recognized university in the world,</p>

<p>Those who have submitted their PhD Theses and are awaiting award of the degree are also<br />eligible. However, the award will be conveyed only after confirmation of the awarding the<br />PhD degree.</p>

<p>The upper age limit as on 1st July 2014 should be 32 years for considering support for a<br />period of 5 years. However, for SC and ST candidates, upper age limit will be 35 years.</p>

<p>Publication(s) in highly reputed Journals demonstrating research potential of the candidate.</p>

<p>Desirable</p>

<p>Candidates who are within top 1% at the School Leaving Examination, IIT-JEE rank, 1st Rank Holder either in graduation or post-graduation level university examination (which are used presently for identifying INSPIRE Scholars at under-graduate level and INSPIRE Fellows for doctoral degree)</p>

<p>More at http://www.inspire-dst.gov.in/faculty_scheme.html</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/pages/view/35033/bbsplit-read-binning-tool-for-metagenomes-and-contaminated-libraries</guid>
	<pubDate>Wed, 03 Jan 2018 00:25:27 -0600</pubDate>
	<link>https://bioinformaticsonline.com/pages/view/35033/bbsplit-read-binning-tool-for-metagenomes-and-contaminated-libraries</link>
	<title><![CDATA[BBSplit: Read Binning Tool for Metagenomes and Contaminated Libraries]]></title>
	<description><![CDATA[<p>BBSplit internally uses BBMap to map reads to multiple genomes at once, and determine which genome they match best. This is different than with ordinary mapping. If a genome (say, human) contains an exact repeat somewhere, reads mapping to it will be mapped ambiguously. But if you want to determine whether reads are mouse or human, it does not matter whether they map ambiguously within human, only whether they are ambiguous between human and mouse. BBSplit tracks this additional ambiguity information and decides how to use it based on the &ldquo;ambig2&rdquo; flag. The normal use of BBSplit is like Seal, either quantifying how many reads go to each reference, or splitting the reads into multiple output files, one per reference. BBSplit can only be run using references indexed with BBSplit, as they contain additional information regarding which sequences came from which reference file.</p><p><span>BBSplit is a tool that bins reads by mapping to multiple references simultaneously, using&nbsp;</span><a href="http://seqanswers.com/forums/showthread.php?t=41057" target="_blank">BBMap</a><span>. The reads go to the bin of the reference they map to best. There are also disambiguation options, such that reads that map to multiple references can be binned with all of them, none of them, one of them, or put in a special "ambiguous" file for each of them. Paired reads will always be kept together.</span><br /><br /><span>For example, if you had a library of something that was contaminated with e.coli and salmonella, you could do this:</span><br /><br /><strong>bbsplit.sh in=reads.fq ref=ecoli.fa,salmonella.fa basename=out_%.fq outu=clean.fq int=t</strong><br /><br /><span>This will produce 3 output files:</span><br /><strong>out_ecoli.fq</strong><span>&nbsp;(ecoli reads)</span><br /><strong>out_salmonella.fq</strong><span>&nbsp;(salmonella reads)</span><br /><strong>clean.fq</strong><span>&nbsp;(unmapped reads)</span><br /><br /><span>In this case, "int=t" means that the input file is paired and interleaved. For single-end reads you would leave that out. For paired reads in 2 files, you would do this:</span><br /><strong>bbsplit.sh in1=reads1.fq in2=reads2.fq ref=ecoli.fa,salmonella.fa basename=out_%.fq outu1=clean1.fq outu2=clean2.fq</strong></p><p><strong><span>BBSplit is available here:</span><br /><a href="https://sourceforge.net/projects/bbmap/" target="_blank">https://sourceforge.net/projects/bbmap/</a></strong></p><p><span>The sensitivity can be raised to be equivalent to BBMap with these flags: "minratio=0.56 minhits=1 maxindel=16000"</span></p>]]></description>
	<dc:creator>Poonam Mahapatra</dc:creator>
</item>

</channel>
</rss>