<?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/44481?offset=30</link>
	<atom:link href="https://bioinformaticsonline.com/related/44481?offset=30" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/43859/mumco-is-a-simple-bash-script-that-uses-whole-genome-alignment-information-provided-by-mummer-v4-to-detect-variants</guid>
	<pubDate>Wed, 27 Apr 2022 04:34:12 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/43859/mumco-is-a-simple-bash-script-that-uses-whole-genome-alignment-information-provided-by-mummer-v4-to-detect-variants</link>
	<title><![CDATA[MUM&amp;Co is a simple bash script that uses Whole Genome Alignment information provided by MUMmer (v4) to detect variants.]]></title>
	<description><![CDATA[<p dir="auto">MUM&amp;Co is able to detect:<br>Deletions, insertions, tandem duplications and tandem contractions (&gt;=50bp &amp; &lt;=150kb)<br>Inversions (&gt;=1kb) and translocations (&gt;=10kb)</p><p>Address of the bookmark: <a href="https://github.com/SAMtoBAM/MUMandCo" rel="nofollow">https://github.com/SAMtoBAM/MUMandCo</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/42963/davi-deep-learning-based-tool-for-alignment-and-single-nucleotide-variant-identification</guid>
	<pubDate>Tue, 16 Mar 2021 05:41:33 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/42963/davi-deep-learning-based-tool-for-alignment-and-single-nucleotide-variant-identification</link>
	<title><![CDATA[DAVI: Deep learning-based tool for alignment and single nucleotide variant identification]]></title>
	<description><![CDATA[<p>DAVI consists of models for both global and local alignment and for variant calling. We have evaluated the performance of DAVI against existing state-of-the-art tool sets and found that its accuracy and performance is comparable to existing tools used for bench-marking. We further demonstrate that while existing tools are based on data generated from a specific sequencing technology, the models proposed in DAVI are generic and can be used across different NGS technologies as well as across different species</p>
<p>https://iopscience.iop.org/article/10.1088/2632-2153/ab7e19/pdf</p><p>Address of the bookmark: <a href="https://github.com/gguptaiitd/NEAT" rel="nofollow">https://github.com/gguptaiitd/NEAT</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34543/acana-an-accurate-and-consistent-alignment-tool-for-dna-sequences</guid>
	<pubDate>Wed, 06 Dec 2017 09:45:29 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34543/acana-an-accurate-and-consistent-alignment-tool-for-dna-sequences</link>
	<title><![CDATA[ACANA: An accurate and consistent alignment tool for DNA sequences]]></title>
	<description><![CDATA[<p><span>ACANA is an accurate and consistent alignment tool for DNA sequences. ACANA is specifically designed for aligning sequences that share only some moderately conserved regions and/or have a high frequency of long insertions or deletions. It attempts to combine the best of local and global alignments algorithms in searching for evolutionarily related regions of sequences in order to achieve the best alignment. ACANA is also robust to the small changes of alignment parameters, particularly the gap extension score. As an accurate alignment tool, ACANA is particularly useful in comparative sequence analysis for identifying conserved functional regulatory elements.</span></p><p>Address of the bookmark: <a href="https://www.niehs.nih.gov/research/resources/software/biostatistics/acana/index.cfm" rel="nofollow">https://www.niehs.nih.gov/research/resources/software/biostatistics/acana/index.cfm</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/35400/zpicture-a-dynamic-blastz-alignment-visualization</guid>
	<pubDate>Tue, 30 Jan 2018 16:03:08 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/35400/zpicture-a-dynamic-blastz-alignment-visualization</link>
	<title><![CDATA[zPicture: A dynamic blastz alignment visualization]]></title>
	<description><![CDATA[<p><span>zPicture is a dynamic alignment and&nbsp;</span><span>visualization</span><span>&nbsp;tool that is based on blastz alignment program utilized by PipMaker. zPicture alignments can be automatically submitted to rVista 2.0 to identify conserved transcription factor binding sites.</span></p><p>Address of the bookmark: <a href="https://zpicture.dcode.org/" rel="nofollow">https://zpicture.dcode.org/</a></p>]]></description>
	<dc:creator>Archana Malhotra</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36935/assemblytics-delta-file-to-analyze-alignments-of-an-assembly-to-another-assembly-or-a-reference-genome</guid>
	<pubDate>Thu, 14 Jun 2018 07:31:00 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36935/assemblytics-delta-file-to-analyze-alignments-of-an-assembly-to-another-assembly-or-a-reference-genome</link>
	<title><![CDATA[assemblytics: delta file to analyze alignments of an assembly to another assembly or a reference genome]]></title>
	<description><![CDATA[Download and install MUMmer
Align your assembly to a reference genome using nucmer (from MUMmer package)
$ nucmer -maxmatch -l 100 -c 500 REFERENCE.fa ASSEMBLY.fa -prefix OUT
Consult the MUMmer manual if you encounter problems

Optional: Gzip the delta file to speed up upload (usually 2-4X faster)
$ gzip OUT.delta
Then use the OUT.delta.gz file for upload.
Upload the .delta or delta.gz file (view example) to Assemblytics
Important: Use only contigs rather than scaffolds from the assembly. This will prevent false positives when the number of Ns in the scaffolded sequence does not match perfectly to the distance in the reference.

The unique sequence length required represents an anchor for determining if a sequence is unique enough to safely call variants from, which is an alternative to the mapping quality filter for read alignment.

http://assemblytics.com/<p>Address of the bookmark: <a href="http://assemblytics.com/" rel="nofollow">http://assemblytics.com/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37674/qualimap2-evaluating-next-generation-sequencing-alignment-data</guid>
	<pubDate>Tue, 11 Sep 2018 04:44:29 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37674/qualimap2-evaluating-next-generation-sequencing-alignment-data</link>
	<title><![CDATA[Qualimap2: Evaluating next generation sequencing alignment data]]></title>
	<description><![CDATA[<p><strong>Qualimap 2</strong><span>&nbsp;is a platform-independent application written in Java and R that provides both a Graphical User Inteface (GUI) and a command-line interface to facilitate the quality control of alignment sequencing data and its derivatives like feature counts.&nbsp;</span><br><br><span>Supported types of experiments include:</span></p>
<ul>
<li>Whole-genome sequencing</li>
<li>Whole-exome sequencing</li>
<li>RNA-seq (speical mode available)</li>
<li>ChIP-seq</li>
</ul><p>Address of the bookmark: <a href="http://qualimap.bioinfo.cipf.es/" rel="nofollow">http://qualimap.bioinfo.cipf.es/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/39837/cactus-a-reference-free-whole-genome-multiple-alignment-program</guid>
	<pubDate>Mon, 12 Aug 2019 07:52:33 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/39837/cactus-a-reference-free-whole-genome-multiple-alignment-program</link>
	<title><![CDATA[Cactus: a reference-free whole-genome multiple alignment program]]></title>
	<description><![CDATA[<p>Cactus is a reference-free whole-genome multiple alignment program. The principal algorithms are described here:&nbsp;<a href="https://doi.org/10.1101/gr.123356.111">https://doi.org/10.1101/gr.123356.111</a></p>
<p><span>Cactus uses substantial resources. For primate-sized genomes (3 gigabases each), you should expect Cactus to use approximately 120 CPU-days of compute per genome, with about 120 GB of RAM used at peak. The requirements scale roughly quadratically, so aligning two 1-megabase bacterial genomes takes only 1.5 CPU-hours and 14 GB RAM.</span>&nbsp;</p><p>Address of the bookmark: <a href="https://github.com/ComparativeGenomicsToolkit/cactus" rel="nofollow">https://github.com/ComparativeGenomicsToolkit/cactus</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/41910/the-wavefront-alignment-wfa-algorithm</guid>
	<pubDate>Sun, 28 Jun 2020 10:17:50 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/41910/the-wavefront-alignment-wfa-algorithm</link>
	<title><![CDATA[The wavefront alignment (WFA) algorithm]]></title>
	<description><![CDATA[<p><span>The wavefront alignment (WFA) algorithm is an exact gap-affine algorithm that takes advantage of</span><br><span>homologous regions between the sequences to accelerate the alignment process. As opposed to traditional dynamic programming algorithms that run in quadratic time, the WFA runs in time O(ns), proportional to the read length n and the alignment score s, using O(s^2) memory. Moreover, the WFA exhibits simple data dependencies that can be easily vectorized, even by the automatic features of modern compilers, for different architectures, without the need to adapt the code.</span></p><p>Address of the bookmark: <a href="https://github.com/smarco/WFA" rel="nofollow">https://github.com/smarco/WFA</a></p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/44887/alfapang-alignment-free-algorithm-for-pangenome-graph-construction</guid>
	<pubDate>Thu, 28 Aug 2025 02:56:35 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/44887/alfapang-alignment-free-algorithm-for-pangenome-graph-construction</link>
	<title><![CDATA[AlfaPang: alignment free algorithm for pangenome graph construction]]></title>
	<description><![CDATA[<p><span>AlfaPang constructs variation graphs, leveraging its alignment-free and reference-free approach, based solely on intrinsic sequence properties. This design allows AlfaPang's runtime and memory usage to scale linearly with the size of input sequences, enabling it to handle significantly larger genome sets compared to other methods.</span></p><p>Address of the bookmark: <a href="https://github.com/AdamCicherski/AlfaPang" rel="nofollow">https://github.com/AdamCicherski/AlfaPang</a></p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/27845/cnidaria-fast-reference-free-phylogenomic-clustering</guid>
	<pubDate>Thu, 16 Jun 2016 17:55:17 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/27845/cnidaria-fast-reference-free-phylogenomic-clustering</link>
	<title><![CDATA[CNIDARIA: fast, reference-free phylogenomic clustering]]></title>
	<description><![CDATA[<p>Motivation: Identification of biological specimens is a major requirement for a range of applications. Reference-free methods analyse unprocessed sequencing data without relying on prior knowledge, but these do not scale to arbitrarily large genomes and arbitrarily large phylogenetic distances.</p>
<p>Results: We present Cnidaria, a practical tool for clustering genomic and transcriptomic data with no limitation on ge-nome size or phylogenetic distances. We successfully simultaneously clustered 169 genomic and transcriptomic datasets from 4 kingdoms, achieving 100% accuracy at supra-species level and 78% accuracy for species level.</p>
<p>Availability and Implementation: Cnidaria is written in C++ and Python and is available at http://www.ab.wur.nl/cnidaria.</p>
<p>Contact: Saulo Aflitos - sauloal@gmail.com</p>
<p>Supplementary information: Supplementary data are available at Bioinformatics online.</p><p>Address of the bookmark: <a href="https://github.com/sauloal/cnidaria/wiki" rel="nofollow">https://github.com/sauloal/cnidaria/wiki</a></p>]]></description>
	<dc:creator>Shruti Paniwala</dc:creator>
</item>

</channel>
</rss>