<?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/31714?offset=1230</link>
	<atom:link href="https://bioinformaticsonline.com/related/31714?offset=1230" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/41896/kad-assessing-genome-assemblies-using-k-mer-copies-in-assemblies-and-k-mer-abundance-in-illumina-reads</guid>
	<pubDate>Fri, 19 Jun 2020 07:34:12 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/41896/kad-assessing-genome-assemblies-using-k-mer-copies-in-assemblies-and-k-mer-abundance-in-illumina-reads</link>
	<title><![CDATA[KAD: Assessing genome assemblies using K-mer copies in assemblies and K-mer abundance in Illumina reads]]></title>
	<description><![CDATA[<p>KAD is designed for evaluating the accuracy of nucleotide base quality of genome assemblies. Briefly, abundance of k-mers are quantified for both sequencing reads and assembly sequences. Comparison of the two values results in a single value per k-mer, K-mer Abundance Difference (KAD), which indicates how well the assembly matches read data for each k-mer.</p>
<p><a href="https://render.githubusercontent.com/render/math?math=KAD=log_{2}\begin{pmatrix}\frac{c%2Bm}{m(n%2B1)}\end{pmatrix}" target="_blank"><img src="https://render.githubusercontent.com/render/math?math=KAD=log_{2}\begin{pmatrix}\frac{c%2Bm}{m(n%2B1)}\end{pmatrix}" alt="image" style="border: 0px;"></a></p>
<p>where,&nbsp;<em>c</em>&nbsp;is the count of a k-mer from reads,&nbsp;<em>m</em>&nbsp;is the mode of counts of read k-mers, and&nbsp;<em>n</em>&nbsp;is the copy of the k-mer in the assembly.</p><p>Address of the bookmark: <a href="https://github.com/liu3zhenlab/KAD" rel="nofollow">https://github.com/liu3zhenlab/KAD</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/20362/20th-international-bioinformatics-workshop-on-virus-evolution-and-molecular-epidemiology-veme</guid>
  <pubDate>Mon, 12 Jan 2015 01:39:45 -0600</pubDate>
  <link></link>
  <title><![CDATA[20th International BioInformatics Workshop on Virus Evolution and Molecular Epidemiology (VEME)]]></title>
  <description><![CDATA[
<p>20th International BioInformatics Workshop on Virus Evolution and Molecular Epidemiology (VEME)<br />9 - 14 August 2015 St. Augustine, Trinidad and Tobago </p>

<p>Organiser: Christine Carrington (University of the West Indies - UWI, St. Augustine, Trinidad and Tobago)<br />Co-organisers: Anne-Mieke Vandamme, Philippe Lemey (Katholieke Universiteit Leuven, Belgium), Marco Salemi, Mattia Prosperi (University of Florida, Gainesville, USA) and Karen E. Nelson (J. Craig Venter Institute, Rockville, USA)</p>

<p>Requests for information directly to:<br />Christine Carrington<br />Department of Preclinical Sciences<br />Faculty of Medical Sciences<br />University of the West Indies (UWI)<br />St. Augustine<br />Trinidad and Tobago<br />Telephone: +1-868-6452640 ext. 5009, +1-868-6848803<br />Fax: +1-868-6621873<br />E-mail: veme2015@sta.uwi.edu</p>

<p>Deadline for receipt of applications by local organiser: 15 March 2015<br />CALL FOR APPLICATIONS NOW OPEN<br />http://www.icgeb.org/course-application-trinidad-and-tobago-2015.html</p>

<p>http://rega.kuleuven.be/cev/veme-workshop/2015</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/42477/hifiasm-a-haplotype-resolved-assembler-for-accurate-hifi-reads</guid>
	<pubDate>Thu, 24 Dec 2020 10:03:36 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/42477/hifiasm-a-haplotype-resolved-assembler-for-accurate-hifi-reads</link>
	<title><![CDATA[Hifiasm: a haplotype-resolved assembler for accurate Hifi reads]]></title>
	<description><![CDATA[<p><span>Hifiasm is a fast haplotype-resolved de novo assembler for PacBio Hifi reads. It can assemble a human genome in several hours and works with the California redwood genome, one of the most complex genomes sequenced so far. Hifiasm can produce primary/alternate assemblies of quality competitive with the best assemblers. It also introduces a new graph binning algorithm and achieves the best haplotype-resolved assembly given trio data.</span></p><p>Address of the bookmark: <a href="https://github.com/chhylp123/hifiasm" rel="nofollow">https://github.com/chhylp123/hifiasm</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/news/view/20437/wuxi-has-acquired-nextcode-health</guid>
	<pubDate>Mon, 19 Jan 2015 08:17:35 -0600</pubDate>
	<link>https://bioinformaticsonline.com/news/view/20437/wuxi-has-acquired-nextcode-health</link>
	<title><![CDATA[WuXi has acquired NextCODE Health]]></title>
	<description><![CDATA[<p>Shanghai, China-headquartered pharmatech company WuXi (NYSE: WX) has acquired NextCODE Health, a genomic analysis and bioinformatics company based in the USA.<br /><br />The acquisition was made for $65 million in cash, and WuXi plans to merge its genome center with NextCODE Health to form a new company, WuXi NextCODE Genomics. The business will be headquartered in Shanghai and have operations in Cambridge, Massachusetts, and Reykjavik, Iceland.<br /><br />With the huge unmet medical needs in diseases with a genetic component and the rapid advances in genomics and bioinformatics, now is the right time for WuXi to make a strategic investment in this field, and NextCODE is the right partner. This new venture of WuXi NextCODE Genomics will create important new genomic and bioinformatic products and services to help make personalized treatment and medicine a reality.&nbsp; It will also enable doctors to provide better treatments to patients.<br /><br /></p>]]></description>
	<dc:creator>Pranjali Yadav</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/blog/view/43260/bioinformatics-tools-for-telomere-to-telomere-assembly</guid>
	<pubDate>Tue, 17 Aug 2021 13:17:09 -0500</pubDate>
	<link>https://bioinformaticsonline.com/blog/view/43260/bioinformatics-tools-for-telomere-to-telomere-assembly</link>
	<title><![CDATA[Bioinformatics tools for telomere to telomere assembly !]]></title>
	<description><![CDATA[<p>●&nbsp;<a href="https://github.com/arangrhie/merfin" target="_blank">Merfin</a>&nbsp;&ndash; k-mer-based assembly and variant calling evaluation for improved consensus accuracy (Arang Rhie)<br />●&nbsp;<a href="https://www.biorxiv.org/content/10.1101/2020.11.11.378133v1" target="_blank">PanGenie</a>&nbsp;&ndash; algorithm that leverages a pangenome reference built from haplotype-resolved genome assemblies in conjunction with k-mer count information from raw, short-read sequencing data to genotype a wide spectrum of genetic variation (Tobias Marschall)<br />●&nbsp;<a href="https://github.com/ConesaLab/SQANTI3" target="_blank">SQANTI3</a>&nbsp;&ndash; an automated pipeline for the classification of long-read transcripts that can assess the quality of data and the preprocessing pipeline (Roc&iacute;o Amor&iacute;n de Heged&uuml;s&nbsp;<a href="https://twitter.com/rocioadh" target="_blank">@rocioadh</a>)<br />●&nbsp;<a href="https://github.com/GenomeRIK/tama" target="_blank">tama</a>&nbsp;(Transcriptome Annotation by Modular Algorithms) &ndash; software designed for processing Iso-Seq data and other long-read transcriptome data (Richard Kuo&nbsp;<a href="https://twitter.com/GenomeRIK" target="_blank">@GenomeRIK</a>)<br />●&nbsp;<a href="https://github.com/PacificBiosciences/pbAA" target="_blank">pbaa</a>&nbsp;(PacBio Amplicon Analysis) &ndash; separates complex mixtures of amplicon targets from genomic samples to cluster and generate high-quality consensus sequences from HiFi reads (Zev Kronenberg&nbsp;<a href="https://twitter.com/zevkronenberg" target="_blank">@zevkronenberg</a>)<br />●&nbsp;<a href="https://github.com/yuanyuan929/bellerophon" target="_blank">bellerophon</a>&nbsp;&ndash; analyzes MHC typing and other low-complexity gene amplicon data; performs allele calling while detecting polymorphic sites within the sequences and removing potential chimeric sequence variants (Yuanyuan Cheng&nbsp;<a href="https://twitter.com/Yuanyuan929" target="_blank">@Yuanyuan929</a>)<br />●&nbsp;<a href="https://github.com/amwenger/svpack" target="_blank">svpack</a>&nbsp;&ndash; tools for filtering, comparing, and annotating structural variant (SV) calls in VCF format (Aaron Wenger)<br />●&nbsp;<a href="https://github.com/AntonBankevich/jumboDB" target="_blank">JumboDB</a>&nbsp;&ndash; tool for de Bruijn graph construction (Anton Bankevich&nbsp;<a href="https://twitter.com/AntonBankevich" target="_blank">@AntonBankevich</a>)<br />●&nbsp;<a href="https://github.com/ksahlin/ultra" target="_blank">uLTRA</a>&nbsp;&ndash; tool for splice alignment of long transcriptomic reads to a genome, guided by a database of exon annotations. (Kristoffer Sahlin&nbsp;<a href="https://twitter.com/krsahlin" target="_blank">@krsahlin</a>)<br />●&nbsp;<a href="https://www.biorxiv.org/content/10.1101/2021.01.25.428044v1.full.pdf" target="_blank">LeafGo</a>&nbsp;&ndash; workflow to rapidly produce high-quality de novo plant genomes (Luca Ermini&nbsp;<a href="https://twitter.com/ermini_luca" target="_blank">@ermini_luca</a>)</p><p>Reference:</p><p>https://www.pacb.com/blog/young-investigators-share-stellar-science-career-advice-and-bioinformatics-tools-at-smrt-leiden-2021/</p><p>&nbsp;</p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/21200/ra-bioinformatics-at-ciba</guid>
  <pubDate>Fri, 13 Feb 2015 11:23:18 -0600</pubDate>
  <link></link>
  <title><![CDATA[RA Bioinformatics at CIBA]]></title>
  <description><![CDATA[
<p>Recruitment The following posts are to be filled purely on temporary basis under CIBA Component of “Centre for Agricultural Bioinformatics (CABin)” project at this Institute.</p>

<p>Posts Research Associate</p>

<p>Date &amp; Time of Interview 18th Feb 2015 at 10.00 a.m.</p>

<p>Project Name “Centre for Agricultural Bioinformatics (CABin)”</p>

<p>Duration 12th Plan (2012-2017) / co-terminus with the project 12th Plan (2012-2017) / co-terminus with the project</p>

<p>Essential Qualification Ph.d / M.Sc./ M.Phil (Bioinformatics) With 1st division or 60% marks or equivalent overall grade point average with at least two years of research experience in the relevant subject.</p>

<p>Technician</p>

<p>B.Tech. or Master degree in computer science/Computer Engineering /MCA or equivalent. Desirable qualification: Experience in Java/ C++/ PHP/ PERL/ Python etc. based application development using Linux, Apache and MySQL/Oracle.</p>

<p>Emoluments Rs.24000/- p.m. + 30% HRA for Ph.D holders / Rs.23000/- p.m. + 30% HRA for Master Degree holders A consolidated pay Rs.25000/- per month.</p>

<p>Age Limit Maximum 40 years for men and 45 years for women as on date of interview.</p>

<p>Age limits are relaxable for SC / ST / OBC candidates as per rules.</p>

<p>Maximum 40 years for men and 45 years for women as on date of interview.</p>

<p>Age limits are relaxable for SC / ST / OBC candidates as per rules.</p>

<p>Eligible Candidates may send their Curriculum Vitae along with the contact numbers to ashok@ciba.res.in on or before 13-02-2015.</p>

<p>Candidates selected after initial screening will be called for interview.</p>

<p>Advertisement: www.ciba.res.in/attachments/jobs/CABin-3006.pdf</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/blog/view/44234/steps-to-find-palindrome-in-genomes</guid>
	<pubDate>Thu, 09 Mar 2023 02:56:54 -0600</pubDate>
	<link>https://bioinformaticsonline.com/blog/view/44234/steps-to-find-palindrome-in-genomes</link>
	<title><![CDATA[Steps to find palindrome in genomes !]]></title>
	<description><![CDATA[<div><div><div><div><div><div><div><div><div><div><p>Palindromes are sequences of nucleotides that read the same backward as forward. They can be present in genomes and have various biological functions. Here are some methods for discovering palindromes in genomes:</p><ol>
<li>
<p>Direct sequence search: One of the simplest ways to discover palindromes is to search the genome sequence directly for palindromic sequences using pattern matching tools, such as regular expressions or string algorithms. This approach can be useful for discovering simple palindromes, but may miss more complex palindromic structures.</p>
</li>
<li>
<p>Dot plot analysis: Dot plot analysis is a graphical method that can be used to identify palindromic regions in a genome. It involves plotting the genome sequence against itself and examining the diagonal patterns that emerge. Palindromic regions will appear as symmetrical patterns along the diagonal.</p>
</li>
<li>
<p>Restriction enzyme analysis: Some restriction enzymes, such as EcoRI and HindIII, recognize palindromic sequences and cleave DNA at these sites. By digesting the genome with these enzymes and examining the resulting fragments, palindromic regions can be identified.</p>
</li>
<li>
<p>Next-generation sequencing: High-throughput sequencing technologies, such as PacBio and Oxford Nanopore, can generate long reads that can span entire palindromic regions. By mapping these reads to the genome, palindromic regions can be identified and characterized.</p>
</li>
<li>
<p>Comparative genomics: Comparing the genomes of related species can also reveal palindromic regions that are conserved across evolutionarily divergent lineages. This approach can help identify functional palindromes that are under selective pressure.</p>
</li>
</ol><p>Overall, the discovery of palindromic sequences in genomes can be accomplished using a variety of methods, each with their own advantages and limitations. A combination of these methods can provide a comprehensive understanding of the palindromic landscape of a genome.</p></div></div></div></div></div></div></div></div></div></div>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/20677/postdoctoral-researcher-at-department-of-biotechnology-catholic-university-of-daegu-kyungsan-kyungbuk-south-korea</guid>
  <pubDate>Thu, 29 Jan 2015 12:11:16 -0600</pubDate>
  <link></link>
  <title><![CDATA[Postdoctoral Researcher at Department of Biotechnology, Catholic University of Daegu, Kyungsan, Kyungbuk, South Korea.]]></title>
  <description><![CDATA[
<p>Applications are invited from Indian nationals for a Post Doctoral position at Molecular Medical Laboratory, Department of Biotechnology, Catholic University of Daegu, Kyungsan, Kyungbuk, South Korea.</p>

<p>Qualification required: PhD in Life Sciences/ Molecular Biology/ Bioinformatics or related discipline.</p>

<p>Desirable Qualification:</p>

<p>1. Candidates having experience in molecular biology techniques and must be well versed with bioinformatics tool or expert in relevant fields will be preferred.<br />2. The candidate should have good communication skill, knowledge about designing experiments and analyzing data.<br />3. Sense of initiative, autonomy, organization and thoroughness, good relation qualities.<br />Remuneration: 2000USD per month.</p>

<p>Last date of submitting the complete applications furnishing Bio-data is 10th February, 2015.</p>

<p>Interested candidates should send their resume including all personal as well as academic details to the principal investigator Prof Seung-Won Park (email:microsw@cu.ac.kr)</p>

<p>The shortlisted candidates will be intimated within February 2015.</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34235/quorum-an-error-corrector-for-illumina-reads</guid>
	<pubDate>Wed, 08 Nov 2017 11:40:41 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34235/quorum-an-error-corrector-for-illumina-reads</link>
	<title><![CDATA[QuorUM: An Error Corrector for Illumina Reads]]></title>
	<description><![CDATA[<p><span><span>Illumina Sequencing data can provide high coverage of a genome by relatively short (most often 100 bp to 150 bp) reads at a low cost. Even with low (advertised 1%) error rate, 100 &times; coverage Illumina data on average has an error in some read at every base in the genome. These errors make handling the data more complicated because they result in a large number of low-count erroneous&nbsp;</span><em>k</em><span>-mers in the reads. However, there is enough information in the reads to correct most of the sequencing errors, thus making subsequent use of the data (e.g. for mapping or assembly) easier. Here we use the term &ldquo;error correction&rdquo; to denote the reduction in errors due to both changes in individual bases and trimming of unusable sequence. We developed an error correction software called QuorUM. QuorUM is mainly aimed at error correcting Illumina reads for subsequent assembly. It is designed around the novel idea of minimizing the number of distinct erroneous&nbsp;</span><em>k</em><span>-mers in the output reads and preserving the most true&nbsp;</span><em>k</em><span>-mers, and we introduce a composite statistic &pi; that measures how successful we are at achieving this dual goal. We evaluate the performance of QuorUM by correcting actual Illumina reads from genomes for which a reference assembly is available.</span></span></p>
<p><span>QuorUM is distributed as an independent software package and as a module of the MaSuRCA assembly software. Both are available under the GPL open source license at&nbsp;</span><a href="http://www.genome.umd.edu/">http://www.genome.umd.edu</a><span>.</span></p><p>Address of the bookmark: <a href="http://journals.plos.org/plosone/article?id=10.1371/journal.pone.0130821" rel="nofollow">http://journals.plos.org/plosone/article?id=10.1371/journal.pone.0130821</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/22438/research-associate-nbfgr-lucknow-uttar-pradesh</guid>
  <pubDate>Thu, 28 May 2015 19:37:22 -0500</pubDate>
  <link></link>
  <title><![CDATA[Research Associate NBFGR - Lucknow, Uttar Pradesh]]></title>
  <description><![CDATA[
<p>NBFGR, Lucknow is recruiting Bioinformatics experts for the post of Research Associate</p>

<p>Name of Position : Research Associate<br />No of Post : One<br />Desired candidate Profile : Candidate should be PhD in Bioinformatics or equivalent or Post-Graduation Bioinformatics with 1st division or 60% marks. Preference will be given to candidates having experience in server management<br />Remuneration : Rs 24000/- pm + HRA for PhD holders<br />Age requirement- 40 years (5 years relaxation for SC/ST/women candidates and 3 years for OBC candidates) as on date of interview.</p>

<p>How to apply- Interested candidates can walk -in-interview on 30.05.2015 at 10:00 hrs at National Bureau of Fish Genetic Resources, Lucknow.</p>

<p>Ref- http://www.nbfgr.res.in/PDF/News%20&amp;%20Events/Walk%20in%20interview%20on%2030.05.2015.pdf</p>
]]></description>
</item>

</channel>
</rss>