<?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/27696?offset=490</link>
	<atom:link href="https://bioinformaticsonline.com/related/27696?offset=490" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	
<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/researchlabs/view/22414/x-shirley-liu-lab</guid>
  <pubDate>Tue, 26 May 2015 17:28:23 -0500</pubDate>
  <link></link>
  <title><![CDATA[X. Shirley Liu Lab]]></title>
  <description><![CDATA[
<p>The research in our laboratories are focused on the following three areas: </p>

<p>Bioinformatics<br />Cancer<br />Epigenetics</p>

<p>More at http://liulab.dfci.harvard.edu/</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/39689/msaprobs-parallel-and-accurate-multiple-sequence-alignment</guid>
	<pubDate>Tue, 09 Jul 2019 23:58:44 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/39689/msaprobs-parallel-and-accurate-multiple-sequence-alignment</link>
	<title><![CDATA[MSAProbs - Parallel and accurate multiple sequence alignment]]></title>
	<description><![CDATA[<p><strong>MSAProbs</strong><span>&nbsp;is a well-established state-of-the-art multiple sequence alignment algorithm for protein sequences. The design of MSAProbs is based on a combination of pair hidden Markov models and partition functions to calculate posterior probabilities. Assessed using the popular benchmarks: BAliBASE, PREFAB, SABmark and OXBENCH, MSAProbs achieves statistically significant accuracy improvements over the existing top performing aligners, including ClustalW, MAFFT, MUSCLE, ProbCons and Probalign. In addition, MSAProbs is optimized for shared-memory CPUs by employing a multi-threaded design, and further parallelized for distributed-memory systems using MPI to overcome high memory overhead barrier and achieve good parallel and data-size scalability.</span></p><p>Address of the bookmark: <a href="http://msaprobs.sourceforge.net/homepage.htm#latest" rel="nofollow">http://msaprobs.sourceforge.net/homepage.htm#latest</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/22436/ra-bioinformatics-at-national-bureau-of-animal-genetic-resources</guid>
  <pubDate>Thu, 28 May 2015 19:25:33 -0500</pubDate>
  <link></link>
  <title><![CDATA[RA Bioinformatics at NATIONAL BUREAU OF ANIMAL GENETIC RESOURCES]]></title>
  <description><![CDATA[
<p>NATIONAL BUREAU OF ANIMAL GENETIC RESOURCES</p>

<p>Near Basant Vihar G.T. Road Bypass P.O. Box No.129</p>

<p>Karnal - 132001 (Haryana)</p>

<p>WALK-IN-INTERVIEW</p>

<p>A walk-in-Interview is proposed to be held at National Bureau of Animal Genetic Resources, Karnal (Haryana)-132001 at 10:30 AM on 10.06.2015 to select One Research Associate as per details given below:</p>

<p>1. One post of Research Associate under National Fellow project entitled “Genome data mining to unravel molecular basis of thermotolerance and adaptation to diverse environments in native cattle and buffaloes”.</p>

<p>The post duration is Upto 22.05.2016 or earlier &amp; Co-terminus with the project.</p>

<p>Essential Qualifications: Master’s degree (M.Sc. / M.V.Sc.) in Biotechnology/ Animal Genetics and Breeding/ Life Sciences/ Bioinformatics with 2 Years research experience in relevant subject or Ph.D in any of the above subjects.</p>

<p>Desirable: Working Experience in molecular biology, gene expression/ microarray data analysis, SNP genotyping and sequence data analysis, mammalian cell-culture handling etc.</p>

<p>Emolument: Rs. 23,000/- per month + HRA as per admissibility</p>

<p>Research Associate: ONE</p>

<p>Duration of engagement: Upto 22.05.2016 or earlier Co-terminus with the project</p>

<p>Age Limit:  40 years for Men  45 years for women as on date of interview</p>

<p>Note: Relaxation in age will be admissible for SC/ST &amp; OBC candidates as per Govt. of India /ICAR norms</p>

<p>1. The applicants must bring with them original documents and brief of research work done during post graduation along with a set of photocopy and latest two passport size photographs. 2. A panel of selected candidates will also be made which may be utilized for filling of positions of shorter durations in future if demand arises. 3. Experience certificate in original, if any 4. The above positions are purely on temporary basis and are coterminus with the project. No TA/DA will be paid to attend the interview. 5. Any other clarifications can be had on the date of interview. 6. The Director’s decision will be final and binding on all respects.</p>

<p>Advertisement: http://210.212.93.85/RAadvertisiment.pdf</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/40217/shouji-a-fast-and-efficient-pre-alignment-filter-for-sequence-alignment</guid>
	<pubDate>Mon, 04 Nov 2019 07:09:45 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/40217/shouji-a-fast-and-efficient-pre-alignment-filter-for-sequence-alignment</link>
	<title><![CDATA[Shouji: a fast and efficient pre-alignment filter for sequence alignment]]></title>
	<description><![CDATA[<p>The ability to generate massive amounts of sequencing data continues to overwhelm the processing capacity of existing algorithms and compute infrastructures. In this work, we explore the use of hardware/software co-design and hardware acceleration to significantly reduce the execution time of short sequence alignment, a crucial step in analyzing sequenced genomes.</p>
<p>&nbsp;<img src="https://github.com/BilkentCompGen/Shoji/raw/master/Figure1-GitHub.png" alt="image" style="border: 0px;"></p>
<p>We introduce Shouji, a highly parallel and accurate pre-alignment filter that remarkably reduces the need for computationally-costly dynamic programming algorithms. The first key idea of our proposed pre-alignment filter is to provide high filtering accuracy by correctly detecting all common subsequences shared between two given sequences. The second key idea is to design a hardware accelerator design that adopts modern FPGA (field-programmable gate array) architectures to further boost the performance of our algorithm.</p>
<p>More at <a href="https://github.com/CMU-SAFARI/Shouji">https://github.com/CMU-SAFARI/Shouji</a></p><p>Address of the bookmark: <a href="https://github.com/CMU-SAFARI/Shouji" rel="nofollow">https://github.com/CMU-SAFARI/Shouji</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/22615/jrf-position-%E2%80%93-bioinformatics-department-aravind-medical-research-foundation-amrf-madurai</guid>
  <pubDate>Fri, 12 Jun 2015 05:42:12 -0500</pubDate>
  <link></link>
  <title><![CDATA[JRF Position – Bioinformatics Department, Aravind Medical Research Foundation (AMRF), Madurai.]]></title>
  <description><![CDATA[
<p>Applications are invited from eligible candidates for the post of Junior Research Fellow (JRF) to work at the Department of Bioinformatics, Aravind Medical Research Foundation in the following DST-SERB funded project “Clinical exome analysis pipeline for eye disease next-generation sequencing panel”.</p>

<p>Post: Junior Research Fellow (1 Position)</p>

<p>Duration: Three years</p>

<p>Qualification: First class in M.Sc/M.tech in Bioinformatics/Life Sciences/Biophysics/ Biostatistics/Bioengineering. Experience in Database development, NGS data analysis, Systems Biology and Structural Bioinformatics is desired. Preference will be given to the candidates with good computer programming skills in C, C++, R, Perl, PHP, Unix Scripting etc.</p>

<p>Selected candidates will be paid fellowship as per existing DST norms.</p>

<p>How to apply:</p>

<p>Candidates are requested to apply through one of the two modes given below<br />1. Online application – Click here to submit the online application https://docs.google.com/forms/d/16h2GLnQ-Ny-tLtlgfY3Bx3sCjeHJE30cfhJaDqW_uRs/viewform?c=0&amp;w=1<br />2. Application forms can be downloaded from here.https://docs.google.com/file/d/0BwwJEudQStxFWXdNWXl4NWtDaWc/edit<br /> Filled in application form should be sent by post to Dr. D. Bharanidharan, Department of Bioinformatics, Aravind Medical Research Foundation No 1, Anna Nagar Madurai – 625 020,</p>

<p>Candidates should apply by online or submit their applications by post on or before 15th June, 2015. Only Short listed candidates will be called for an interview. No TA/DA will be paid.</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/41033/clark-fast-accurate-and-versatile-sequence-classification-system</guid>
	<pubDate>Sat, 15 Feb 2020 01:49:01 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/41033/clark-fast-accurate-and-versatile-sequence-classification-system</link>
	<title><![CDATA[CLARK: Fast, accurate and versatile sequence classification system]]></title>
	<description><![CDATA[<p><span></span><a href="http://dx.doi.org/10.1186/s12864-015-1419-2"><strong>CLARK</strong></a><span>, a method based on a supervised sequence classification using discriminative&nbsp;</span><em>k</em><span>-mers. Considering two distinct specific classification problems (see the article for details), namely (1) the taxonomic classification of metagenomic reads to known bacterial genomes, and (2) the assignment of BAC clones and transcript to chromosome arms/centromeres (in the absence of a finished assembly for the reference genome), CLARK outperforms in classification speed and precision the best state-of-the-art methods.</span></p>
<p><span><a href="http://clark.cs.ucr.edu/Spaced/">http://clark.cs.ucr.edu/Spaced/</a></span></p><p>Address of the bookmark: <a href="http://clark.cs.ucr.edu/Spaced/" rel="nofollow">http://clark.cs.ucr.edu/Spaced/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/pages/view/22571/pattern-matching-problem-solution-with-perl</guid>
	<pubDate>Tue, 09 Jun 2015 23:58:45 -0500</pubDate>
	<link>https://bioinformaticsonline.com/pages/view/22571/pattern-matching-problem-solution-with-perl</link>
	<title><![CDATA[Pattern Matching Problem Solution with Perl]]></title>
	<description><![CDATA[<p>Problem at http://rosalind.info/problems/1c/</p><p>#Find all occurrences of a pattern in a string.<br />#Given: Strings Pattern and Genome.<br />#Return: All starting positions in Genome where Pattern appears as a substring. Use 0-based indexing.<br /><br />use strict;<br />use warnings;<br /><br />my $string="GATATATGCATATACTT";<br />my $subStr="ATAT";<br />my $kmer=length($subStr);<br /><br />kmerMatch ($string, $subStr, $kmer);<br /><br />sub kmerMatch { #Check the exact matching kmers with sliding window<br />my ($string, $myStr, $kmer)=@_;<br />for (my $aa=0; $aa&lt;=(length($string)-$kmer); $aa++) {<br />&nbsp;&nbsp;&nbsp; my $myWin=substr&nbsp; $string, $aa,$kmer;<br />&nbsp;&nbsp;&nbsp; if ($myWin eq $myStr) {<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; #print "$myWin eq $myStr\n";<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; print $aa;<br />&nbsp;&nbsp;&nbsp; }<br />}<br />}</p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/42160/vicuna-a-software-tool-that-enables-consensus-assembly-of-ultra-deep-sequence-derived-from-diverse-viral-or-other-heterogeneous-populations</guid>
	<pubDate>Tue, 25 Aug 2020 03:40:17 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/42160/vicuna-a-software-tool-that-enables-consensus-assembly-of-ultra-deep-sequence-derived-from-diverse-viral-or-other-heterogeneous-populations</link>
	<title><![CDATA[VICUNA: a software tool that enables consensus assembly of ultra-deep sequence derived from diverse viral or other heterogeneous populations.]]></title>
	<description><![CDATA[<p><span>VICUNA</span><span>&nbsp;is a&nbsp;</span><em>de novo</em><span>&nbsp;assembly program targeting populations with high mutation rates. It creates a single linear representation of the mixed population on which intra-host variants can be mapped. For clinical samples rich in contamination (e.g., &gt;95%), VICUNA can leverage existing genomes, if available, to assemble only target-alike reads. After initial assembly, it can also use existing genomes to perform guided merging of contigs. For each data set (e.g., Illumina paired read, 454), VICUNA outputs consensus sequence(s) and the corresponding multiple sequence alignment of constituent reads. VICUNA efficiently handles ultra-deep sequence data with tens of thousands fold coverage.</span></p>
<p><a href="http://software.broadinstitute.org/viral/docs/vicuna_v1.0.pdf">http://software.broadinstitute.org/viral/docs/vicuna_v1.0.pdf</a></p><p>Address of the bookmark: <a href="https://www.broadinstitute.org/viral-genomics/vicuna" rel="nofollow">https://www.broadinstitute.org/viral-genomics/vicuna</a></p>]]></description>
	<dc:creator>biogeek</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/news/view/22769/ensembl-27</guid>
	<pubDate>Tue, 16 Jun 2015 16:10:36 -0500</pubDate>
	<link>https://bioinformaticsonline.com/news/view/22769/ensembl-27</link>
	<title><![CDATA[Ensembl 27]]></title>
	<description><![CDATA[<h3>What is new?</h3><ul>
<li>Expansion of Protists and Fungi with hundreds of annotated genomes</li>
<li>Variation data for bread wheat, rice, <em>Aedes aegypti</em>, and <em>Ixodes scapularis</em></li>
<li>Whole genome alignments for <em>O. longistaminata</em> and <em>T. cacao</em></li>
<li>Non-coding RNA gene models in <a href="http://bacteria.ensembl.org">Bacteria</a></li>
<li>New assembly of tomato (version 2.50)</li>
<li>Full support for UCSC Track Hub format for hosting your own data in Ensembl</li>
</ul><p>More at http://www.ensembl.info/blog/2015/06/16/ensembl-genomes-release-27-is-out/</p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/44529/contigextender-a-new-approach-to-improving-de-novo-sequence-assembly-for-viral-metagenomics-data</guid>
	<pubDate>Wed, 08 May 2024 07:32:45 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/44529/contigextender-a-new-approach-to-improving-de-novo-sequence-assembly-for-viral-metagenomics-data</link>
	<title><![CDATA[ContigExtender: a new approach to improving de novo sequence assembly for viral metagenomics data]]></title>
	<description><![CDATA[<p dir="auto">ContigExtender, was developed to extend contigs, complementing de novo assembly. ContigExtender employs a novel recursive Overlap Layout Candidates (r-OLC) strategy that explores multiple extending paths to achieve longer and highly accurate contigs. ContigExtender is effective for extending contigs significantly in in silico synthesized and real metagenomics datasets.</p>
<p dir="auto">More at&nbsp;https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7953547/</p>
<p dir="auto"><a href="https://camo.githubusercontent.com/72dc78177cd84dd0c667a2922a9fd984fb548b5ec94b11f9a547211a4adba3b1/68747470733a2f2f692e696d6775722e636f6d2f7734516944496a2e706e67" target="_blank"><img src="https://camo.githubusercontent.com/72dc78177cd84dd0c667a2922a9fd984fb548b5ec94b11f9a547211a4adba3b1/68747470733a2f2f692e696d6775722e636f6d2f7734516944496a2e706e67" alt="extension process" title="extension process" style="border: 0px;"></a></p><p>Address of the bookmark: <a href="https://github.com/dengzac/contig-extender" rel="nofollow">https://github.com/dengzac/contig-extender</a></p>]]></description>
	<dc:creator>LEGE</dc:creator>
</item>

</channel>
</rss>