<?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=1190</link>
	<atom:link href="https://bioinformaticsonline.com/related/27696?offset=1190" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36974/many-to-many-pairwise-alignments-of-two-sequence-sets</guid>
	<pubDate>Tue, 19 Jun 2018 08:34:15 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36974/many-to-many-pairwise-alignments-of-two-sequence-sets</link>
	<title><![CDATA[Many-to-many pairwise alignments of two sequence sets]]></title>
	<description><![CDATA[needleall reads a set of input sequences and compares them all to one or more sequences, writing their optimal global sequence alignments to file. It uses the Needleman-Wunsch alignment algorithm to find the optimum alignment (including gaps) of two sequences along their entire length. The algorithm uses a dynamic programming method to ensure the alignment is optimum, by exploring all possible alignments and choosing the best. A scoring matrix is read that contains values for every possible residue or nucleotide match. Needleall finds the alignment with the maximum possible score where the score of an alignment is equal to the sum of the matches taken from the scoring matrix, minus penalties arising from opening and extending gaps in the aligned sequences. The substitution matrix and gap opening and extension penalties are user-specified.<p>Address of the bookmark: <a href="http://emboss.sourceforge.net/apps/release/6.6/emboss/apps/needleall.html" rel="nofollow">http://emboss.sourceforge.net/apps/release/6.6/emboss/apps/needleall.html</a></p>]]></description>
	<dc:creator>Poonam Mahapatra</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/file/view/22050/binc-sample-question-paper</guid>
	<pubDate>Thu, 16 Apr 2015 09:15:09 -0500</pubDate>
	<link>https://bioinformaticsonline.com/file/view/22050/binc-sample-question-paper</link>
	<title><![CDATA[BINC Sample Question Paper !!!]]></title>
	<description><![CDATA[<p>BINC sample question paper round THREE ...</p>]]></description>
	<dc:creator>Jitendra Narayan</dc:creator>
	<enclosure url="https://bioinformaticsonline.com/file/download/22050" length="316" type="text/plain" />
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/22130/senior-research-fellow-srf-bioinformatics-at-central-institute-for-research-on-buffaloes</guid>
  <pubDate>Sat, 18 Apr 2015 04:30:47 -0500</pubDate>
  <link></link>
  <title><![CDATA[Senior Research Fellow (SRF) Bioinformatics at Central Institute for Research on Buffaloes]]></title>
  <description><![CDATA[
<p>Senior Research Fellow (SRF) Bioinformatics at Central Institute for Research on Buffaloes<br />Address: Central Institute for Research on Buffaloes, Sirsa Road, Hisar<br />State: Haryana<br />Pay Scale: Post Graduate in subjects other than Veterinary Science Rs. 16000/- per month for 1st and 2nd year and Rs. 18000/- per month for 3rd year. Post Graduate in Veterinary Science Rs. 18000/- per month for 1st and 2nd Year and Rs. 20000/- per month for 3rd year.<br />Educational Requirements: Master’s degree in biotechnology/animal biotechnology, veterinary/animal biochemistry, veterinary microbiology or veterinary/animal physiology/Nano Technology/Bioinformatics or related area.<br />Qualifications: Ph.D in relevant field/experience of working in any research project<br />Details will be available at: http://www.cirb.res.in/attachments/195_Walk-in-Interview%20for%20Senior%20Research%20Fellow%20%28SRF%29%20%28On%20Dated%2020.4.2015%29.pdf<br />How To Apply: Interested candidates who fulfill the above conditions should report for interview with a copy of their bio-data, photocopy and original certificates and testimonials, other related material i.e. reports, documents, articles, etc., if any.<br />Date &amp; Time of Interview: 20.04.2015 at 11.00 hrs<br />Venue: CIRB, Hisar</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/22236/savitribai-phule-pune-university-recruitment-for-04-jrf-post-in-april-2015</guid>
  <pubDate>Mon, 27 Apr 2015 20:28:59 -0500</pubDate>
  <link></link>
  <title><![CDATA[Savitribai Phule Pune University Recruitment for 04 JRF Post in April 2015]]></title>
  <description><![CDATA[
<p>Savitribai Phule Pune University announced application for recruitment to the post of Junior Research Fellow. The candidates for the post can apply through prescribed format before 10 May 2015.<br />Description:</p>

<p>Important Date &amp; Details</p>

<p>Closing Date for Registration: 10 May 2015</p>

<p>Details of Post</p>

<p>Name of Post: Junior Research Fellow- 04 Posts</p>

<p>Pay Scale: Rs. 12,000 or 16,00+ HRA Post Graduate degree with NET (16,000+HRA) Post Graduate Degree (12,000+HRA)</p>

<p>Eligibility Criteria: M.Sc. in Microbiology/Marine Microbiology/ Marine Biotechnology/Biotechnology/Bioinformatics/Zoology or equivalent degree with minimum 60% marks or equivalent grade</p>

<p>Age Limit- Not more than 28 years</p>

<p>Organisation Name: Savitribai Phule Pune University<br />Eligibility for the post:</p>

<p>Selection Procedure: The selection procedure is through personal interview. No TA/DA will be paid for appearing in the interview.</p>

<p>How to Apply: The candidates may send their application along with CV to the Head Department of Zoology, Savitribai Phule University on or before 10 May 2015.</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/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/22297/appointment-of-two-traineeships-and-two-studentships-in-bioinformatics</guid>
  <pubDate>Fri, 08 May 2015 00:24:20 -0500</pubDate>
  <link></link>
  <title><![CDATA[Appointment of two traineeships and two studentships in Bioinformatics]]></title>
  <description><![CDATA[
<p>Applications are invited for the appointment of two traineeships and two studentships in Bioinformatics for a period of six months sponsored by Department of Biotechnology, Government of India in the Bioinformatics Sub-DIC, Saraswathy Thangavelu Centre, JNTBGRI, Puthenthope, Thiruvananthapuram 695 586. The required qualifications and other details are given below.</p>

<p>Position 1: Traineeship<br />Monthly fellowship (in rupee): 5,000/-<br />No. of vacancies: Two<br />Required Qualification: First Class M.Sc Bioinformatics/ Biotechnology/ Botany</p>

<p>Position 2: Studentship<br />Monthly fellowship (in rupee): 5,000/-<br />No. of vacancies: Two<br />Required Qualification: M.Phil/M.Tech Bioinformatics/ Biotechnology/ any branch of Life Science students for doing their thesis work in the area of Bioinformatics.</p>

<p>Age limit as on 1.1.2015, 28 years. Age relaxation will be provided for SC, ST, OBC candidates as per Govt. norms.</p>

<p>Interested candidates may appear for walk-in-interview on 15th May 2015 at 10.30 am at JNTBGRI, Palode, Thiruvananthapuram. The candidate should report to the Office at Palode before 10.00 am.</p>

<p>More at http://jntbgri.res.in/news/appointment-of-two-traineeships-and-two-studentships-in-bioinformatics/</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/researchlabs/view/22393/narcis-fernandez-fuentes-lab</guid>
  <pubDate>Mon, 25 May 2015 07:30:00 -0500</pubDate>
  <link></link>
  <title><![CDATA[Narcis Fernandez-Fuentes Lab]]></title>
  <description><![CDATA[
<p>Welcome to our web-site compiling all the research-related activities of the group. Our research interests relate to a number of areas within Bioinformatics. We have a long-standing interest in protein structure prediction and structure-to-function relationships. We work in the study of biomolecular interactions, modeling of protein complexes, the study and characterization of protein-protein interactions, peptide design, modeling of genetic variation, structure-based protein design and different aspects of Plant Bioinformatics. Take a look at the our databases and servers and the list of publications for more information.</p>

<p>More at http://www.bioinsilico.org/</p>
]]></description>
</item>

</channel>
</rss>