<?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/15000?offset=1200</link>
	<atom:link href="https://bioinformaticsonline.com/related/15000?offset=1200" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/43892/choosing-the-right-ngs-sequencing-instrument-for-your-study</guid>
	<pubDate>Wed, 15 Jun 2022 00:37:29 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/43892/choosing-the-right-ngs-sequencing-instrument-for-your-study</link>
	<title><![CDATA[Choosing the Right NGS Sequencing Instrument for Your Study]]></title>
	<description><![CDATA[<p>The right sequencing instrument for your study depends on your project goal. Setting aside turnaround time and price, it essentially comes down to the numbers of reads and read length you need for your experiment. Below, we've described and compared metrics for each of the instruments available. If you&rsquo;re new to high-throughput sequencing and have questions about how you should design your sequencing run, fill out our&nbsp;<a href="https://genohub.com/ngs-consultation/"><span>free consultation form</span></a>&nbsp;and we'll get in touch with you to help.</p>
<p>More at&nbsp;https://genohub.com/ngs-instrument-guide/</p><p>Address of the bookmark: <a href="https://genohub.com/ngs-instrument-guide/" rel="nofollow">https://genohub.com/ngs-instrument-guide/</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/blog/view/44229/common-steps-for-reads-mapping</guid>
	<pubDate>Thu, 09 Mar 2023 02:48:02 -0600</pubDate>
	<link>https://bioinformaticsonline.com/blog/view/44229/common-steps-for-reads-mapping</link>
	<title><![CDATA[Common steps for reads mapping !]]></title>
	<description><![CDATA[<div><div><div><div><div><div><div><div><div><div><p>Mapping reads to a reference genome is an essential step in many types of genomic analysis, such as variant calling and gene expression analysis. Here are some general steps to follow for mapping reads to a genome:</p><ol>
<li>
<p>Choose a read mapper: There are many read mappers available, such as BWA, Bowtie, and HISAT2. Choose a mapper that is appropriate for your type of data and research question.</p>
</li>
<li>
<p>Index the reference genome: Before mapping reads, the reference genome needs to be indexed. This involves creating an index of the genome sequence that allows the mapper to quickly find matches to the reads. Most mappers have their own indexing tools.</p>
</li>
<li>
<p>Prepare the read data: The reads should be in a format that is compatible with the mapper. Most mappers accept FASTQ or BAM files. Depending on the quality of the data, it may need to be filtered or trimmed before mapping.</p>
</li>
<li>
<p>Run the mapper: The mapper is run with the command-line interface or using a graphical user interface. The specific command depends on the mapper being used, but typically involves specifying the input data, reference genome, and output file format.</p>
</li>
<li>
<p>Evaluate the mapping results: After the mapping is complete, the results should be evaluated. This includes assessing the quality of the mapping, such as the mapping rate, the number of mapped reads, and the mapping quality score.</p>
</li>
<li>
<p>Post-processing: Depending on the analysis being performed, post-processing of the mapped reads may be necessary. This can include filtering reads based on quality, removing duplicate reads, and calling variants.</p>
</li>
</ol><p>Overall, mapping reads to a reference genome is a complex process that requires careful consideration of the type of data, the research question, and the specific mapper being used.</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/news/view/34711/1mb-long-dna-with-nanopore-technology</guid>
	<pubDate>Tue, 19 Dec 2017 18:49:28 -0600</pubDate>
	<link>https://bioinformaticsonline.com/news/view/34711/1mb-long-dna-with-nanopore-technology</link>
	<title><![CDATA[1mb long DNA with Nanopore technology]]></title>
	<description><![CDATA[<p>The first continuous DNA read of more than a million bases (&gt;1Mb) has been achieved, using Oxford Nanopore sequencing technology. Congratulations to Martin Smith and collaborators! Read more: http://bit.ly/2j5TNCO</p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37835/variantbam-filtering-and-profiling-of-next-generational-sequencing-data-using-region-specific-rules</guid>
	<pubDate>Thu, 04 Oct 2018 16:30:44 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37835/variantbam-filtering-and-profiling-of-next-generational-sequencing-data-using-region-specific-rules</link>
	<title><![CDATA[VariantBam: Filtering and profiling of next-generational sequencing data using region-specific rules]]></title>
	<description><![CDATA[<p>VariantBam is a tool to extract/count specific sets of sequencing reads from next-generational sequencing files. To save money, disk space and I/O, one may not want to store an entire BAM on disk. In many cases, it would be more efficient to store only those read-pairs or reads who intersect some region around the variant locations. Alternatively, if your scientific question is focused on only one aspect of the data (e.g. breakpoints), many reads can be removed without losing the information relevant to the problem.</p>
<h5>&nbsp;</h5><p>Address of the bookmark: <a href="https://github.com/broadinstitute/VariantBam" rel="nofollow">https://github.com/broadinstitute/VariantBam</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/38535/nanopack-visualizing-and-processing-long-read-sequencing-data</guid>
	<pubDate>Tue, 25 Dec 2018 21:20:50 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/38535/nanopack-visualizing-and-processing-long-read-sequencing-data</link>
	<title><![CDATA[NanoPack: visualizing and processing long-read sequencing data]]></title>
	<description><![CDATA[The NanoPack tools are written in Python3 and released under the GNU GPL3.0 License. The source code can be found at https://github.com/wdecoster/nanopack, together with links to separate scripts and their documentation. The scripts are compatible with Linux, Mac OS and the MS Windows 10 subsystem for Linux and are available as a graphical user interface, a web service at http://nanoplot.bioinf.be and command line tools.<p>Address of the bookmark: <a href="https://github.com/wdecoster/nanopack" rel="nofollow">https://github.com/wdecoster/nanopack</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/40544/ngs-bits-short-read-sequencing-tools</guid>
	<pubDate>Thu, 16 Jan 2020 23:14:00 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/40544/ngs-bits-short-read-sequencing-tools</link>
	<title><![CDATA[ngs-bits - Short-read sequencing tools]]></title>
	<description><![CDATA[<p>Binaries of&nbsp;<em>ngs-bits</em>&nbsp;are available via Bioconda. Alternatively,&nbsp;<em>ngs-bits</em>&nbsp;can be built from sources:</p>
<ul>
<li><span>Binaries</span>&nbsp;for&nbsp;<a href="https://github.com/imgag/ngs-bits/blob/master/doc/install_bioconda.md">Linux/macOS</a></li>
<li>From&nbsp;<span>sources</span>&nbsp;for&nbsp;<a href="https://github.com/imgag/ngs-bits/blob/master/doc/install_unix.md">Linux/macOS</a></li>
<li>From&nbsp;<span>sources</span>&nbsp;for&nbsp;<a href="https://github.com/imgag/ngs-bits/blob/master/doc/install_win.md">Windows</a></li>
</ul><p>Address of the bookmark: <a href="https://github.com/imgag/ngs-bits" rel="nofollow">https://github.com/imgag/ngs-bits</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/40754/understanding-your-reads-and-mapping</guid>
	<pubDate>Wed, 29 Jan 2020 06:29:55 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/40754/understanding-your-reads-and-mapping</link>
	<title><![CDATA[Understanding your reads and mapping !]]></title>
	<description><![CDATA[<p>One of the best tutorial for beginners ...</p>
<p>https://bioinformatics-core-shared-training.github.io/cruk-summer-school-2017/Day1/Session4-seqIntro.html</p><p>Address of the bookmark: <a href="https://bioinformatics-core-shared-training.github.io/cruk-summer-school-2017/Day1/Session4-seqIntro.html" rel="nofollow">https://bioinformatics-core-shared-training.github.io/cruk-summer-school-2017/Day1/Session4-seqIntro.html</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34579/moss-a-system-for-detecting-software-similarity</guid>
	<pubDate>Sat, 09 Dec 2017 08:59:07 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34579/moss-a-system-for-detecting-software-similarity</link>
	<title><![CDATA[MOSS: A System for Detecting Software Similarity]]></title>
	<description><![CDATA[<p><span>Moss (for a Measure Of Software Similarity) is an automatic system for determining the similarity of programs. To date, the main application of Moss has been in detecting plagiarism in programming classes. Since its development in 1994, Moss has been very effective in this role. The algorithm behind moss is a significant improvement over other cheating detection algorithms (at least, over those known to us).</span></p>
<p><span><span>Moss can currently analyze code written in the following languages:</span></span></p>
<p>C, C++, Java, C#, Python, Visual Basic, Javascript, FORTRAN, ML, Haskell, Lisp, Scheme, Pascal, Modula2, Ada, Perl, TCL, Matlab, VHDL, Verilog, Spice, MIPS assembly, a8086 assembly, a8086 assembly, MIPS assembly, HCL2.</p><p>Address of the bookmark: <a href="https://theory.stanford.edu/~aiken/moss/" rel="nofollow">https://theory.stanford.edu/~aiken/moss/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/17505/kau-thrissur-biotechbioinformatics-rasrfjrftraineestudentships</guid>
  <pubDate>Fri, 26 Sep 2014 20:07:28 -0500</pubDate>
  <link></link>
  <title><![CDATA[KAU Thrissur Biotech/Bioinformatics RA/SRF/JRF/Trainee/Studentships]]></title>
  <description><![CDATA[
<p>Applications are invited from eligible candidates for the following posts at Bioinformatics Centre (DIC), IT- BT Complex, College of Horticulture, Kerala Agricultural University, Vellanikkara, Thrissur.</p>

<p>1. Research Associate <br />Emoluments*: 14880/- + HRA 	<br />Qualification needed: Ph.D/M.Sc in Bioinformatics or Ph.D/M.Sc in Agriculture or Biotechnology with advanced Diploma in Bioinformatics <br />Desirable: 2 year experience in Bioinformatics.</p>

<p>2 Senior Research Fellow <br />Emoluments*: 10230/- 	<br />Qualification needed: M.Sc/ M.tech in Bioinformatics or M.Sc in Agriculture/ Biotechnology with Diploma in Bioinformatics. <br />Desirable: One year experience in Bioinformatics</p>

<p>3 Junior Research Fellow <br />Emoluments*: 9300/- 	<br />Qualification needed: M.Sc/ M.tech in Bioinformatics or M.Sc in Agriculture/Biotechnology/Plant Sciences with Diploma in Bioinformatics.</p>

<p>4 .Trainee/Studentship Bioinformatics <br />Emoluments*: 5000/- 	<br />Qualification needed: M.Sc in Bioinformatics with good knowledge of Bioinformatics softwares and tools.</p>

<p>5 Trainee/ Studentship Biotechnology <br />Emoluments*: 5000/- 	<br />Qualification needed: M.Sc in Biotechnology, with working knowledge in tissue culture, molecular markers and cloning of genes.</p>

<p>Candidates with the required qualifications and experience may give an application in the prescribed format with attested copies of certificates to prove eligibility on or before 30th November 2014. The applications are to be addressed to The Associate Dean, College of Horticulture and send to "Professor &amp; Coordinator, Bioinformatics Centre (DIC), IT-BT Complex, Kerala Agricultural University, Vellanikkara, Thrissur, Kerala 680 656”. The envelope may be superscribed “Application for the post at Bioinformatics Centre”.</p>

<p>*Emoluments are likely to be revised in 2014-2015</p>

<p>More at http://www.kaubic.in/downloads/Notification_bic.pdf<br />http://www.kaubic.in/downloads/Application%20form.pdf</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/35059/lrcstats-long-read-correction-statistics</guid>
	<pubDate>Fri, 05 Jan 2018 04:04:20 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/35059/lrcstats-long-read-correction-statistics</link>
	<title><![CDATA[LRCstats: Long Read Correction Statistics]]></title>
	<description><![CDATA[<p>LRCstats is an open-source pipeline for benchmarking DNA long read correction algorithms for long reads outputted by third generation sequencing technology such as machines produced by Pacific Biosciences. The reads produced by third generation sequencing technology, as the name suggests, are longer in length than reads produced by next generation sequencing technologies, such as those produced by Illumina. However, long reads are plagued by high error rates, which can cause issues in downstream analysis. Long read correction algorithms reduce the error rate of long reads either through self-correcting methods or using accurate, short reads outputted by next generation sequencing technologies to correct long reads.</p>
<p>Of course, some long read correction algorithms are better than others, and developers of long read correction algorithms will wish to compare their algorithm with others currently available. LRCstats benchmarks long read correction algorithms using long reads produced by simulators (such as SimLoRD or PBSim) where the two-way alignments between the uncorrected long reads (uLR) and the corresponding sequences in the reference genome (Ref) are given in some sort of alignment file and then aligning the corrected long reads (cLR) to the Ref-uLR two-way alignments to create three-way alignments using a dynamic programming algorithm. Statistics on these three-way alignments are then collected, such as the overall error rates of the corrected long reads.</p>
<p>https://www.healthcare.uiowa.edu/labs/au/LSC/</p><p>Address of the bookmark: <a href="https://github.com/cchauve/lrcstats" rel="nofollow">https://github.com/cchauve/lrcstats</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

</channel>
</rss>