<?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/30111?offset=1080</link>
	<atom:link href="https://bioinformaticsonline.com/related/30111?offset=1080" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	
<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/25674/post-doc-position-at-labgem-evry-france</guid>
  <pubDate>Fri, 11 Dec 2015 06:24:00 -0600</pubDate>
  <link></link>
  <title><![CDATA[Post-doc position at LABGeM - Evry, France]]></title>
  <description><![CDATA[
<p>The LABGeM team (CEA/Genoscope, CNRS UMR 8030, France, Dir. Claudine Médigue) is developing integrated approaches which combines bioinformatics methods based (i) on genomic and metabolic contexts, (ii) on an orignal metabolic network representation and (iii) on a structural classification of active sites for the discovery of new metabolic enzymatic activities.</p>

<p>We are hiring a post-doctoral fellow for the development of innovative bioinformatics methods to explore metabolic networks and enzyme families. These methods will be based on protein family analysis and graph approaches combining genomic and metabolic contexts.</p>

<p>For more details, please see this link : http://goo.gl/tHQOqk</p>

<p>Qualifications:<br />PhD degree in bioinformatics or computational biology<br />- Previous experience in network or protein family analysis<br />- Programming skills (C/C++, Python, Java) and in common biostatistical analyses<br />- Team player, innovative and creative thinking, good oral and written communication skills</p>

<p>24 months, Post Doctoral position<br />Start: from March 2016<br />Place: CEA, Genoscope UMR8030, LABGeM (Laboratory of Bioinformatics Analyses for Genomics and Metabolism), Evry, France<br />Contact: David Vallenet, vallenet@genoscope.cns.fr<br />Publications: https://scholar.google.com/citations?user=rJNPLSAAAAAJ<br />Remuneration per month: from 2,850 €</p>

<p>Interested candidates should send their CV, statement of research interests, and contact information of at least 2 references to David Vallenet (vallenet@genoscope.cns.fr).</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/bookmarks/view/26559/microscope</guid>
	<pubDate>Fri, 04 Mar 2016 05:26:31 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/26559/microscope</link>
	<title><![CDATA[Microscope]]></title>
	<description><![CDATA[<p>Microscope Platform user documentation.</p>
<p>The MicroScope platform is available at this URL:</p>
<p><a href="https://www.genoscope.cns.fr/agc/microscope">https://www.genoscope.cns.fr/agc/microscope</a></p><p>Address of the bookmark: <a href="http://microscope.readthedocs.org/en/latest/index.html" rel="nofollow">http://microscope.readthedocs.org/en/latest/index.html</a></p>]]></description>
	<dc:creator>Jitendra Narayan</dc:creator>
</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/26500/postdoc-at-iiser-tvm</guid>
  <pubDate>Fri, 26 Feb 2016 03:53:05 -0600</pubDate>
  <link></link>
  <title><![CDATA[PostDoc at IISER -TVM]]></title>
  <description><![CDATA[
<p>Postdoctoral Fellowship/ Research Associateship</p>

<p>Eligibility : M Phil / Phd</p>

<p>Location : Thiruvananthapuram</p>

<p>Last Date : 30 Apr 2016</p>

<p>Hiring Process : Face to Face Interview<br />IISER -TVM </p>

<p>The Postdoctoral Fellowship/Research Associateship is a full-time, contractual position for highly qualified young scientists to carry out research at CCMS, IISER-TVM.</p>

<p>Research areas at the Centre</p>

<p>Quantum Chemistry/ Computational Fluid Dynamics/Condensed Matter Physics (Theory)/Genomics/Genetics/Gravitational Waves</p>

<p>Qualifications: PhD in Bioinformatics / Biophysics / Physics / Astrophysics / Chemistry / Mathematics / Engineering (Mechanical/Aerospace) Those who are in the final stages of their Ph.D. thesis submission are also eligible to apply. However, those candidates must have submitted the thesis at the time of the interview.</p>

<p>Experience: Applicants should have at least three peer reviewed publications and relevant experience in the research area they are applying for.</p>

<p>No. of positions: 5</p>

<p>Age limit: 35 yrs or below. A relaxation of 5 yrs will be applicable to candidates belonging to SC/ST/OBC and women candidates</p>

<p>Salary: The Fellowship carries a remuneration of INR Rs. 5,18,000 - Rs. 5,76,000 per annum (including HRA). The postdoctoral fellowship may not be held concurrently with any other national or international fellowships. It is also not transferable to any other fellowship<br />How to apply</p>

<p>Applications should reach the Head, CCMS, IISER Thiruvananthapuram,CET Campus, Engineering College PO,Thiruvananthapuram 695016 on or before April 30, 2016 by e-mail to ccms@iisertvm.ac.in by mentioning the research area name in the subject line. </p>

<p>More at http://www.iisertvm.ac.in/openings/read_opening/150.phpx</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/opportunity/view/26221/project-assistant-at-iiser-mohali</guid>
  <pubDate>Fri, 29 Jan 2016 11:04:27 -0600</pubDate>
  <link></link>
  <title><![CDATA[Project Assistant at IISER Mohali]]></title>
  <description><![CDATA[
<p>Project Assistant Job position in Indian Institute of Science Education &amp; Research (IISER) Mohali </p>

<p>Title : In silico understanding of molecular basis of recognition, binding, and regulation of mRNA by STAR family of transcriptional regulators.</p>

<p>No. of Post : 01</p>

<p>Department : Science and Technology</p>

<p>Qualifications : M.Sc./B.Tech in computational life sciences, computational chemistry, computational natural sciences or allied areas. Working experience in MD simulations, bioinformatics, molecular modeling, and drug designing is desirable and plus</p>

<p>Emoluments : As per DST norms<br />How to apply</p>

<p>Applicants are requested to send application along with bio-data and a summary of previous projects (if any) as a PDF file with the e-mail to Dr. Monika Sharma, Email: mnsharma@iisermohali.ac.in. Last date of applications is 17:00 IST. Feb 15, 2016. Shortlisted candidates will be called for interview on Feb 22, 2016. </p>

<p>More at http://14.139.227.202/tenders/tenderinvite/index.php/iiserm-project-openings/554-applications-are-invited-to-work-as-project-assistant-in-a-dst-inspire-research-project-funded-by-department-of-science-and-technology-india</p>
]]></description>
</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/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>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/35041/seal-sequence-alignment-evaluation-suite</guid>
	<pubDate>Wed, 03 Jan 2018 05:05:46 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/35041/seal-sequence-alignment-evaluation-suite</link>
	<title><![CDATA[Seal: SEquence ALignment evaluation suite]]></title>
	<description><![CDATA[<p><span>Seal</span>&nbsp;is a comprehensive sequencing simulation and alignment tool evaluation suite. This software (implemented in Java) provides several utilities that can be used to evaluate alignment algorithms, including:</p>
<ul>
<li>Reading a pre-existing reference genome from one or more FASTA files.</li>
<li>Alternatively, generating an artificial reference genome based on input parameters (length, repeat count, repeat length, repeat variability rate).</li>
<li>Simulating reads from random locations in the genome based on input parameters of read length, coverage, sequencing error rate, and indel rate.</li>
<li>Applying alignment tools to the genome and the reads through a standardized interface.</li>
<li>Parsing the output of the alignment tool and calculating the number of reads that were correctly or incorrectly mapped.</li>
<li>Computing run times and measures of accuracy.</li>
</ul>
<p><span>Seal</span>&nbsp;has interfaces to evaluate the following software packages:</p>
<ul>
<li>Bowtie</li>
<li>BWA</li>
<li>MAQ</li>
<li>mrFAST</li>
<li>mrsFAST</li>
<li>Novoalign</li>
<li>SHRiMP</li>
<li>SOAPv2</li>
</ul><p>Address of the bookmark: <a href="http://compbio.case.edu/seal/" rel="nofollow">http://compbio.case.edu/seal/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

</channel>
</rss>