<?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/33955?offset=0</link>
	<atom:link href="https://bioinformaticsonline.com/related/33955?offset=0" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/33942/mulan-multiple-sequence-local-alignment-and-conservation-visualization-tool</guid>
	<pubDate>Thu, 20 Jul 2017 08:02:32 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/33942/mulan-multiple-sequence-local-alignment-and-conservation-visualization-tool</link>
	<title><![CDATA[Mulan: MUltiple sequence Local AligNment and conservation visualization tool]]></title>
	<description><![CDATA[<p><span>Mulan performs multiple (2 or more) sequence alignments with an efficient and rapid "full local" alignment strategy that ensures a recapitulation of evolutionary sequence rearrangements (such as inversions and reshuffling) in any of the species. It combines&nbsp;</span><a href="http://www.bx.psu.edu/miller_lab/" target="_new"><em>refine</em>&nbsp;and&nbsp;<em>tba</em></a><span>&nbsp;tools to align either "draft" or "finished" quality sequences. Mulan provides a dynamic graphical interface to align and visualize conservation profiles for evolutionarily distant and closely related species.</span><br><span></span></p>
<p><span>Input formats, automated data upload from the&nbsp;</span><a href="http://genome.ucsc.edu/" target="_new">UCSC Genome Browser</a><span>, gene annotation, annotation of repetitive elements, and progress report were previously described in the&nbsp;</span><a href="https://zpicture.dcode.org/zpInstructions.html" target="_zp">zPicture instructions</a><span>&nbsp;and we refer the users to these materials for more details. This introduction is mainly focused on some novel features unique to the Mulan.</span><span><br></span></p><p>Address of the bookmark: <a href="https://mulan.dcode.org/mulanInstructions.php" rel="nofollow">https://mulan.dcode.org/mulanInstructions.php</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/39689/msaprobs-parallel-and-accurate-multiple-sequence-alignment</guid>
	<pubDate>Tue, 09 Jul 2019 23:58:44 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/39689/msaprobs-parallel-and-accurate-multiple-sequence-alignment</link>
	<title><![CDATA[MSAProbs - Parallel and accurate multiple sequence alignment]]></title>
	<description><![CDATA[<p><strong>MSAProbs</strong><span>&nbsp;is a well-established state-of-the-art multiple sequence alignment algorithm for protein sequences. The design of MSAProbs is based on a combination of pair hidden Markov models and partition functions to calculate posterior probabilities. Assessed using the popular benchmarks: BAliBASE, PREFAB, SABmark and OXBENCH, MSAProbs achieves statistically significant accuracy improvements over the existing top performing aligners, including ClustalW, MAFFT, MUSCLE, ProbCons and Probalign. In addition, MSAProbs is optimized for shared-memory CPUs by employing a multi-threaded design, and further parallelized for distributed-memory systems using MPI to overcome high memory overhead barrier and achieve good parallel and data-size scalability.</span></p><p>Address of the bookmark: <a href="http://msaprobs.sourceforge.net/homepage.htm#latest" rel="nofollow">http://msaprobs.sourceforge.net/homepage.htm#latest</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/videolist/watch/2791/ncbi-psi-blast-tutorial</guid>
	<pubDate>Fri, 23 Aug 2013 02:25:02 -0500</pubDate>
	<link>https://bioinformaticsonline.com/videolist/watch/2791/ncbi-psi-blast-tutorial</link>
	<title><![CDATA[NCBI PSI-BLAST Tutorial]]></title>
	<description><![CDATA[<iframe width="" height="" src="https://www.youtube-nocookie.com/embed/T3kHEieyylk" frameborder="0" allowfullscreen></iframe>http:--www.biotechnology.jhu.edu-
Tutorial for PSI-BLAST, an extension of BLAST that uses matrix algebra. BLAST is a cornerstone bioinformatics tool at NCBI. BLAST is the
Basic Local Alignment Search tool and will protein and DNA sequences that
are related to a sequence that the user provides.]]></description>
	
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/27333/satsuma-highly-sensitive-whole-genome-synteny-alignments</guid>
	<pubDate>Fri, 13 May 2016 05:25:26 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/27333/satsuma-highly-sensitive-whole-genome-synteny-alignments</link>
	<title><![CDATA[SATSUMA : Highly sensitive whole-genome synteny alignments.]]></title>
	<description><![CDATA[<p>Satsuma is a whole-genome synteny alignment program. It takes two genomes, computes alignments, and then keeps only the parts that are orthologous, i.e. following the conserved order and orientation of features, such as protein coding genes, non-coding genes, or neutral sequences. Satsuma does not require any pre-processing, such as repeat masking, since it will automatically detect ambiguous mappings.<br> <br> Satsuma has parallelization built-in and is designed to run on multi-core architectures. The run-time for aligning two bird-size genomes (~1.2 Gb) is around two days on 24 CPUs. <br> <br> You can find the manual <a href="http://satsuma.sourceforge.net/manual.html">here</a>.<br> Download the latest source code from <a href="https://sourceforge.net/projects/satsuma/">here.</a><br> Stable versions can also be downloaded from the <a href="https://www.broadinstitute.org/science/programs/genome-biology/spines">Broad Institute's</a> web site.<br> <br> An incomplete list of questions and answers (yes, these have really been asked by our users! Please feel free to add your own by e-mailing us) is <a href="http://satsuma.sourceforge.net/faq.html">here</a>.<br> <br> If you use Satsuma in your research, please cite:<br> <a href="http://bioinformatics.oxfordjournals.org/content/26/9/1145.long">Grabherr, M. G., Russell, P., Meyer, M., Mauceli, E., Alf&ouml;ldi, J., Di Palma, F., &amp; Lindblad-Toh, K. (2010). Genome-wide synteny through highly sensitive sequence alignment: Satsuma. Bioinformatics, 26(9), 1145-51</a>.</p>
<p><strong>Tutorial at http://evomics.org/learning/genomics/satsuma/</strong></p><p>Address of the bookmark: <a href="http://satsuma.sourceforge.net/" rel="nofollow">http://satsuma.sourceforge.net/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/42965/nucl2vec-local-alignment-of-dna-sequences-using-distributed-vector-representation</guid>
	<pubDate>Tue, 16 Mar 2021 05:45:44 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/42965/nucl2vec-local-alignment-of-dna-sequences-using-distributed-vector-representation</link>
	<title><![CDATA[Nucl2Vec: Local alignment of DNA sequences using Distributed Vector Representation]]></title>
	<description><![CDATA[<p><span>We demonstrate a novel approach for</span><span>local alignment of DNA reads with respect to reference genome.</span><span>For this process we have used Skip-gram model for creating</span><span>encoding(Nucl2Vec) and k-nearest neighbor for the alignment.</span><span>With our new approach we have reduced computation cost for</span><span>local alignment , while achieving accuracy comparable to existing</span><span>defacto standard BWA-MEM tool.</span> </p>
<p><em>https://prakharg24.github.io/papers/401851.full.pdf</em></p><p>Address of the bookmark: <a href="https://prakharg24.github.io/papers/401851.full.pdf" rel="nofollow">https://prakharg24.github.io/papers/401851.full.pdf</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/40217/shouji-a-fast-and-efficient-pre-alignment-filter-for-sequence-alignment</guid>
	<pubDate>Mon, 04 Nov 2019 07:09:45 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/40217/shouji-a-fast-and-efficient-pre-alignment-filter-for-sequence-alignment</link>
	<title><![CDATA[Shouji: a fast and efficient pre-alignment filter for sequence alignment]]></title>
	<description><![CDATA[<p>The ability to generate massive amounts of sequencing data continues to overwhelm the processing capacity of existing algorithms and compute infrastructures. In this work, we explore the use of hardware/software co-design and hardware acceleration to significantly reduce the execution time of short sequence alignment, a crucial step in analyzing sequenced genomes.</p>
<p>&nbsp;<img src="https://github.com/BilkentCompGen/Shoji/raw/master/Figure1-GitHub.png" alt="image" style="border: 0px;"></p>
<p>We introduce Shouji, a highly parallel and accurate pre-alignment filter that remarkably reduces the need for computationally-costly dynamic programming algorithms. The first key idea of our proposed pre-alignment filter is to provide high filtering accuracy by correctly detecting all common subsequences shared between two given sequences. The second key idea is to design a hardware accelerator design that adopts modern FPGA (field-programmable gate array) architectures to further boost the performance of our algorithm.</p>
<p>More at <a href="https://github.com/CMU-SAFARI/Shouji">https://github.com/CMU-SAFARI/Shouji</a></p><p>Address of the bookmark: <a href="https://github.com/CMU-SAFARI/Shouji" rel="nofollow">https://github.com/CMU-SAFARI/Shouji</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37759/pandaseq-is-a-program-to-align-illumina-reads-optionally-with-pcr-primers-embedded-in-the-sequence-and-reconstruct-an-overlapping-sequence</guid>
	<pubDate>Fri, 21 Sep 2018 10:19:52 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37759/pandaseq-is-a-program-to-align-illumina-reads-optionally-with-pcr-primers-embedded-in-the-sequence-and-reconstruct-an-overlapping-sequence</link>
	<title><![CDATA[PANDASEQ is a program to align Illumina reads, optionally with PCR primers embedded in the sequence, and reconstruct an overlapping sequence.]]></title>
	<description><![CDATA[<p>Development packages for zlib and libbz2 are needed, as well as a standard compiler environment. On Ubuntu, this can be installed via:</p>
<pre><code>sudo apt-get install build-essential libtool automake zlib1g-dev libbz2-dev pkg-config
</code></pre>
<p>On MacOS, the Apple Developer tools and Fink (or MacPorts or Brew) must be installed, then:</p>
<pre><code>sudo fink install bzip2-dev pkgconfig</code></pre><p>Address of the bookmark: <a href="https://github.com/neufeld/pandaseq" rel="nofollow">https://github.com/neufeld/pandaseq</a></p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36739/blasr-mapping-single-molecule-sequencing-reads-using-basic-local-alignment-with-successive-refinement-blasr-theory-and-application</guid>
	<pubDate>Wed, 23 May 2018 06:54:32 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36739/blasr-mapping-single-molecule-sequencing-reads-using-basic-local-alignment-with-successive-refinement-blasr-theory-and-application</link>
	<title><![CDATA[BlasR Mapping single molecule sequencing reads using Basic Local Alignment with Successive Refinement (BLASR): Theory and Application,]]></title>
	<description><![CDATA[<p><span>BLASR (Basic Local Alignment with Successive Refinement) for mapping Single Molecule Sequencing (SMS) reads that are thousands to tens of thousands of bases long with divergence between the read and genome dominated by insertion and deletion error.</span></p>
<p>Here is how I use the blasr to align PacBio reads to the contigs (target.fasta). The &ldquo;target.fasta.sa&rdquo; is the suffix array from &ldquo;target.fasta&rdquo; generated by sawriter.</p>
<blockquote>
<p>blasr query.fa ./target.fasta -sa ./target.fasta.sa -bestn 40 -maxScore -500 -m 4 -nproc 24 -out target.m4 -maxLCPLength 15</p>
</blockquote>
<p>the output format option &ldquo;-m 4&Prime; generate the alignment coordinate. Not fully documented, but I can explain that to you.&nbsp;</p>
<p>I use a 24 cores / 48G ram server for the alignment. It took about 2 to 3 hours aligning 3G PacBio Reads to 10^6 sequences of short read contigs with a mean 3.5kbp length.</p><p>Address of the bookmark: <a href="http://bix.ucsd.edu/projects/blasr/" rel="nofollow">http://bix.ucsd.edu/projects/blasr/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37584/mulan-multiple-sequence-local-alignment-and-visualization-for-studying-function-and-evolution</guid>
	<pubDate>Fri, 24 Aug 2018 09:50:01 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37584/mulan-multiple-sequence-local-alignment-and-visualization-for-studying-function-and-evolution</link>
	<title><![CDATA[Mulan: Multiple-sequence local alignment and visualization for studying function and evolution]]></title>
	<description><![CDATA[<p>Mulan: Multiple-sequence local alignment and visualization for studying function and evolution</p>
<p><span>Mulan (</span><a href="https://www.ncbi.nlm.nih.gov/pmc/articles/PMC540288/#ref44">http://mulan.dcode.org/</a><span>), a novel method and a network server for comparing multiple draft and finished-quality sequences to identify functional elements conserved over evolutionary time. Mulan brings together several novel algorithms: the TBA multi-aligner program for rapid identification of local sequence conservation, and the multiTF program for detecting evolutionarily conserved transcription factor binding sites in multiple alignments. In addition, Mulan supports two-way communication with the GALA database; alignments of multiple species dynamically generated in GALA can be viewed in Mulan, and conserved transcription factor binding sites identified with Mulan/multiTF can be integrated and overlaid with extensive genome annotation data using GALA.</span></p><p>Address of the bookmark: <a href="https://www.ncbi.nlm.nih.gov/pmc/articles/PMC540288/" rel="nofollow">https://www.ncbi.nlm.nih.gov/pmc/articles/PMC540288/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/44481/unialigner-a-parameter-free-framework-for-fast-sequence-alignment</guid>
	<pubDate>Fri, 08 Mar 2024 23:36:12 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/44481/unialigner-a-parameter-free-framework-for-fast-sequence-alignment</link>
	<title><![CDATA[UniAligner: a parameter-free framework for fast sequence alignment]]></title>
	<description><![CDATA[<p>UniAligner (formerly, TandemAligner) is the first parameter-free algorithm for sequence alignment that introduces a sequence-dependent alignment scoring that automatically changes for any pair of compared sequences. Classical alignment approaches, such as the Smith-Waterman algorithm, that work well for most sequences, fail to construct biologically adequate alignments of extra-long tandem repeats (ETRs), such as human centromeres and immunoglobulin loci. This limitation was overlooked in the previous studies since the sequences of the centromeres and other ETRs across multiple genomes only became available recently.</p>
<p>More at https://www.nature.com/articles/s41592-023-01970-4</p><p>Address of the bookmark: <a href="https://github.com/seryrzu/unialigner" rel="nofollow">https://github.com/seryrzu/unialigner</a></p>]]></description>
	<dc:creator>Abhi</dc:creator>
</item>

</channel>
</rss>