<?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/42645?offset=30</link>
	<atom:link href="https://bioinformaticsonline.com/related/42645?offset=30" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/39640/flas-fast-and-high-throughput-algorithm-for-pacbio-long-read-self-correction</guid>
	<pubDate>Sat, 22 Jun 2019 12:16:39 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/39640/flas-fast-and-high-throughput-algorithm-for-pacbio-long-read-self-correction</link>
	<title><![CDATA[FLAS: fast and high throughput algorithm for PacBio long read self-correction.]]></title>
	<description><![CDATA[<p><span>FLAS, a wrapper algorithm of MECAT, to achieve high throughput long read self-correction while keeping MECAT's fast speed. FLAS finds additional alignments from MECAT prealigned long reads to improve the correction throughput, and removes misalignments for accuracy.</span></p><p>Address of the bookmark: <a href="https://github.com/baoe/flas" rel="nofollow">https://github.com/baoe/flas</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/40389/sequila-cov-a-fast-and-scalable-library-for-depth-of-coverage-calculations</guid>
	<pubDate>Sun, 15 Dec 2019 10:19:35 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/40389/sequila-cov-a-fast-and-scalable-library-for-depth-of-coverage-calculations</link>
	<title><![CDATA[SeQuiLa-cov: A fast and scalable library for depth of coverage calculations]]></title>
	<description><![CDATA[<p><span>The Docker image is available at&nbsp;</span><a href="https://hub.docker.com/r/biodatageeks/" target="">https://hub.docker.com/r/biodatageeks/</a><span>. Supplementary information on benchmarking procedure as well as test data are publicly accessible at the project documentation site&nbsp;</span><a href="http://biodatageeks.org/sequila/benchmarking/benchmarking.html#depth-of-coverage" target="">http://biodatageeks.org/sequila/benchmarking/benchmarking.html#depth-of-coverage</a><span>. An archival copy of the code and supporting data is also available via the GigaScience database GigaDB</span></p>
<p>&bull; Project name: SeQuiLa-cov</p>
<p>&bull; Project home page:&nbsp;<a href="http://biodatageeks.org/sequila/" target="">http://biodatageeks.org/sequila/</a></p>
<p>&bull; Source code repository:&nbsp;<a href="https://github.com/ZSI-Bio/bdg-sequila" target="">https://github.com/ZSI-Bio/bdg-sequila</a></p>
<p>&bull; Operating system: Platform independent</p>
<p>&bull; Programming language: Scala</p>
<p>&bull; Other requirements: Docker</p>
<p>&bull; License: Apache License 2.0</p><p>Address of the bookmark: <a href="https://academic.oup.com/gigascience/article/8/8/giz094/5543653" rel="nofollow">https://academic.oup.com/gigascience/article/8/8/giz094/5543653</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/43639/fastv-detect-virus</guid>
	<pubDate>Sat, 11 Dec 2021 08:04:10 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/43639/fastv-detect-virus</link>
	<title><![CDATA[fastv - detect virus]]></title>
	<description><![CDATA[<p><span>fastv is an ultra-fast tool for identification of SARS-CoV-2 and other microbes from sequencing data. It detects microbial sequences from FASTQ data, generates JSON reports and visualizes the result in HTML reports. This tool can be used to detect viral infectious diseases, like COVID-19. This tool supports both short reads (Illumina, BGI, etc.) and long reads (ONT, PacBio, etc.)</span></p><p>Address of the bookmark: <a href="https://github.com/OpenGene/fastv" rel="nofollow">https://github.com/OpenGene/fastv</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/44641/heliano-a-fast-and-accurate-tool-for-detection-of-helitron-like-elements</guid>
	<pubDate>Tue, 13 Aug 2024 07:16:34 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/44641/heliano-a-fast-and-accurate-tool-for-detection-of-helitron-like-elements</link>
	<title><![CDATA[HELIANO: A fast and accurate tool for detection of Helitron-like elements]]></title>
	<description><![CDATA[<p><span>Helitron-like elements (HLE1 and HLE2) are DNA transposons. They have been found in diverse species and seem to play significant roles in the evolution of host genomes. Although known for over twenty years, Helitron sequences are still challenging to identify. Here, we propose HELIANO (Helitron-like elements annotator) as an efficient solution for detecting Helitron-like elements.</span></p>
<p>https://academic.oup.com/nar/advance-article/doi/10.1093/nar/gkae679/7730539?login=true</p><p>Address of the bookmark: <a href="https://github.com/Zhenlisme/heliano/" rel="nofollow">https://github.com/Zhenlisme/heliano/</a></p>]]></description>
	<dc:creator>LEGE</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/26573/efficient-genome-searching-with-biostrings-and-the-bsgenome-data-package</guid>
	<pubDate>Mon, 07 Mar 2016 05:18:06 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/26573/efficient-genome-searching-with-biostrings-and-the-bsgenome-data-package</link>
	<title><![CDATA[Efficient genome searching with Biostrings and the BSgenome data package]]></title>
	<description><![CDATA[<p>Address of the bookmark: <a href="https://www.bioconductor.org/packages/3.3/bioc/vignettes/BSgenome/inst/doc/GenomeSearching.pdf" rel="nofollow">https://www.bioconductor.org/packages/3.3/bioc/vignettes/BSgenome/inst/doc/GenomeSearching.pdf</a></p>]]></description>
	<dc:creator>Aasha</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/blog/view/42664/common-bioinformatics-interview-questions</guid>
	<pubDate>Sat, 23 Jan 2021 06:07:50 -0600</pubDate>
	<link>https://bioinformaticsonline.com/blog/view/42664/common-bioinformatics-interview-questions</link>
	<title><![CDATA[Common Bioinformatics Interview Questions !]]></title>
	<description><![CDATA[<p>The possibility of an interview for a bioinformatics position in the life sciences may be very disquieting, but the same concerns emerge time and again in my experience. So, it is exceedingly worthwhile to plan for future bioinformatics interview questions. Doing this will really give you the advantage in obtaining the position.</p><p>The following 5 questions are those that I have heard many times during the job-search process. There is no reason for not planning responses in such situations.</p><p><strong>1. Tell Us About Yourself</strong><br />This is a very typical opener in interviews. It's a perfect question to ask, and getting something planned will really help you concentrate and ease in the conversation. However, you need to make sure that your response is applicable to the job you're interviewing.<br />It's probably better to keep your answer professional. Try to include these in the answer as well: where did your love of science and bioinformatics come from? How the heck did you end up in this field? Why programming and scripting ?</p><p><strong>2. What is your plan for your bioinformatics career? / How do you look at yourself in five years? / How are your personal objectives to accomplish these goals / What are the plan for your research fundings ?</strong></p><p>Your CV/resume has already impressed the selection panel if you have been invited for an interview. The questions from the bioinformatics interview team provide an incentive for you to market yourself and illustrate the work in question with the most appropriate knowledge.</p><p><strong>3. What do you understand about the job description/What would your suggested research path be if you were a successful candidate?</strong><br />Summarize the specifics of the advertised bioinformatics position in your own words. Follow on with some suggestions of how you want to extend your research and create your own projects within the community.</p><p><strong>4. Will you work as a group or do you want to work on your own?</strong><br />This requirement can vary from jobs to job, so when addressing, be alert. A company/research PI may need a bioinformatician that is able to work on a single project autonomously, or they may need a person who can help direct and organize a team. In your response, refer to the job description.</p><p><strong>5. What particular methods have you used to date with your experiments?</strong><br />You might have experience with all the laboratory techniques described in the job description, but stress the ones you highly experienced with. Highlight your professional abilities and stress that you are extremely capable of mastering new techniques with others ...</p><p>At the end of the day, remember that you're questioning the jury as well as they're interviewing you. You will ought to think of any questions you would like the interview panel to pose. This indicates that you have done your homework and serious about the position.</p><p>All the best for your future job interview.</p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/33461/graphmap-a-highly-sensitive-and-accurate-mapper-for-long-error-prone-reads</guid>
	<pubDate>Wed, 07 Jun 2017 04:18:16 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/33461/graphmap-a-highly-sensitive-and-accurate-mapper-for-long-error-prone-reads</link>
	<title><![CDATA[GraphMap - A highly sensitive and accurate mapper for long, error-prone reads]]></title>
	<description><![CDATA[<p>GraphMap - A highly sensitive and accurate mapper for long, error-prone reads http://www.nature.com/ncomms/2016/160415/ncomms11307/full/ncomms11307.html<br><br><strong>Features</strong><br><br>&nbsp;&nbsp;&nbsp; Mapping position agnostic to alignment parameters.<br>&nbsp;&nbsp;&nbsp; Consistently very high sensitivity and precision across different error profiles, rates and sequencing technologies even with default parameters.<br>&nbsp;&nbsp;&nbsp; Circular genome handling to resolve coverage drops near ends of the genome.<br>&nbsp;&nbsp;&nbsp; E-value.<br>&nbsp;&nbsp;&nbsp; Meaningful mapping quality.<br>&nbsp;&nbsp;&nbsp; Various alignment strategies (semiglobal bit-vector and Gotoh, anchored).<br>&nbsp;&nbsp;&nbsp; Overlapping of reads for de novo assembly.<br>&nbsp;&nbsp;&nbsp; Transcriptome mapping through internal construction of a transcriptome from a given genomic reference and a GTF file.<br>&nbsp;&nbsp;&nbsp; ...and much more.<br><br>GraphMap is also used as an overlapper in a new de novo genome assembly project called Ra (https://github.com/mariokostelac/ra-integrate).<br>Ra attempts to create de novo assemblies from raw nanopore and PacBio reads without requiring error correction, for which a highly sensitive overlapper is required.<br><br>Currently, development of a new spliced-alignment mode for mapping RNA-seq reads is under way.<br>Description of the current effort as well as how to reach the experimental implementation can be found here: doc/rnaseq.md.</p><p>Address of the bookmark: <a href="https://github.com/isovic/graphmap" rel="nofollow">https://github.com/isovic/graphmap</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/news/view/22793/sequencing-by-xpansion</guid>
	<pubDate>Wed, 17 Jun 2015 20:58:11 -0500</pubDate>
	<link>https://bioinformaticsonline.com/news/view/22793/sequencing-by-xpansion</link>
	<title><![CDATA[Sequencing By Xpansion]]></title>
	<description><![CDATA[<p>Sequencing By Xpansion (SBX) is a DNA sequencing method that uses a simple biochemical reaction to encode the sequence of a DNA molecule into a highly measurable surrogate called an Xpandomer. This single molecule approach produces enough Xpandomer in a single drop reaction to sequence an entire human genome 1000X over. To achieve this, an Xpandomer replaces each DNA sequence with a sequence of large, high signal reporter molecules using the SBX molecular expansion technology. The DNA sequence is then read out as the Xpandomer reporters pass sequentially through a nanopore detector. SBX is a molecular engineering platform that benefits from core design principles that separate the multiple molecular functions. This systems approach enables efficient development and incorporation of improvements to SBX and is key to reconfiguring and optimizing Xpandomer measurement for different detection platforms.</p><p>http://www.stratosgenomics.com/stratos-genomics-technology</p>]]></description>
	<dc:creator>Jitendra Narayan</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/27696/methylkit</guid>
	<pubDate>Fri, 03 Jun 2016 10:09:29 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/27696/methylkit</link>
	<title><![CDATA[methylKit]]></title>
	<description><![CDATA[<p><em>methylKit</em> is an <a href="http://en.wikipedia.org/wiki/R_%28programming_language%29">R</a> package for DNA methylation analysis and annotation from high-throughput bisulfite sequencing. The package is designed to deal with sequencing data from <a href="http://www.nature.com/nprot/journal/v6/n4/abs/nprot.2010.190.html">RRBS</a> and its variants, but also target-capture methods such as <a href="http://www.halogenomics.com/sureselect/methyl-seq">Agilent SureSelect methyl-seq</a>. In addition, methylKit can deal with base-pair resolution data for 5hmC obtained from Tab-seq or oxBS-seq. It can also handle whole-genome bisulfite sequencing data if proper input format is provided.</p><p>Address of the bookmark: <a href="https://github.com/al2na/methylKit" rel="nofollow">https://github.com/al2na/methylKit</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/28121/kaiju</guid>
	<pubDate>Mon, 27 Jun 2016 11:23:04 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/28121/kaiju</link>
	<title><![CDATA[Kaiju]]></title>
	<description><![CDATA[<p>Kaiju is a program for the taxonomic classification of metagenomic high-throughput sequencing reads. Each read is directly assigned to a taxon within the NCBI taxonomy by comparing it to a reference database containing microbial and viral protein sequences.</p>
<p>By default, Kaiju uses either the available complete genomes from NCBI RefSeq or the microbial subset of the non-redundant protein database <em>nr</em> used by NCBI BLAST, optionally also including fungi and microbial eukaryotes.</p>
<p>Kaiju translates reads into amino acid sequences, which are then searched in the database using a modified backward search on a memory-efficient implementation of the Burrows-Wheeler transform, which finds maximum exact matches (MEMs), optionally allowing mismatches in the protein alignment. The search can process up to millions of reads per minute using, for example, only 10 GB RAM with a protein database comprising 4821 microbial genomes. Kaiju can also be used for querying any other protein database without taxonomic classification, using either protein or nucleotide queries.</p>
<p>Kaiju is described in <a href="http://www.nature.com/ncomms/2016/160413/ncomms11257/full/ncomms11257.html">Menzel, P. et al. (2016) Fast and sensitive taxonomic classification for metagenomics with Kaiju. <em>Nat. Commun.</em> 7:11257</a> (open access).</p><p>Address of the bookmark: <a href="http://kaiju.binf.ku.dk/" rel="nofollow">http://kaiju.binf.ku.dk/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

</channel>
</rss>