<?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/27277?offset=900</link>
	<atom:link href="https://bioinformaticsonline.com/related/27277?offset=900" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/file/view/39260/biotechnology-eligibility-test-bet-question-paper</guid>
	<pubDate>Wed, 17 Apr 2019 04:56:33 -0500</pubDate>
	<link>https://bioinformaticsonline.com/file/view/39260/biotechnology-eligibility-test-bet-question-paper</link>
	<title><![CDATA[Biotechnology Eligibility Test (BET) Question Paper !]]></title>
	<description><![CDATA[<p><span>DBT-BET JRF 2019 Exam was held successfully on 14th April 2019. Official Question Paper &amp; Answer key of&nbsp;DBT-BET 2019 Exam has been released. </span></p><p><span>The best part about the DBT-BET Exam is both the question paper &amp; answer key is released immediately after the exam so you get the upper hand here to check how well you did in the DBT-BET exam, how much you are going to score and if you can pass the Exam with good score. This helps you in planning your career ahead. </span></p><p><span>DBT Exam is held once in a year by Department of Biotechnology &ndash; Govt of India.&nbsp;Candidates willing to get DBT-Junior Research Fellowship &ndash; DBT JRF fellowship should take up the&nbsp; DBT-BET Exam, DBT &ndash; Biotechnology Eligibility Test (BET) 2020 to be held on somewhere in the month of April. Official Notification for DBT-BET 2020 will be released in Feb 2020.</span></p><p><span>Answer at&nbsp;<a href="https://bioinformaticsonline.com/file/view/39262/biotechnology-eligibility-test-bet-answer-set">https://bioinformaticsonline.com/file/view/39262/biotechnology-eligibility-test-bet-answer-set</a></span></p>]]></description>
	<dc:creator>Abhimanyu Singh</dc:creator>
	<enclosure url="https://bioinformaticsonline.com/file/download/39260" length="524574" type="application/pdf" />
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/32129/lordec-a-hybrid-error-correction-program-for-long-pacbio-reads</guid>
	<pubDate>Mon, 10 Apr 2017 04:16:09 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/32129/lordec-a-hybrid-error-correction-program-for-long-pacbio-reads</link>
	<title><![CDATA[LoRDEC: a hybrid error correction program for long, PacBio reads]]></title>
	<description><![CDATA[<p>LoRDEC is a program to correct sequencing errors in long reads from 3rd generation sequencing with high error rate, and is especially intended for PacBio reads. It uses a hybrid strategy, meaning that it uses two sets of reads: the reference read set, whose error rate is assumed to be small, and the PacBio read set, which is then corrected using the reference set. Typically, the reference set contains Illumina reads.</p>
<p><br> Usually, errors in PacBio reads include many insertions and deletions, and comparatively less substitutions. LoRDEC can correct errors of all these types.<br> After correction, a larger portion of the sequence of PacBio reads is usable for detection of region of similarity with other sequences, for aligning them to the contigs of an assembly, etc.</p>
<p>Why is LoRDEC different?</p>
<ul>
<li>It is efficient and can process large read data sets, included from eukaryotic or vertebrate species, on a usual computing server, and even works on desktop/laptop computers.</li>
<li>It adopts a novel graph based approach: it builds a succinct De Bruijn Graph (DBG) representing the short reads, and seeks a corrective sequence for each erroneous region of a long read by traversing chosen paths in the graph.</li>
</ul><p>Address of the bookmark: <a href="http://www.atgc-montpellier.fr/lordec/" rel="nofollow">http://www.atgc-montpellier.fr/lordec/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/news/view/92/genomic-impact</guid>
	<pubDate>Wed, 10 Jul 2013 01:33:50 -0500</pubDate>
	<link>https://bioinformaticsonline.com/news/view/92/genomic-impact</link>
	<title><![CDATA[Genomic Impact]]></title>
	<description><![CDATA[<p>The ongoing genomic research in USA&nbsp;<span>contributed $31 billion to the U.S. gross national product and helped support 152,000 jobs.&nbsp;</span></p><p><span>Reference:&nbsp;<a href="http://www.unitedformedicalresearch.com/wp-content/uploads/2013/06/The-Impact-of-Genomics-on-the-US-Economy.pdf">http://www.unitedformedicalresearch.com/wp-content/uploads/2013/06/The-Impact-of-Genomics-on-the-US-Economy.pdf</a></span></p>]]></description>
	<dc:creator>Jitendra Narayan</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/32154/decostar-detection-of-co-evolution</guid>
	<pubDate>Fri, 14 Apr 2017 06:27:25 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/32154/decostar-detection-of-co-evolution</link>
	<title><![CDATA[DeCoSTAR - Detection of Co-evolution]]></title>
	<description><![CDATA[<p><span>DeCoSTAR is a software which aims at reconstructing ancestral gene or genome organizations, in the form of sets of neighborhood relations -adjacencies- between pairs of ancestral genes or gene domains.</span><br><span>Ancestral genes or domains are deduced from reconciled gene trees in a context of birth, speciation, duplication, loss, transfer, which are either given as input or computed with the&nbsp;</span><a href="http://mbb.univ-montp2.fr/MBB/download_sources/16__TERA">ecceTERA package</a><span>, to which DeCoSTAR is integrated. DeCoSTAR constructs parsimonious scenarios of gains and breakages of adjacencies, and contains in particular all the features of previous software DeCo, DeCoLT, ArtDeCo and DeClone. It provides statistical supports on ancestral adjacencies, or the possibility to handle badly assembled genomes.&nbsp;</span><br><span>DeCoSTAR is able to reconstruct the histories of domains inside genes, including gene fusion and fission events, as well as ancestral genome structures for dozens of whole genomes from all kingdoms of life in a few minutes.</span></p><p>Address of the bookmark: <a href="http://pbil.univ-lyon1.fr/software/DeCoSTAR/" rel="nofollow">http://pbil.univ-lyon1.fr/software/DeCoSTAR/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/blog/view/428/five-unique-traits-of-effective-computational-biologist</guid>
	<pubDate>Thu, 11 Jul 2013 13:12:51 -0500</pubDate>
	<link>https://bioinformaticsonline.com/blog/view/428/five-unique-traits-of-effective-computational-biologist</link>
	<title><![CDATA[Five unique traits of effective computational biologist]]></title>
	<description><![CDATA[<p>Bioinformatics research is driven by large set of software, scripts, and tools to analyse gigantic biological data. Being a great biological programmer or bioinformatician involves more than writing code that works. The biological programmers who rise to the top ranks of their profession are not only good programmer but also expert in biological stuff. Moreover, In order to be a good and effective biological programmer, you need to possess a combination of traits that allow your computational as well as biological skill, experience, and knowledge to produce working code. There are some technically skilled biological programmers who will never be effective because they lack the other important traits needed. Here are top five traits that are necessary to become a great biological programmer.</p><p><strong>1. Learn and get updated</strong></p><p>Some of the bad biological programmers only learn new technical or non-technical things when it&rsquo;s absolutely necessary. The good biological programmers learn new technical skills proactively. But great biological programmers not only learn new technical skills on their own but also learn non-technical skills, and have an open mind to sources of knowledge that others may shut out.</p><p>In other concrete term, the bad biological programmer learn Perl's regular expression when they started a project on comparative genomics; the good biological programmer learned it a year before because it looked interesting; and the great biological programmer also read about the BioPerl packages, genomics, DNA string, genomic theories, or some similar course of study so that they could understand the results and explain it biologically.</p><p><strong>2. Not a merely coder!!!</strong></p><p>I often encountered with biological programmer who call themself a hard-core computer programmer and avoid biology. I can almost guarantee that if you are one of them then you are not doing research but merely writing "dry" codes.</p><p>According to my supervisor most of the computational biologist, don't know what they are doing biologically. Even they struggle to explain their own programs output and results. Therefore, It is highly advisable to learn basic of biology which can assist you to explain the result and understand your discovery. Always remember you are a researcher not a coder.</p><p><strong>3. Be Social with biologist</strong></p><p>The computational biologist spends most of the time in from of computers, writing codes. They always think their job is to produce working codes, not technical research perfections. But, they are completely wrong. You should not forget that apart from your computational skills you also need some biologist, other than your supervisor, to explain and make you understand the complex biological mechanism.</p><p>I highly recommend your to interact with biotech researchers and learn how do they explain their one graph (which they generally produce after one year of work) biologically. Remember, the origin of your research project is complex biological phenomenon, which is more complex than that of your limited programming rules.</p><p><strong>4. Do not search, research for answers</strong></p><p>Researching for answers means more than typing several keywords into a search engine or posting a question at Stack Overflow or the BioStars forums. I have entered problems into search engines that generate no results, and every question I posted on Stack Overflow or the BioStars forums never got anything resembling an answer, yet I solved the issues and moved on. I&rsquo;m not a magician &mdash; I just know how to find answers or discover root causes.</p><p>Many problems are situational, and if you depend on search engines and forums, you can waste a lot of time going down a rabbit hole and possibly never getting a solution. Learn to perform root cause analysis, learn enough about the underlying system to look for other clues and solutions, and learn to take a long distance view of an issue before deep diving into it.</p><p><strong>5. Love and defend your research</strong></p><p>You cannot rise to the top in this research profession without loving your work. There are some very good &ldquo;it&rsquo;s just a job&rdquo; biological programmers (I&rsquo;ve been one at times), but if that is your outlook, you won&rsquo;t be willing to do whatever it takes to succeed. This idea gets a lot of folks in a huff, because they feel it is a personal insult. &ldquo;I&rsquo;m a good programmer, but I have other priorities and can&rsquo;t make work my life.&rdquo; I understand completely; I have other priorities too. As much as I hate to say it, when I am passionate about my work, I am willing (though not eager) to abandon my other priorities to finish the job. It is not an insult to say that if you aren&rsquo;t willing to pull out all the stops you can&rsquo;t be the best, it is a fact.</p><p>You must be passionate about more than programming &mdash; you must also be excited about your research, the tools and technology you are using, and so on. I have seen very good and even great biological programmers operating at mediocre levels because something was not a good fit, such as they hated the project or were using a technology they disliked. Therefore, like your research project and get excited about your discoveries. You have not only to discover but also defend your finding with scientific words.</p><p>Thanks to all of you for reading.</p>]]></description>
	<dc:creator>Jitendra Narayan</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/researchlabs/view/851/the-institute-for-molecular-bioscience-imb-bailey-lab</guid>
  <pubDate>Sun, 14 Jul 2013 11:53:08 -0500</pubDate>
  <link></link>
  <title><![CDATA[The Institute for Molecular Bioscience (IMB), Bailey Lab]]></title>
  <description><![CDATA[
<p>Pattern recognition and computational biology</p>

<p>MEME Suite software development; gene expression; mathematical modelling; gene regulation and transcription</p>

<p>Specialization:<br />Pattern recognition and modelling in computational biology</p>

<p>Link @ http://www.imb.uq.edu.au/tim-bailey</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/32399/mapping-ngs</guid>
	<pubDate>Tue, 02 May 2017 07:58:07 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/32399/mapping-ngs</link>
	<title><![CDATA[Mapping NGS]]></title>
	<description><![CDATA[<p>NGS data are just a bunch of sequences, you have no idea which region in the genome each sequences comes from, which gene it represents...<br>To know that you have to align the sequences to the reference sequence. The reference sequence is in most cases the full genome sequence but sometimes, a library of EST sequences is used.<br>In either way, aligning your sequence reads to the reference sequence is called mapping.</p>
<p>The most used mappers of DNA-seq data are&nbsp;<a href="http://bio-bwa.sourceforge.net/" target="_blank">BWA</a>&nbsp;and&nbsp;<a href="http://bowtie-bio.sourceforge.net/bowtie2/index.shtml" target="_blank">Bowtie</a>&nbsp;for DNA-Seq data and&nbsp;<a href="http://tophat.cbcb.umd.edu/" target="_blank">Tophat</a>,&nbsp;<a href="https://github.com/alexdobin/STAR" target="_blank">STAR</a>&nbsp;or&nbsp;<a href="http://www.ccb.jhu.edu/software/hisat/index.shtml" target="_blank">HISAT</a>&nbsp;for RNA-Seq data. Mappers differ in which options they can take in, how fast and how accurate they are. Bowtie is faster than BWA, but looses some sensitivity (does not map an equal amount of reads to the correct position in the genome).</p><p>Address of the bookmark: <a href="http://wiki.bits.vib.be/index.php/Mapping_of_NGS_data" rel="nofollow">http://wiki.bits.vib.be/index.php/Mapping_of_NGS_data</a></p>]]></description>
	<dc:creator>Abhimanyu Singh</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/researchlabs/view/858/the-centre-for-bioinformatics-biomarker-discovery-and-information-based-medicine-cibm</guid>
  <pubDate>Sun, 14 Jul 2013 12:31:38 -0500</pubDate>
  <link></link>
  <title><![CDATA[The Centre for Bioinformatics, Biomarker Discovery and Information-Based Medicine (CIBM)]]></title>
  <description><![CDATA[
<p>The Centre for Bioinformatics, Biomarker Discovery and Information-Based Medicine (CIBM) is committed to shortening the process of obtaining novel discoveries to achieve distinctively better outcomes in clinical practice and translational individualised medicine.</p>

<p>Link @ http://www.newcastle.edu.au/research-and-innovation/centre/cibm/about-us</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/32483/cla-contig-layout-authenticator</guid>
	<pubDate>Fri, 05 May 2017 05:58:36 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/32483/cla-contig-layout-authenticator</link>
	<title><![CDATA[CLA: Contig-Layout-Authenticator]]></title>
	<description><![CDATA[<p><span>To improve upon the shortcomings associated with the construction of draft genomes with Illumina paired-end sequencing, we developed Contig-Layout-Authenticator (CLA). The CLA pipeline can scaffold reference-sorted contigs based on paired reads, resulting in better assembled genomes. Moreover, CLA also hints at probable misassemblies and contaminations, for the users to cross-check before constructing the consensus draft. The CLA pipeline was designed and trained extensively on various bacterial genome datasets for the ordering and scaffolding of large repetitive contigs. The tool has been validated and compared favorably with other widely-used scaffolding and ordering tools using both simulated and real sequence datasets. CLA is a user friendly tool that requires a single command line input to generate ordered scaffolds.</span></p>
<p><span>Script&nbsp;https://sourceforge.net/projects/c-l-authenticator/files/</span></p><p>Address of the bookmark: <a href="http://journals.plos.org/plosone/article?id=10.1371/journal.pone.0155459" rel="nofollow">http://journals.plos.org/plosone/article?id=10.1371/journal.pone.0155459</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/pages/view/900/bioruby-ruby-packages-for-biologist</guid>
	<pubDate>Mon, 15 Jul 2013 01:36:28 -0500</pubDate>
	<link>https://bioinformaticsonline.com/pages/view/900/bioruby-ruby-packages-for-biologist</link>
	<title><![CDATA[BioRuby :Ruby packages for biologist]]></title>
	<description><![CDATA[<p>BioRuby is a package of Open Source Ruby code, with classes for DNA and protein sequence analysis, alignment, database parsing, and other Bioinformatics tools.<br />BioRuby project provides an integrated environment in bioinformatics for the Ruby language. This project is supported by University of Tokyo (Human Genome Center), Kyoto University(Bioinformatics Center) and the Open Bio Foundation. The project was supported by Information-technology Promotion Agency (IPA) as an Exploratory Software Project in 2005<br />RubyForge is a home for open source Ruby projects: RubyForge is a home for open source Ruby projects. BioRuby project was started in late 2000, and is still in progress. Currently, there are over 80 files and 15,000 lines (except comment-only lines) in our source code. This might be equivalent to twice or more lines of other languages because of Ruby's extremely high descriptive power.</p><p>Classes for <br />Multiple alignment (Bio::Alignment), <br />Gene Ontology(Bio::GO), <br />PDB (Bio::PDB), <br />FANTOM database(Bio::FANTOM), <br />GFF (Bio::GFF) and KEGG<br />Orthology (Bio::KEGG::KO).</p><p>They also added support for many applications such as PSORT, SOSUI, TargetP, TMHMM, GenScan, ClustalW, MAFFT, and KEGG API.</p><p>Wiki Links<br />http://bioruby.open-bio.org/wiki/BioRubyOnRails<br />http://dev.bioruby.org/en/</p><p>BioRuby in Anger<br />http://dev.bioruby.org/en/?BioRuby+in+Anger</p><p>BioRuby RDocs<br />http://bioruby.org/rdoc/</p><p>BioRuby Tutorial Website<br />http://dev.bioruby.org/en/?Tutorial.rd</p><p>Why BioRuby Hub for BioRuby<br />http://www.linuxjournal.com/article/5915</p><p>Social Coding Hub for BioRuby<br />http://www.linuxjournal.com/article/5915</p><p>Bioinformatics on Rails: BioRuby Tutorial<br />http://bioinforuby.blogspot.com/2008/02/bioruby-tutorial.html</p><p>RRA BioRuby<br />http://raa.ruby-lang.org/project/bioruby/</p><p>BioRuby Project Discussion Group<br />http://portal.open-bio.org/mailman/listinfo/bioruby</p><p>BioRuby related Projects: Project tree<br />http://rubyforge.org/softwaremap/trove_list.php?form_cat=252</p><p>Reference<br />http://www.jsbi.org/journal/GIW03/GIW03P191.pdf</p>]]></description>
	<dc:creator>Jitendra Narayan</dc:creator>
</item>

</channel>
</rss>