<?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/34543?offset=10</link>
	<atom:link href="https://bioinformaticsonline.com/related/34543?offset=10" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/44559/metagraph-ultra-scalable-framework-for-dna-search-alignment-assembly</guid>
	<pubDate>Sat, 08 Jun 2024 16:15:25 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/44559/metagraph-ultra-scalable-framework-for-dna-search-alignment-assembly</link>
	<title><![CDATA[MetaGraph: Ultra Scalable Framework for DNA Search, Alignment, Assembly]]></title>
	<description><![CDATA[<p><span>The MetaGraph framework</span><span>&nbsp;is designed to work with a wide range of input data sets, indexing from a few samples up to the contents of entire archives with hundreds of thousands of records. The indexing workflow always follows the same principle, transforming single input samples into error-removed, refined sample graphs, which are then merged into a joint metagraph index. Each input sample is annotated in the joint index as a subgraph. This graph index enriched with metadata can then be used for downstream applications such as&nbsp;</span><a href="https://metagraph.ethz.ch/#query">sequence search</a><span>&nbsp;or&nbsp;</span><a href="https://metagraph.ethz.ch/#assembly">differential assembly</a><span>.</span></p>
<p><span>Searcg link&nbsp;https://metagraph.ethz.ch/search&nbsp;</span></p>
<p><span>Pre-print&nbsp;https://www.biorxiv.org/content/10.1101/2020.10.01.322164v4&nbsp;</span></p><p>Address of the bookmark: <a href="https://metagraph.ethz.ch/" rel="nofollow">https://metagraph.ethz.ch/</a></p>]]></description>
	<dc:creator>Abhi</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34571/mugsy-multiple-whole-genome-alignment-tool</guid>
	<pubDate>Fri, 08 Dec 2017 17:41:14 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34571/mugsy-multiple-whole-genome-alignment-tool</link>
	<title><![CDATA[Mugsy: multiple whole genome alignment tool]]></title>
	<description><![CDATA[<p><span>Mugsy is a multiple whole genome aligner. Mugsy uses Nucmer for pairwise alignment, a custom graph based segmentation procedure for identifying collinear regions, and the segment-based progressive multiple alignment strategy from Seqan::TCoffee. Mugsy accepts draft genomes in the form of multi-FASTA files and does not require a reference genome.</span></p>
<p>To cite Mugsy, use:</p>
<p>Angiuoli SV and Salzberg SL.&nbsp;<a href="http://bioinformatics.oxfordjournals.org/content/27/3/334">Mugsy: Fast multiple alignment of closely related whole genomes.</a><em>Bioinformatics</em>&nbsp;2011 27(3):334-4</p><p>Address of the bookmark: <a href="http://mugsy.sourceforge.net/" rel="nofollow">http://mugsy.sourceforge.net/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/40212/kalign-fast-multiple-sequence-alignment-program-for-biological-sequences</guid>
	<pubDate>Fri, 01 Nov 2019 00:20:41 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/40212/kalign-fast-multiple-sequence-alignment-program-for-biological-sequences</link>
	<title><![CDATA[Kalign: fast multiple sequence alignment program for biological sequences.]]></title>
	<description><![CDATA[<p><span>Kalign is a fast multiple sequence alignment program for biological sequences.</span></p>
<p>Align sequences and output the alignment in MSF format:</p>
<pre><code>kalign -i BB11001.tfa -f msf  -o out.msf
</code></pre>
<p>Align sequences and output the alignment in clustal format:</p>
<pre><code>kalign -i BB11001.tfa -f clu -o out.clu
</code></pre>
<p>Re-align sequences in an existing alignment:</p>
<pre><code>kalign -i BB11001.msf  -o out.afa
</code></pre>
<p>Reformat existing alignment:</p>
<pre><code>kalign -i BB11001.msf -r afa -o out.afa</code></pre><p>Address of the bookmark: <a href="https://github.com/TimoLassmann/kalign" rel="nofollow">https://github.com/TimoLassmann/kalign</a></p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36607/tarean-a-computational-tool-for-identification-and-characterization-of-satellite-dna-from-unassembled-short-reads</guid>
	<pubDate>Tue, 15 May 2018 02:53:11 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36607/tarean-a-computational-tool-for-identification-and-characterization-of-satellite-dna-from-unassembled-short-reads</link>
	<title><![CDATA[TAREAN: A computational tool for identification and characterization of satellite DNA from unassembled short reads]]></title>
	<description><![CDATA[<p><strong>TA</strong>ndem&nbsp;<strong>RE</strong>peat&nbsp;<strong>AN</strong>alyzer -TAREAN &ndash; is a computational pipeline for&nbsp;<strong>unsupervised identification of satellite repeats</strong>&nbsp;from unassembled sequence reads. The pipeline uses low-pass whole genome sequence reads and performs their graph-based clustering. Resulting clusters, representing all types of repeats, are then examined for the presence of circular structures and putative satellite repeats are reported.</p>
<p><em><strong>How to use TAREAN</strong></em>:</p>
<ul>
<li>Install a local instance of the pipeline using its source code available from&nbsp;<a href="https://bitbucket.org/petrnovak/repex_tarean" target="_blank" title="TAREAN source code">bitbucket repository</a>.</li>
<li>Use&nbsp; public Galaxy-based server at&nbsp;<a href="https://repeatexplorer-elixir.cerit-sc.cz/" target="_blank">https://repeatexplorer-elixir.cerit-sc.cz/</a>. The server is provided in frame of the&nbsp;<a href="https://www.elixir-czech.cz/" target="_blank">Elixir CZ project</a>&nbsp;and is maintained by&nbsp;<a href="https://www.cesnet.cz/" target="_blank">CESNET</a>&nbsp;and&nbsp;<a href="https://www.cerit-sc.cz/en/index.html" target="_blank">CERIT-SC</a>. Simple registration is required to use this service.</li>
</ul>
<p>Development of TAREAN was supported by&nbsp;<a href="https://www.elixir-czech.cz/" target="_blank" title="ELIXIR-CZ">ELIXIR CZ</a>&nbsp;research infrastructure project (MEYS Grant No: LM2015047).</p>
<p><strong><em>References</em></strong></p>
<p>Novak, P., Avila Robledillo, L., Koblizkova, A., Vrbova, I., Neumann, P., Macas, J. (2017) &ndash;&nbsp;<a href="https://academic.oup.com/nar/article/3574061/" target="_blank">TAREAN: a computational tool for identification and characterization of satellite DNA from unassembled short reads</a>.&nbsp;<em>Nucleic Acids Res.</em>, doi:10.1093/nar/gkx257</p><p>Address of the bookmark: <a href="https://bitbucket.org/petrnovak/repex_tarean" rel="nofollow">https://bitbucket.org/petrnovak/repex_tarean</a></p>]]></description>
	<dc:creator>Surabhi Chaudhary</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/38501/fgenesh-program-for-predicting-multiple-genes-in-genomic-dna-sequences</guid>
	<pubDate>Thu, 20 Dec 2018 11:55:08 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/38501/fgenesh-program-for-predicting-multiple-genes-in-genomic-dna-sequences</link>
	<title><![CDATA[FGENESH - Program for predicting multiple genes in genomic DNA sequences]]></title>
	<description><![CDATA[<p>FGENESH is the fastest (50-100 times faster than GenScan) and most accurate gene finder available - see the figure and the table below. In recent rice genome sequencing projects, it was cited "the most successful (gene finding) program (Yu&nbsp;<em>et al</em>. (2002) Science 296:79) and was used to produce 87% of all high-evidence predicted genes (Goff&nbsp;<em>et al</em>. (2002) Science 296:79).</p><p>Address of the bookmark: <a href="http://www.softberry.com/berry.phtml?topic=fgenesh&amp;group=help&amp;subgroup=gfind" rel="nofollow">http://www.softberry.com/berry.phtml?topic=fgenesh&amp;group=help&amp;subgroup=gfind</a></p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/32376/diamond</guid>
	<pubDate>Thu, 27 Apr 2017 04:21:54 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/32376/diamond</link>
	<title><![CDATA[DIAMOND]]></title>
	<description><![CDATA[<p><span>DIAMOND is a sequence aligner for protein and translated DNA searches and functions as a drop-in replacement for the NCBI BLAST software tools. It is suitable for protein-protein search as well as DNA-protein search on short reads and longer sequences including contigs and assemblies, providing a speedup of BLAST ranging up to x20,000.</span></p>
<p><span>More at&nbsp;file:///home/urbe/Downloads/diamond_manual.pdf</span></p>
<p><span>http://www.nature.com/nmeth/journal/v12/n1/full/nmeth.3176.html</span></p><p>Address of the bookmark: <a href="https://github.com/bbuchfink/diamond" rel="nofollow">https://github.com/bbuchfink/diamond</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/43799/kast</guid>
	<pubDate>Wed, 23 Feb 2022 08:28:36 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/43799/kast</link>
	<title><![CDATA[KAST]]></title>
	<description><![CDATA[<p><span>Perform Alignment-free k-tuple frequency comparisons from sequences. This can be in the form of two input files (e.g. a reference and a query) or a single file for pairwise comparisons to be made.</span></p><p>Address of the bookmark: <a href="https://github.com/martinjvickers/KAST" rel="nofollow">https://github.com/martinjvickers/KAST</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>
<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/39872/miropeats-discovers-regions-of-sequence-similarity-amongst-any-set-of-dna-sequences</guid>
	<pubDate>Mon, 26 Aug 2019 17:55:24 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/39872/miropeats-discovers-regions-of-sequence-similarity-amongst-any-set-of-dna-sequences</link>
	<title><![CDATA[Miropeats: discovers regions of sequence similarity amongst any set of DNA sequences]]></title>
	<description><![CDATA[<p><span>Miropeats discovers regions of sequence similarity amongst any set of DNA sequences and then presents this similarity information graphically. Sequence similarity searching is a very general tool that forms the basis of many different biological sequence analyses but it is limited by the verbosity of traditional alignment presentation styles. Miropeats enhances the utility of conventional DNA sequence comparisons when looking at long lengths of sequence similarity by summarizing extensive large scale sequence similarities on a single page of graphics. The latest version of Miropeats can be used as a general pairwise alignment program or in its traditional role sorting out a big mess of overlapping or similar regions.</span></p><p>Address of the bookmark: <a href="http://www.littlest.co.uk/software/bioinf/old_packages/miropeats/" rel="nofollow">http://www.littlest.co.uk/software/bioinf/old_packages/miropeats/</a></p>]]></description>
	<dc:creator>Poonam Mahapatra</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/42359/dnasp-dna-sequence-polymorphism-is-a-software-package-for-the-analysis-of-dna-polymorphisms</guid>
	<pubDate>Wed, 25 Nov 2020 19:51:38 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/42359/dnasp-dna-sequence-polymorphism-is-a-software-package-for-the-analysis-of-dna-polymorphisms</link>
	<title><![CDATA[DnaSP: DNA Sequence Polymorphism, is a software package for the analysis of DNA polymorphisms]]></title>
	<description><![CDATA[<p><span>DnaSP, DNA Sequence Polymorphism, is a software package for the analysis of DNA polymorphisms using data from a single locus (a multiple sequence aligned -MSA data), or from several loci (a Multiple-MSA data, such as formats generated by some assembler RAD-seq software). DnaSP can estimate several measures of DNA sequence variation within and between populations in noncoding, synonymous or nonsynonymous sites, or in various sorts of codon positions), as well as linkage disequilibrium, recombination, gene flow and gene conversion parameters.</span></p><p>Address of the bookmark: <a href="http://www.ub.edu/dnasp/" rel="nofollow">http://www.ub.edu/dnasp/</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>

</channel>
</rss>