<?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/37049?offset=210</link>
	<atom:link href="https://bioinformaticsonline.com/related/37049?offset=210" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/27261/segemehl</guid>
	<pubDate>Tue, 10 May 2016 08:10:15 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/27261/segemehl</link>
	<title><![CDATA[segemehl]]></title>
	<description><![CDATA[<p><span>segemehl is a software to map short sequencer reads to reference genomes. Unlike other methods, segemehl is able to detect not only mismatches but also insertions and deletions. Furthermore, segemehl is not limited to a specific read length and is able to map&nbsp;primer- or polyadenylation contaminated reads correctly.&nbsp; segemehl implements a matching strategy based on enhanced suffix arrays (ESA).&nbsp;</span></p>
<p><span>More at&nbsp;http://www.bioinf.uni-leipzig.de/Software/segemehl/</span></p>
<p><span>Manual&nbsp;http://www.bioinf.uni-leipzig.de/Software/segemehl/segemehl_manual_0_1_7.pdf</span></p><p>Address of the bookmark: <a href="http://hoffmann.bioinf.uni-leipzig.de/LIFE/segemehl.html" rel="nofollow">http://hoffmann.bioinf.uni-leipzig.de/LIFE/segemehl.html</a></p>]]></description>
	<dc:creator>Anjana</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/30144/bima-v3-an-aligner-customized-for-mate-pair-library-sequencing</guid>
	<pubDate>Wed, 14 Dec 2016 15:20:00 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/30144/bima-v3-an-aligner-customized-for-mate-pair-library-sequencing</link>
	<title><![CDATA[BIMA V3: an aligner customized for mate pair library sequencing]]></title>
	<description><![CDATA[<p>Summary: Mate pair library sequencing is an effective and economical method for detecting genomic structural variants and chromosomal abnormalities. Unfortunately, the mapping and alignment of mate pair read pairs to a reference genome is a challenging and <br>time consuming process for most NGS alignment programs. Large insert sizes, introduction of library preparation protocol artifacts (biotin junction reads, paired-end read contamination, chimeras, etc.), and presence of structural variant breakpoints within reads increases mapping and alignment complexity. We describe an algorithm that is up to 20 times faster and 25% more accurate than popular NGS alignment programs when processing mate pair sequencing. <br>Availability: http://bioinformaticstools.mayo.edu/research/bima/ <br>Contact: vasmatzis.george@mayo.edu</p><p>Address of the bookmark: <a href="http://bioinformatics.oxfordjournals.org/content/early/2014/02/12/bioinformatics.btu078.full.pdf" rel="nofollow">http://bioinformatics.oxfordjournals.org/content/early/2014/02/12/bioinformatics.btu078.full.pdf</a></p>]]></description>
	<dc:creator>Abhimanyu Singh</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37545/ncbi-magic-blast</guid>
	<pubDate>Tue, 14 Aug 2018 18:11:11 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37545/ncbi-magic-blast</link>
	<title><![CDATA[NCBI Magic-BLAST]]></title>
	<description><![CDATA[<p>Magic-BLAST is a tool for mapping large next-generation RNA or DNA sequencing runs against a whole genome or transcriptome. Each alignment optimizes a composite score, taking into account simultaneously the two reads of a pair, and in case of RNA-seq, locating the candidate introns and adding up the score of all exons. This is very different from other versions of BLAST, where each exon is scored as a separate hit and read-pairing is ignored.</p>
<p>Magic-BLAST incorporates within the NCBI BLAST code framework ideas developed in the NCBI Magic pipeline, in particular hit extensions by local walk and jump&nbsp;<a href="http://www.ncbi.nlm.nih.gov/pubmed/26109056">(http://www.ncbi.nlm.nih.gov/pubmed/26109056)</a>, and recursive clipping of mismatches near the edges of the reads, which avoids accumulating artefactual mismatches near splice sites and is needed to distinguish short indels from substitutions near the edges.</p>
<p>&nbsp;</p><p>Address of the bookmark: <a href="https://ncbi.github.io/magicblast/" rel="nofollow">https://ncbi.github.io/magicblast/</a></p>]]></description>
	<dc:creator>Jit</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/bookmarks/view/36746/soap2-short-oligonucleotide-analysis-package-2</guid>
	<pubDate>Wed, 23 May 2018 10:09:22 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36746/soap2-short-oligonucleotide-analysis-package-2</link>
	<title><![CDATA[SOAP2 : Short Oligonucleotide Analysis Package 2]]></title>
	<description><![CDATA[SOAPaligner/soap2 is a member of the SOAP (Short Oligonucleotide Analysis Package). It is an updated version of SOAP software for short oligonucleotide alignment. The new program features in super fast and accurate alignment for huge amounts of short reads generated by Illumina/Solexa Genome Analyzer. Compared to soap v1, it is one order of magnitude faster. It require only 2 minutes aligning one million single-end reads onto the human reference genome. Another remarkable improvement of SOAPaligner is that it now supports a wide range of the read length.

SOAPaligner benefitted in time and space efficiency by a revolution in the basic data structures and algorithms used.The core algorithms and the indexing data structures (2way-BWT) are developed by the algorithms research group of the Department of Computer Science, the University of Hong Kong (T.W. Lam, Alan Tam, Simon Wong, Edward Wu and S.M. Yiu).<p>Address of the bookmark: <a href="http://soap.genomics.org.cn/soapaligner.html" rel="nofollow">http://soap.genomics.org.cn/soapaligner.html</a></p>]]></description>
	<dc:creator>Poonam Mahapatra</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/41691/genobuntu-package-for-next-generation-sequencing-and-genome-assembly</guid>
	<pubDate>Mon, 18 May 2020 16:47:56 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/41691/genobuntu-package-for-next-generation-sequencing-and-genome-assembly</link>
	<title><![CDATA[Genobuntu: Package for Next Generation Sequencing and Genome Assembly]]></title>
	<description><![CDATA[<div>
<p>Genobuntu is a software package containing more than 70 software and packages oriented towards NGS. In its current version, Genobuntu supports pre assembly tools, genome assemblers as well as post assembly tools.<br><br>Commonly used biological software and example script files for different assembly pipelines have also been provided, where the example script files can be updated to suit one&rsquo;s experimental needs. Genobuntu attempts to reduce the amount of time and energy needed to build software workstations and it can also act as a good teaching source for a class room setting.<br><br>Therefore, Genobuntu offers a well-tailored environment for both novices and experts working in the field of genome assembly.</p>
</div>
<div>
<h3>Features</h3>
<ul>
<li>Velvet</li>
<li>MiB</li>
<li>SSAKE</li>
<li>EULER</li>
<li>VCAKE</li>
<li>ABySS</li>
<li>ALLPATHS</li>
<li>Celera</li>
<li>SHARCGS</li>
<li>Allpaths</li>
<li>IDBA</li>
<li>TAIPAN</li>
<li>Edena</li>
<li>SOAPdenovo</li>
<li>Maq</li>
<li>IDBA-UD</li>
<li>No. of Reads present in the Ref. Seq.</li>
<li>ART NGS Reads Simulator</li>
<li>HiTEC, FASTQC</li>
<li>Minimum Description Length</li>
<li>SOAPaligner</li>
<li>Sequencing Read Archive Toolkit</li>
</ul>
</div><p>Address of the bookmark: <a href="https://sourceforge.net/projects/genobuntu/" rel="nofollow">https://sourceforge.net/projects/genobuntu/</a></p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/news/view/40596/igblast-a-popular-ncbi-package-for-classifying-and-analyzing-immunoglobulin-ig-and-t-cell-receptor-tcr-variable-domain-sequences</guid>
	<pubDate>Thu, 23 Jan 2020 11:34:37 -0600</pubDate>
	<link>https://bioinformaticsonline.com/news/view/40596/igblast-a-popular-ncbi-package-for-classifying-and-analyzing-immunoglobulin-ig-and-t-cell-receptor-tcr-variable-domain-sequences</link>
	<title><![CDATA[IgBLAST: a popular NCBI package for classifying and analyzing immunoglobulin (IG) and T cell receptor (TCR) variable domain sequences]]></title>
	<description><![CDATA[<p>NCBI team released a new version of IgBLAST with four new improvements. IgBLAST is a popular NCBI package for classifying and analyzing immunoglobulin (IG) and T cell receptor (TCR) variable domain sequences. Improvements are:<span style="text-decoration: underline;"></span><span style="text-decoration: underline;"></span></p><p>&nbsp;&nbsp;&nbsp; 1. Support for the new FWR4 annotation feature in the AIRR format, both in standard format and in the AIRR alignment format.<span style="text-decoration: underline;"></span><span style="text-decoration: underline;"></span></p><p>&nbsp;&nbsp;&nbsp; 2. The previous &ldquo;-penalty&rdquo; parameter was renamed as -V_penalty to be consistent with other IgBLAST penalty options.<span style="text-decoration: underline;"></span><span style="text-decoration: underline;"></span></p><p>&nbsp;&nbsp;&nbsp; 3. Restored constant internal BLAST search parameters for domain annotation (i.e., FWR/CDR) such that this process is not influenced by user parameters.<span style="text-decoration: underline;"></span><span style="text-decoration: underline;"></span></p><p>&nbsp;&nbsp;&nbsp; 4. Corrected FWR/CDR annotations for certain mouse VK and rat VH germline genes.<span style="font-size: 12.8px;">&nbsp;</span></p><p><span style="text-decoration: underline;"></span></p><p>IgBLAST 1.15.0 is available for&nbsp;<a href="https://ftp.ncbi.nih.gov/blast/executables/igblast/release/LATEST/" target="_blank">download</a>&nbsp;from the BLAST FTP area. See the the new&nbsp;<a href="https://ncbi.github.io/igblast/" target="_blank">manual</a>&nbsp;on GitHub for information about setting up and running IgBLAST.</p><p><span style="text-decoration: underline;"></span></p><p>&nbsp;If you have any questions or concerns, please contact&nbsp;<a href="mailto:blast-help@ncbi.nlm.nih.gov" target="_blank" title="Follow link">blast-help@ncbi.nlm.nih.gov</a><span style="text-decoration: underline;"></span><span style="text-decoration: underline;"></span></p><p><span style="text-decoration: underline;"></span>&nbsp;</p>]]></description>
	<dc:creator>BioJoker</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/43101/luigi-a-python-package-that-helps-you-build-complex-pipelines-of-batch-jobs</guid>
	<pubDate>Thu, 24 Jun 2021 05:43:31 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/43101/luigi-a-python-package-that-helps-you-build-complex-pipelines-of-batch-jobs</link>
	<title><![CDATA[Luigi: a Python package that helps you build complex pipelines of batch jobs.]]></title>
	<description><![CDATA[<p>Luigi is a Python (3.6, 3.7, 3.8, 3.9 tested) package that helps you build complex pipelines of batch jobs. It handles dependency resolution, workflow management, visualization, handling failures, command line integration, and much more.</p>
<p>Run <code>pip install luigi</code> to install the latest stable version from <a href="https://pypi.python.org/pypi/luigi">PyPI</a>. <a href="https://luigi.readthedocs.io/en/stable/">Documentation for the latest release</a> is hosted on readthedocs.</p>
<p>Run <code>pip install luigi[toml]</code> to install Luigi with <a href="https://luigi.readthedocs.io/en/stable/configuration.html">TOML-based configs</a> support.</p><p>Address of the bookmark: <a href="https://github.com/spotify/luigi" rel="nofollow">https://github.com/spotify/luigi</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/view/119</guid>
	<pubDate>Wed, 10 Jul 2013 14:35:34 -0500</pubDate>
	<link>https://bioinformaticsonline.com/view/119</link>
	<title><![CDATA[Which are the best statistical programming languages to study for a bioinformatician?]]></title>
	<description><![CDATA[<p><span>In Bio-informatics based&nbsp;genome sequencing and predicting metabolic pathways&nbsp;research jobs&nbsp;I used Matlab, SAS, SPSS, R and several Bioconductor packages. Matlab had a lot of powerful tools and was easy to use, whereas SPSS is for non-programmers and R need programming skills. I am wondering what other people think is best? or there might not be one specific language but a few that lend themselves best to Bio-informatics work that is math heavy and deals with a large amount of data.</span></p>]]></description>
	<dc:creator>Jitendra Narayan</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/1720/postdoctoral-associate-bioinformatics-at-duke-university-medical-center</guid>
  <pubDate>Sat, 10 Aug 2013 18:38:38 -0500</pubDate>
  <link></link>
  <title><![CDATA[Postdoctoral Associate - Bioinformatics  at Duke University Medical Center]]></title>
  <description><![CDATA[
<p>The Department of Biostatistics and Bioinformatics at Duke University Medical Center is seeking a Postdoctoral Associate for a one year appointment to work on several high-dimensional research projects. The specific goals of the project are to identify genes or molecular markers that are predictive of clinical outcomes in renal and prostate cancer.</p>

<p>Candidates must have: a PhD degree in statistics, biostatistics or bioinformatics, extensive experience in analyzing high-dimensional data (microarray, SNP, CNVs) and of validation approaches. In addition, experience in penalized regression methods, data base manipulation; and strong programming skills in order to conduct Monte Carlo studies and applications (R). Candidate must have excellent communication skills (verbal, written and presentation), a strong proficiency in Linux system.</p>

<p>This position is available immediately and will be filled as soon as possible. Appointment could be extended beyond the first year based on additional funding.</p>

<p>For more information about the Department of Biostatistics and Bioinformatics, please visit our website: http://www.biostat.duke.edu.</p>

<p>For more info: http://biostat.duke.edu/sites/biostat.duke.edu/files/Halabi%20-%20Postdoc%20Job%20Posting%202013%20updated.pdf</p>

<p>Duke University is an Equal Opportunity/Affirmative Action Employer.</p>
]]></description>
</item>

</channel>
</rss>