<?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/27328?offset=1200</link>
	<atom:link href="https://bioinformaticsonline.com/related/27328?offset=1200" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	
<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/10457/assistant-professor-bio-informatics-at-health-and-family-welfare-department-medical-education-in-raipur</guid>
  <pubDate>Wed, 07 May 2014 00:08:38 -0500</pubDate>
  <link></link>
  <title><![CDATA[Assistant Professor (Bio-Informatics) at Health and Family Welfare Department (Medical Education) in Raipur]]></title>
  <description><![CDATA[
<p>Advertisement No.05/2014/ Exam/Dated 17/04/2014</p>

<p>No of vacancies: 01</p>

<p>Pay scale:Rs. 15600 – 39100 + 6600/-</p>

<p>Essential Academic Qualifications / Experience : Good academic record as defined by the concerned university with at least 55% marks (or an equivalent grade in a point scale wherever grading system is followed) at the Master's Degree level in a relevant subject from an Indian University, or an equivalent degree from an accredited foreign university.</p>

<p>Besides fulfilling the above qualifications, the candidate must have cleared the National Eligibility Test (NET) conducted by the UGC, CSIR or similar test accredited by the UGC like SLET/ SET.</p>

<p>Notwithstanding anything contained in sub-clauses (a) and (b) to this Clause, candidates, who are, or have been awarded a Ph.D. Degree in accordance with the University Grants Commission (Minimum Standards and Procedure for Award of Ph.D. Degree) Regulations, 2009, shall be exempted from the requirement of the minimum eligibility condition of NET/SLET/SET for recruitment and appointment of Assistant Professor or equivalent positions in Universities/Colleges/Institutions.</p>

<p>NET/SLET/SET shall also not be required for such Masters Programmes in disciplines for which NET/SLET/SET is not conducted.</p>

<p>Apply online: http://www.psc.cg.gov.in/htm/OA_ME2014.html</p>

<p>Last Date for Online Registration: 22/05/2014</p>

<p>For more details: http://www.psc.cg.gov.in/pdf/Advertisement/ADV_ME2014.pdf</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/blog/view/43995/tools-for-sequence-translation</guid>
	<pubDate>Tue, 08 Nov 2022 03:37:58 -0600</pubDate>
	<link>https://bioinformaticsonline.com/blog/view/43995/tools-for-sequence-translation</link>
	<title><![CDATA[Tools for Sequence translation !]]></title>
	<description><![CDATA[<p><span>BOrf</span>&nbsp;-&nbsp;<a href="https://github.com/betsig/borf" target="_blank">https://github.com/betsig/borf</a></p><p><span>CodAn</span>&nbsp;-&nbsp;<a href="https://github.com/pedronachtigall/CodAn" target="_blank">https://github.com/pedronachtigall/CodAn</a></p><p><span>EMBOSS-Sixpack</span>&nbsp;-&nbsp;<a href="https://www.ebi.ac.uk/Tools/st/emboss_sixpack/" target="_blank">https://www.ebi.ac.uk/Tools/st/emboss_sixpack/</a></p><p><span>esl-translate</span>&nbsp;-&nbsp;<a href="http://hmmer.org/" target="_blank">http://hmmer.org/</a>,&nbsp;<a href="https://github.com/EddyRivasLab/easel" target="_blank">https://github.com/EddyRivasLab/easel</a></p><p><span>GeneMarkS-T</span>&nbsp;-&nbsp;<a href="http://exon.gatech.edu/GeneMark/license_download.cgi" target="_blank">http://exon.gatech.edu/GeneMark/license_download.cgi</a></p><p><span>ORFfinder</span>&nbsp;-&nbsp;<a href="https://www.ncbi.nlm.nih.gov/orffinder/" target="_blank">https://www.ncbi.nlm.nih.gov/orffinder/</a>&nbsp;(web server)</p><p><span>PLASS</span>&nbsp;-&nbsp;<a href="https://github.com/soedinglab/plass" target="_blank">https://github.com/soedinglab/plass</a></p><p><span>Prodigal</span>&nbsp;-&nbsp;<a href="https://github.com/hyattpd/Prodigal" target="_blank">https://github.com/hyattpd/Prodigal</a></p><p><span>TransDecoder</span>&nbsp;-&nbsp;<a href="https://github.com/TransDecoder/TransDecoder" target="_blank">https://github.com/TransDecoder/TransDecoder</a></p>]]></description>
	<dc:creator>Abhi</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/videolist/watch/10659/gps-dna-tracking-university-of-sheffield</guid>
	<pubDate>Sat, 10 May 2014 04:33:28 -0500</pubDate>
	<link>https://bioinformaticsonline.com/videolist/watch/10659/gps-dna-tracking-university-of-sheffield</link>
	<title><![CDATA[GPS DNA tracking - University of Sheffield]]></title>
	<description><![CDATA[<iframe width="" height="" src="https://www.youtube-nocookie.com/embed/Aap-s1kle4Q" frameborder="0" allowfullscreen></iframe>University of Sheffield geneticist and bioinformatics expert Dr Eran Elhaik demonstrates the power of his new DNA research, which allows people to discover their genetic homeland from 1000 years ago. Find out more about our biological research here http://www.sheffield.ac.uk/aps]]></description>
	
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/33223/tbl2asn-a-command-line-program-that-automates-the-creation-of-sequence-records-for-submission-to-genbank</guid>
	<pubDate>Mon, 29 May 2017 07:37:08 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/33223/tbl2asn-a-command-line-program-that-automates-the-creation-of-sequence-records-for-submission-to-genbank</link>
	<title><![CDATA[Tbl2asn: a command-line program that automates the creation of sequence records for submission to GenBank]]></title>
	<description><![CDATA[<p>Tbl2asn is a command-line program that automates the creation of sequence records for submission to GenBank. It uses many of the same functions as Sequin but is driven generally by data files. Tbl2asn generates .sqn files for submission to GenBank. Additional manual editing is not required before submission.</p>
<p>Tbl2asn is available by anonymous&nbsp;<a href="ftp://ftp.ncbi.nih.gov/toolbox/ncbi_tools/converters/by_program/tbl2asn/">FTP</a>. Copy the right version for your platform, then uncompress the file, rename it to "tbl2asn", and set the permissions, as necessary for the platform.</p>
<p>&nbsp;</p><p>Address of the bookmark: <a href="https://www.ncbi.nlm.nih.gov/genbank/tbl2asn2/" rel="nofollow">https://www.ncbi.nlm.nih.gov/genbank/tbl2asn2/</a></p>]]></description>
	<dc:creator>Poonam Mahapatra</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/pages/view/34221/alignment-free-sequence-comparison-tools-available-for-next-generation-sequencing-data-analysis</guid>
	<pubDate>Tue, 07 Nov 2017 05:33:33 -0600</pubDate>
	<link>https://bioinformaticsonline.com/pages/view/34221/alignment-free-sequence-comparison-tools-available-for-next-generation-sequencing-data-analysis</link>
	<title><![CDATA[Alignment-free sequence comparison tools available for next-generation sequencing data analysis]]></title>
	<description><![CDATA[<div><p><span>kallisto</span></p></div><div><p>Transcript abundance quantification from RNA-seq data (uses pseudoalignment for rapid determination of read compatibility with targets)</p><p>Software (C++)</p><p><a href="https://pachterlab.github.io/kallisto/">https://pachterlab.github.io/kallisto/</a></p><p>Sailfish</p><p>Estimation of isoform abundances from reference sequences and RNA-seq data (<em>k</em>-mer based)</p><p>Software (C++)</p><p><a href="http://www.cs.cmu.edu/~ckingsf/software/sailfish/">http://www.cs.cmu.edu/~ckingsf/software/sailfish/</a></p><p>Salmon</p><p>Quantification of the expression of transcripts using RNA-seq data (uses&nbsp;<em>k</em>-mers)</p><p><a href="https://combine-lab.github.io/salmon/">https://combine-lab.github.io/salmon/</a></p><p>RNA-Skim</p><p>RNA-seq quantification at transcript-level (partitions the transcriptome into disjoint transcript clusters; uses&nbsp;<em>sig</em>-mers, a special type of&nbsp;<em>k</em>-mers)</p><p>Software (C++)</p><p><a href="http://www.csbio.unc.edu/rs/">http://www.csbio.unc.edu/rs/</a></p><p>Variant calling</p><p>ChimeRScope</p><p>Fusion transcript prediction using gene&nbsp;<em>k</em>-mers profiles of the RNA-seq paired-end reads</p><p>Software (Java)</p><p><a href="https://github.com/ChimeRScope/ChimeRScope/wiki">https://github.com/ChimeRScope/ChimeRScope/wiki</a></p><p>FastGT</p><p>Genotyping of known SNV/SNP variants directly from raw NGS sequence reads by counting unique&nbsp;<em>k</em>-mers</p><p>Software (C)</p><p><a href="https://github.com/bioinfo-ut/GenomeTester4/">https://github.com/bioinfo-ut/GenomeTester4/</a></p><p>Phy-Mer</p><p>Reference-independent mitochondrial haplogroup classifier from NGS data (<em>k</em>-mer based)</p><p>Software (Python)</p><p><a href="https://github.com/danielnavarrogomez/phy-mer">https://github.com/danielnavarrogomez/phy-mer</a></p><p>LAVA</p><p>Genotyping of known SNPs (dbSNP and Affymetrix's Genome-Wide Human SNP Array) from raw NGS reads (<em>k</em>-mer based)</p><p>Software (C)</p><p><a href="http://lava.csail.mit.edu/">http://lava.csail.mit.edu/</a></p><p>MICADo</p><p>Detection of mutations in targeted third-generation NGS data (can distinguish patients&rsquo; specific mutations; algorithm uses&nbsp;<em>k</em>-mers and is based on colored de Bruijn graphs)</p><p>Software (Python)</p><p><a href="http://github.com/cbib/MICADo">http://github.com/cbib/MICADo</a></p><p>General mapper</p><p>Minimap</p><p>Lightweight and fast read mapper and read overlap detector (uses the concept of &ldquo;minimazers&rdquo;, a special type of&nbsp;<em>k</em>-mers)</p><p>Software (C)</p><p><a href="https://github.com/lh3/minimap">https://github.com/lh3/minimap</a></p><p>Assembly</p><p>De novo genome assembly</p><p>MHAP</p><p>Produces highly continuous assembly (fully resolved chromosome arms) from third-generation long and noisy reads (10 kbp) using a dimensionality reduction technique MinHash</p><p>Software (Java)</p><p><a href="https://github.com/marbl/MHAP">https://github.com/marbl/MHAP</a></p><p>Miniasm</p><p>Assembler of long noisy reads (SMRT, ONT) using the Overlap-Layout Consensus (OLC) approach without the necessity of an error correction stage (uses minimap)</p><p>Software (C)</p><p><a href="https://github.com/lh3/miniasm">https://github.com/lh3/miniasm</a></p><p>LINKS</p><p>Scaffolding genome assembly with error-containing long sequence (e.g., ONT or PacBio reads, draft genomes)</p><p>Software (Perl)</p><p><a href="https://github.com/warrenlr/LINKS/">https://github.com/warrenlr/LINKS/</a></p><p>Read clustering</p><p>afcluster</p><p>Clustering of reads from different genes and different species based on&nbsp;<em>k</em>-mer counts</p><p>Software (C++)</p><p><a href="https://github.com/luscinius/afcluster">https://github.com/luscinius/afcluster</a></p><p>QCluster</p><p>Clustering of reads with alignment-free measures (<em>k</em>-mer based) and quality values</p><p>Software (C++)</p><p><a href="http://www.dei.unipd.it/~ciompin/main/qcluster.html">http://www.dei.unipd.it/~ciompin/main/qcluster.html</a></p><p>Reads error correction</p><p>Lighter</p><p>Correction of sequencing errors in raw, whole genome sequencing reads (<em>k</em>-mer based)</p><p>Software (C++)</p><p><a href="https://github.com/mourisl/Lighter">https://github.com/mourisl/Lighter</a></p><p>QuorUM</p><p>Error corrector for Illumina reads using k-mers</p><p>Software (C++)</p><p><a href="https://github.com/gmarcais/Quorum">https://github.com/gmarcais/Quorum</a></p><p>Trowel</p><p>Software (C++)</p><p><a href="https://sourceforge.net/projects/trowel-ec/">https://sourceforge.net/projects/trowel-ec/</a></p><p>Metagenomics</p><p>Assembly-free phylogenomics</p><p>AAF</p><p>Phylogeny reconstruction directly from unassembled raw sequence data from whole genome sequencing projects; provides bootstrap support to assess uncertainty in the tree topology (<em>k</em>-mer based)</p><p>Software (Python)</p><p><a href="https://github.com/fanhuan/AAF">https://github.com/fanhuan/AAF</a></p><p>kSNP v3</p><p>Reference-free SNP identification and estimation of phylogenetic trees using SNPs (based on&nbsp;<em>k</em>-mer analysis)</p><p>Software (C)</p><p><a href="https://sourceforge.net/projects/ksnp/files/">https://sourceforge.net/projects/ksnp/files/</a></p><p>NGS-MC</p><p>Phylogeny of species based on NGS reads using alignment-free sequence dissimilarity measures d2* and d2&nbsp;S&nbsp;under different Markov chain models (using&nbsp;<em>k</em>-words)</p><p>R package</p><p><a href="http://www-rcf.usc.edu/~fsun/Programs/NGS-MC/NGS-MC.html">http://www-rcf.usc.edu/~fsun/Programs/NGS-MC/NGS-MC.html</a></p><p>Species identification/taxonomic profiling</p><p>CLARK</p><p>Taxonomic classification of metagenomic reads to known bacterial genomes using&nbsp;<em>k</em>-mer search and LCA assignment</p><p>Software (C++)</p><p><a href="http://clark.cs.ucr.edu/">http://clark.cs.ucr.edu/</a></p><p>FOCUS</p><p>Reports organisms present in metagenomic samples and profiles their abundances (uses composition-based approach and non-negative least squares for prediction)</p><p>Web service Software (Python)</p><p><a href="http://edwards.sdsu.edu/FOCUS/">http://edwards.sdsu.edu/FOCUS/</a></p><p>GSM</p><p>Estimation of abundances of microbial genomes in metagenomic samples (<em>k</em>-mer based)</p><p>Software (Go)</p><p><a href="https://github.com/pdtrang/GSM">https://github.com/pdtrang/GSM</a></p><p>Mash</p><p>Species identification using assembled or unassembled Illumina, PacBio, and ONT data (based on MinHash dimensionality-reduction technique)</p><p>Software (C++)</p><p><a href="https://github.com/marbl/mash">https://github.com/marbl/mash</a></p><p>Kraken</p><p>Taxonomic assignment in metagenome analysis by exact&nbsp;<em>k</em>-mer search; LCA assignment of short reads based on a comprehensive sequence database</p><p>Software (C++)</p><p><a href="https://ccb.jhu.edu/software/kraken/">https://ccb.jhu.edu/software/kraken/</a></p><p>LMAT</p><p>Assignment of taxonomic labels to reads by&nbsp;<em>k</em>-mers searches in precomputed database</p><p>Software (C++/Python)</p><p><a href="https://sourceforge.net/projects/lmat/">https://sourceforge.net/projects/lmat/</a></p><p>stringMLST</p><p><em>k</em>-mer-based tool for MLST directly from the genome sequencing reads</p><p>Software (Python)</p><p><a href="http://jordan.biology.gatech.edu/page/software/stringMLST">http://jordan.biology.gatech.edu/page/software/stringMLST</a></p><p>Taxonomer</p><p><em>k</em>-mer-based ultrafast metagenomics tool for assigning taxonomy to sequencing reads from clinical and environmental samples</p><p>Web service</p><p><a href="http://taxonomer.iobio.io/">http://taxonomer.iobio.io/</a></p><p>Other</p><p>d2-tools</p><p>Word-based (<em>k</em>-tuple) comparison (pairwise dissimilarity matrix using d2S measure) of metatranscriptomic samples from NGS reads</p><p>Software (Python/R)</p><p><a href="https://code.google.com/p/d2-tools/">https://code.google.com/p/d2-tools/</a></p><p>VirHostMatcher</p><p>Prediction of hosts from metagenomic viral sequences based on ONF using various distance measures (e.g., d2)</p><p>Software (C++)</p><p><a href="https://github.com/jessieren/VirHostMatcher">https://github.com/jessieren/VirHostMatcher</a></p><p>MetaFast</p><p>Statistics calculation of metagenome sequences and the distances between them based on assembly using de Bruijn graphs and Bray&ndash;Curtis dissimilarity measure</p><p>Software (Java)</p><p><a href="https://github.com/ctlab/metafast">https://github.com/ctlab/metafast</a></p></div>]]></description>
	<dc:creator>Abhimanyu Singh</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/35550/circoletto-visualizing-sequence-similarity-with-circos</guid>
	<pubDate>Fri, 09 Feb 2018 10:23:40 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/35550/circoletto-visualizing-sequence-similarity-with-circos</link>
	<title><![CDATA[Circoletto: visualizing sequence similarity with Circos]]></title>
	<description><![CDATA[<p><span>Circoletto, an online visualization tool based on Circos, which provides a fast, aesthetically pleasing and informative overview of sequence similarity search results.</span></p>
<p>Online version and downloadable software package for offline use (source code in PERL) freely available at&nbsp;<a href="http://bat.ina.certh.gr/tools/circoletto/" target="">http://bat.ina.certh.gr/tools/circoletto/</a></p>
<p><strong>Contact:</strong><a href="mailto:ndarz@certh.gr" target="">ndarz@certh.gr</a></p><p>Address of the bookmark: <a href="http://tools.bat.infspire.org/circoletto/" rel="nofollow">http://tools.bat.infspire.org/circoletto/</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/bookmarks/view/37672/seqmonka-tool-to-visualise-and-analyse-high-throughput-mapped-sequence-data</guid>
	<pubDate>Tue, 11 Sep 2018 04:39:38 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37672/seqmonka-tool-to-visualise-and-analyse-high-throughput-mapped-sequence-data</link>
	<title><![CDATA[SeqMonk:A tool to visualise and analyse high throughput mapped sequence data]]></title>
	<description><![CDATA[<p>SeqMonk is a program to enable the visualisation and analysis of mapped sequence data. It was written for use with mapped next generation sequence data but can in theory be used for any dataset which can be expressed as a series of genomic positions. It's main features are:</p>
<ul>
<li>Import of mapped data from mapped data (BAM/SAM/bowtie etc)</li>
<li>Creation of data groups for visualisation and analysis</li>
<li>Visualisation of mapped regions against an annotated genome.</li>
<li>Flexible quantitation of the mapped data to allow comparisons between data sets</li>
<li>Statistical analysis of data to find regions of interest</li>
<li>Creation of reports containing data and genome annotation</li>
</ul><p>Address of the bookmark: <a href="http://www.bioinformatics.babraham.ac.uk/projects/seqmonk/" rel="nofollow">http://www.bioinformatics.babraham.ac.uk/projects/seqmonk/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</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>

</channel>
</rss>