<?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/35119?offset=10</link>
	<atom:link href="https://bioinformaticsonline.com/related/35119?offset=10" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/44481/unialigner-a-parameter-free-framework-for-fast-sequence-alignment</guid>
	<pubDate>Fri, 08 Mar 2024 23:36:12 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/44481/unialigner-a-parameter-free-framework-for-fast-sequence-alignment</link>
	<title><![CDATA[UniAligner: a parameter-free framework for fast sequence alignment]]></title>
	<description><![CDATA[<p>UniAligner (formerly, TandemAligner) is the first parameter-free algorithm for sequence alignment that introduces a sequence-dependent alignment scoring that automatically changes for any pair of compared sequences. Classical alignment approaches, such as the Smith-Waterman algorithm, that work well for most sequences, fail to construct biologically adequate alignments of extra-long tandem repeats (ETRs), such as human centromeres and immunoglobulin loci. This limitation was overlooked in the previous studies since the sequences of the centromeres and other ETRs across multiple genomes only became available recently.</p>
<p>More at https://www.nature.com/articles/s41592-023-01970-4</p><p>Address of the bookmark: <a href="https://github.com/seryrzu/unialigner" rel="nofollow">https://github.com/seryrzu/unialigner</a></p>]]></description>
	<dc:creator>Abhi</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/researchlabs/view/32629/bienko-and-crosetto-labs</guid>
  <pubDate>Fri, 12 May 2017 07:42:15 -0500</pubDate>
  <link></link>
  <title><![CDATA[Bienko and Crosetto Labs]]></title>
  <description><![CDATA[
<p>We are two groups of scientists doing frontier research in quantitative biology and biomedicine. The Bienko group is interested in exploring the fundamental design principles controlling how DNA is packed in the eukaryotic nucleus and its relation to gene expression regulation. The Crosetto group engineers new molecular methods for single-cell and spatially resolved omic measurements of DNA, RNA, and proteins, with a strong focus on tumor heterogeneity. By sharing ideas and resources, we work synergistically towards a more quantitative understanding of life’s processes in healthy and diseased conditions.</p>

<p>https://bienkocrosettolabs.org/</p>
]]></description>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/42588/postdoc-in-genomics-of-pipefishes-and-seahorses-at-nsf-funded-postdoctoral-project-in-adam-jones-lab</guid>
  <pubDate>Thu, 07 Jan 2021 21:22:24 -0600</pubDate>
  <link></link>
  <title><![CDATA[Postdoc in Genomics of Pipefishes and Seahorses at NSF-funded postdoctoral project in Adam Jones' Lab]]></title>
  <description><![CDATA[
<p>An NSF-funded postdoctoral position is available in Adam Jones' Lab<br />at the University of Idaho to study the evolution and development of<br />the male's brood pouch in syngnathid fishes (seahorses, pipefishes<br />and seadragons). The project is being conducted in collaboration<br />with Dr. William Cresko's group at the University of Oregon. The<br />postdoc will be involved in studies of comparative genomics across<br />the family Syngnathidae, investigations of brood pouch morphology, and<br />characterization of the brood pouch microbiome. The position will be<br />funded for two years, with the possibility of a third year. The postdoc<br />will be based at the University of Idaho and will interact extensively<br />with the Cresko Lab at the University of Oregon.</p>

<p>The University of Idaho is in Moscow, a small college town located in<br />Northern Idaho on the Washington border. Moscow is widely considered to<br />be a great place to live, and it's known for a pleasant downtown, active<br />farmer's market, and nearby recreational opportunities. All of Moscow<br />is within biking or walking distance of the University of Idaho. For<br />more information about Moscow, see https://visitmoscowid.com/.</p>

<p>The University of Idaho has very strong faculty in evolution and<br />genomics in multiple departments and interdisciplinary programs. Of<br />particular note are the Bioinformatics and Computational Biology<br />Program (BCB: https://www.uidaho.edu/sci/bcb/people/faculty) and<br />the Institute for Bioinformatics and Evolutionary Studies (IBEST:<br />https://www.ibest.uidaho.edu/index.php). In addition, the University of<br />Idaho is only eight miles from Washington State University in Pullman, and<br />faculty from the two institutions interact and collaborate extensively.</p>

<p>Minimum qualifications include: a Ph.D. in biological sciences,<br />bioinformatics, or a related discipline; experience conducting research<br />in genomics or evolutionary biology, as evidenced by publications<br />in peer-reviewed journals; and evidence of strong written and oral<br />communication skills.  Experience analyzing next-generation sequence<br />data and familiarity with the genomics of marine fishes are desirable<br />but not required.</p>

<p>Apply at: https://uidaho.peopleadmin.com/postings/30003</p>

<p>Review of applications will begin January 15, 2021. The start date<br />is flexible.</p>

<p>The University of Idaho is an equal opportunity/Affirmative Action/equal<br />access employer.</p>

<p>Informal inquiries are encouraged and can be directed to Adam Jones<br />(adamjones@uidaho.edu).</p>

<p>"adamjones@uidaho.edu"</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/file/view/88/regular-expression-cheat-sheet</guid>
	<pubDate>Tue, 09 Jul 2013 17:38:42 -0500</pubDate>
	<link>https://bioinformaticsonline.com/file/view/88/regular-expression-cheat-sheet</link>
	<title><![CDATA[Regular Expression Cheat Sheet]]></title>
	<description><![CDATA[<p><span>The Regular Expression are the sole of Perl language, and for bioinformatician it is just a magical stick to resolve gingatic string data. We did not find any good and user friendly regular expression cheat sheet, hence write our own cheat sheet.&nbsp;</span><span>The Regular Expressions Cheat Sheet, a quick reference guide for regular expressions, including symbols, ranges, grouping, assertions and some sample patterns to get you started.</span></p>]]></description>
	<dc:creator>Jitendra Narayan</dc:creator>
	<enclosure url="https://bioinformaticsonline.com/file/download/88" length="14944" type="application/pdf" />
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/783/perl-module-installation</guid>
	<pubDate>Fri, 12 Jul 2013 11:19:41 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/783/perl-module-installation</link>
	<title><![CDATA[Perl Module Installation]]></title>
	<description><![CDATA[<p>Nice step wide information on perl module installation.</p><p>Address of the bookmark: <a href="http://bioinformaticsonline.com/blog/view/710/how-to-install-perl-modules-manually-using-cpan-command-and-other-quick-ways" rel="nofollow">http://bioinformaticsonline.com/blog/view/710/how-to-install-perl-modules-manually-using-cpan-command-and-other-quick-ways</a></p>]]></description>
	<dc:creator>Jitendra Narayan</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/fun/view/2053/perl-poem-parse-it-in-both-perl-and-english</guid>
	<pubDate>Mon, 12 Aug 2013 19:00:55 -0500</pubDate>
	<link>https://bioinformaticsonline.com/fun/view/2053/perl-poem-parse-it-in-both-perl-and-english</link>
	<title><![CDATA[Perl Poem: Parse it in both Perl and English!]]></title>
	<description><![CDATA[<p>Larry's, er, corpus has fortunately been overshadowed by that of the reigning Perl Poet, Sharon Hopkins. She has written quite a few Perl poems, as well as a paper on Perl poetry that she presented at the Usenix Winter 1992 Technical Conference, entitled "Camels and Needles: Computer Poetry Meets the Perl Programming Language". (The paper is available as misc/<a href="http://poetry.ps/" target="_blank">poetry.ps</a>&nbsp;on CPAN.) Besides being the most prolific Perl poet, Sharon is also the most widely published, having had the following poem published in both the Economist and the Guardian:</p><p>#!/usr/bin/perl</p><p>APPEAL:</p><p>listen (please, please);</p><p>open yourself, wide;<br />join (you, me),<br />connect (us,together),</p><p>tell me.</p><p>do something if distressed;</p><p>@dawn, dance;<br />@evening, sing;<br />read (books,$poems,stories) until peaceful;<br />study if able;</p><p>write me if-you-please;</p><p>sort your feelings, reset goals, seek (friends, family, anyone);</p><p>do*not*die (like this)<br />if sin abounds;</p><p>keys (hidden), open (locks, doors), tell secrets;<br />do not, I-beg-you, close them, yet.</p><p>accept (yourself, changes),<br />bind (grief, despair);</p><p>require truth, goodness if-you-will, each moment;</p><p>select (always), length(of-days)</p><p># listen (a perl poem)<br /># Sharon Hopkins<br /># rev. June 19, 1995</p>]]></description>
	<dc:creator>Rahul Agarwal</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/videolist/watch/4193/bioinformatics-101-running-blast</guid>
	<pubDate>Tue, 03 Sep 2013 14:59:50 -0500</pubDate>
	<link>https://bioinformaticsonline.com/videolist/watch/4193/bioinformatics-101-running-blast</link>
	<title><![CDATA[Bioinformatics 101 -  Running BLAST]]></title>
	<description><![CDATA[<iframe width="" height="" src="https://www.youtube-nocookie.com/embed/CYnjROfGXv8" frameborder="0" allowfullscreen></iframe>How to format the database for BLAST, run the command, view the output file, and use BioPerl and Perl to parse the output. By David Francis, Ohio State University. Delivered live at the Tomato Disease Workshop 2010. For more information, please visit http://www.extension.org/pages/32521/bioinformatics-101-video.]]></description>
	
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/20471/bioinformatics-scripts</guid>
	<pubDate>Thu, 22 Jan 2015 22:29:39 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/20471/bioinformatics-scripts</link>
	<title><![CDATA[Bioinformatics Scripts]]></title>
	<description><![CDATA[<p>Some of the useful bioinformatics scripts.</p>
<p>For example ... contig-stats.pl is a Perl script that will automatically describe features of a sequence assembly.</p>
<p>http://milkweedgenome.org/?q=scripts</p><p>Address of the bookmark: <a href="http://milkweedgenome.org/?q=scripts" rel="nofollow">http://milkweedgenome.org/?q=scripts</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/pages/view/22569/reverse-complement-problem-solved-with-perl</guid>
	<pubDate>Tue, 09 Jun 2015 23:37:23 -0500</pubDate>
	<link>https://bioinformaticsonline.com/pages/view/22569/reverse-complement-problem-solved-with-perl</link>
	<title><![CDATA[Reverse Complement Problem Solved with Perl]]></title>
	<description><![CDATA[<p>Question at http://rosalind.info/problems/1b/</p><p>#Find the reverse complement of a DNA string.<br />#Given: A DNA string Pattern.<br />#Return: Pattern, the reverse complement of Pattern.<br /><br />use strict;<br />use warnings;<br /><br />my $string="AAAACCCGGT";<br />my $finalString="";<br />my %hash = (<br />&nbsp;&nbsp; &nbsp;"C" =&gt; "G", <br />&nbsp;&nbsp; &nbsp;"A" =&gt; "T", <br />&nbsp;&nbsp; &nbsp;"T" =&gt; "A", <br />&nbsp;&nbsp; &nbsp;"G" =&gt; "C",<br />);<br /><br />for (my $aa=0; $aa&lt;=(length($string)-1); $aa++) {<br />&nbsp;&nbsp; &nbsp;my $char=substr $string, $aa, 1;<br />&nbsp;&nbsp; &nbsp;#print $hash{$char};<br />&nbsp;&nbsp; &nbsp;$finalString="$hash{$char}"."$finalString";<br />}<br /><br />print $finalString;<br />print "\n";</p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/pages/view/22572/clump-finding-problem-solved-with-perl</guid>
	<pubDate>Wed, 10 Jun 2015 00:17:17 -0500</pubDate>
	<link>https://bioinformaticsonline.com/pages/view/22572/clump-finding-problem-solved-with-perl</link>
	<title><![CDATA[Clump Finding Problem Solved with Perl]]></title>
	<description><![CDATA[<p>The question at http://rosalind.info/problems/1d/</p><p>Script are moved to&nbsp;http://bioinformaticsonline.com/snippets/view/34633/clump-finding-problem-solved-with-perl</p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

</channel>
</rss>