<?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/30831?offset=380</link>
	<atom:link href="https://bioinformaticsonline.com/related/30831?offset=380" 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/researchlabs/view/17501/nieduszynski-group</guid>
  <pubDate>Fri, 26 Sep 2014 19:35:06 -0500</pubDate>
  <link></link>
  <title><![CDATA[Nieduszynski Group]]></title>
  <description><![CDATA[
<p>Complete, accurate replication of the genome is essential for life. All chromosomes in eukaryotic cells must be duplicated and then segregated to daughter cells to ensure genetic integrity and produce the large number of cells that make up a multicellular organism. We are using genetic, genomic and computational methods to understand how chromosome replication is regulated to ensure genome stability. By focusing on the basic biology that underpins cell growth and division we aim to provide new insights that may help our understanding of diseases such as cancer and congenital disorders. </p>

<p>More http://www.nieduszynski.org/index.php<br />http://www.path.ox.ac.uk/research/cell-biology-and-pathology/conrad-nieduszynski-group</p>
]]></description>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/17515/ngs-online-training</guid>
  <pubDate>Sat, 27 Sep 2014 07:42:29 -0500</pubDate>
  <link></link>
  <title><![CDATA[NGS Online Training]]></title>
  <description><![CDATA[
<p>ArrayGen Technologies announces to provide online NGS training through out the globe. Now analyze your own NGS datasets from anywhere.For more information contact us at training@arraygen.com</p>

<p>Please visit our site at www.arraygen.com</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/39098/sda-long-read-sequence-and-assembly-of-segmental-duplications</guid>
	<pubDate>Tue, 05 Mar 2019 10:00:57 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/39098/sda-long-read-sequence-and-assembly-of-segmental-duplications</link>
	<title><![CDATA[SDA: Long-read sequence and assembly of segmental duplications]]></title>
	<description><![CDATA[<p><span><span>Segmental Duplication Assembler (SDA; https://github.com/mvollger/SDA) constructs graphs in which paralogous sequence variants define the nodes and long-read sequences provide attraction and repulsion edges, enabling the partition and assembly of long reads corresponding to distinct paralogs.<br></span></span></p>
<p><span><span>https://github.com/mvollger/SDA</span></span></p><p>Address of the bookmark: <a href="https://www.nature.com/articles/s41592-018-0236-3" rel="nofollow">https://www.nature.com/articles/s41592-018-0236-3</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/17751/jrf-in-bioinformatics-inmas-drdodelhi</guid>
  <pubDate>Wed, 01 Oct 2014 07:01:07 -0500</pubDate>
  <link></link>
  <title><![CDATA[JRF in Bioinformatics @ INMAS, DRDO,Delhi]]></title>
  <description><![CDATA[
<p>Institute of Nuclear Medicine and Allied Sciences (INMAS), Delhi under the aegis of Defence Research and Development Organisation (DRDO), is engaged in research and developmental work in radiation sciences, Neuro-Computing and Medical Image Processing. INMAS is looking for meritorious young researchers for pursuing research in the frontier areas at INMAS. The Institute invites applications from young and meritorious Indian nationals who are creative, have passion and desire to pursue R&amp;D in frontier areas. INMAS possesses ambience of a research cum academic institute coupled with an advanced R&amp;D infrastructure in a mission mode. It provides the best infrastructure, motivation and personality development prospects for talented students, dreaming of unparalleled success in their professional endeavors. INMAS provides state of the art research facilities for undertaking pioneering research with defence applications. </p>

<p>JRF (Maximum Tenure‐ Five Years: 2yrs as JRF and 3yrs  as SRF) 	<br />A first class Master’s Degree in Bioinformatics (likely 2 posts) 	<br />Around Rs 16,000/ Plus 30% HRA (as per rules of funding agency)</p>

<p>Applications are invited from candidates possessing the above qualifications. The upper age limit is as on the last date for receipt of application. (5 years relaxation to SC/ST candidates, 3 years to OBC candidates, and other entitled categories as per Govt rules). Actual No. of vacancies may vary.</p>

<p>Application form can be download from the website www.drdo.gov.in and E Mailed to inmashrd@gmail.com.<br />Last date to apply by email is 1700 hrs on 15 Oct 2014<br />Incomplete applications are liable to be rejected.<br />Confirmation will be sent to short-listed candidates through email only<br />Antecedents of selected candidates will be verified.<br />Written Test will be conducted from 0930-1030 hrs. Latecomers will not be considered.<br />Candidates will be required to produce certificates/testimonials in original at the time of interview.<br />It may please be noted that offer of Fellowship does not confer on fellows any right for absorption in DRDO.<br />Candidates should carry photocopy of Application form sent by email with them.<br />No TA/DA will be paid for attending interview &amp; on joining.<br />Last date to apply by email is 1700 hrs on 15 Oct 2014</p>

<p>More at http://drdo.gov.in/drdo/English/jrf29092014.pdf<br />http://drdo.gov.in/drdo/English/index.jsp?pg=inmas29092014.jsp</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/40510/reps-repeat-masked-phrap-with-scaffolding-a-wgs-sequence-assembler</guid>
	<pubDate>Sat, 04 Jan 2020 01:08:09 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/40510/reps-repeat-masked-phrap-with-scaffolding-a-wgs-sequence-assembler</link>
	<title><![CDATA[RePS: Repeat-masked Phrap with scaffolding, a WGS sequence assembler]]></title>
	<description><![CDATA[<p>RePS (Repeat-masked Phrap with scaffolding), a WGS sequence assembler, that explicitly identifies exact kmer repeats from the shotgun data and removes them prior to the assembly. The established software Phrap is used to compute meaningful error probabilities for each base. Clone-end-pairing information is used to construct scaffolds that order and orient the contigs. The updated version of RePS incorporates some of the ideas introduced by Phusion on clustering</p>
<p><img src="https://www.ncbi.nlm.nih.gov/pmc/articles/PMC186573/bin/45793-17f1_F4TT.jpg" alt="image" style="border: 0px;"></p>
<p>More at</p>
<p><a href="https://www.ncbi.nlm.nih.gov/pmc/articles/PMC186573/">https://www.ncbi.nlm.nih.gov/pmc/articles/PMC186573/</a></p><p>Address of the bookmark: <a href="ftp://ftp.genomics.org.cn/pub/ricedb/Tools/RePS/RePS-IBM-AIX.tar.gz" rel="nofollow">ftp://ftp.genomics.org.cn/pub/ricedb/Tools/RePS/RePS-IBM-AIX.tar.gz</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/17966/internship-program-for-bioinformatics-biotechnology-professionals-no-of-vacancy-2</guid>
  <pubDate>Wed, 08 Oct 2014 01:10:08 -0500</pubDate>
  <link></link>
  <title><![CDATA[Internship Program for Bioinformatics / Biotechnology Professionals (No. Of Vacancy: 2)]]></title>
  <description><![CDATA[
<p>ArrayGen is offering an Internship Program for Post graduate Bioinformatics / Biotechnology students and professionals. ArrayGen Technologies provide an excellent opportunity to gain research experience and explore if a scientific career is right for you. Currently we offer positions to outstanding students interested in Next Generation Sequencing (NGS) data analysis. Applications are accepted throughout the year. Accepted students will be listed on web with their schedules. Accepted students can attend our future workshops and trainings freely at the specified venue.</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/41146/lofreq-a-sequence-quality-aware-ultra-sensitive-variant-caller-for-ngs-data</guid>
	<pubDate>Tue, 18 Feb 2020 03:24:22 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/41146/lofreq-a-sequence-quality-aware-ultra-sensitive-variant-caller-for-ngs-data</link>
	<title><![CDATA[LoFreq*: A sequence-quality aware, ultra-sensitive variant caller for NGS data]]></title>
	<description><![CDATA[<p>LoFreq* (i.e. LoFreq version 2) is a fast and sensitive variant-caller for inferring SNVs and indels from next-generation sequencing data. It makes full use of base-call qualities and other sources of errors inherent in sequencing (e.g. mapping or base/indel alignment uncertainty), which are usually ignored by other methods or only used for filtering.</p>
<p>https://github.com/CSB5/lofreq</p>
<p>http://csb5.github.io/lofreq/installation/</p>
<p>https://github.com/CSB5/lofreq/tree/master/dist</p><p>Address of the bookmark: <a href="http://csb5.github.io/lofreq/" rel="nofollow">http://csb5.github.io/lofreq/</a></p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/videolist/watch/18381/how-far-can-bioinformatics-go-creating-organisms-used-for-testing</guid>
	<pubDate>Fri, 17 Oct 2014 02:08:16 -0500</pubDate>
	<link>https://bioinformaticsonline.com/videolist/watch/18381/how-far-can-bioinformatics-go-creating-organisms-used-for-testing</link>
	<title><![CDATA[How far can bioinformatics go creating organisms used for testing?]]></title>
	<description><![CDATA[<iframe width="" height="" src="https://www.youtube-nocookie.com/embed/FojhDef2NW4" frameborder="0" allowfullscreen></iframe>"I think you can get very far on a technical level. The problem is that a human body is more complex than just one cell." ... "At some point we still need clinical tests on animals and humans before we use it for real treatment. But we will likely be able to remove 99 % of animal tests in the future."

Erik Lindahl, Professor of Theoretical and Computational Biophysics at KTH Royal Institute of Technology is telling us about his work.

From the episode "Science for life – mapping the building blocks of the human body". Watch the rest of the talk, and other talks at www.crosstalks.tv

Crosstalks is an academic talkshow produced by KTH Royal Institute of Technology and Stockholm University.]]></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>

</channel>
</rss>