<?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/36755?offset=320</link>
	<atom:link href="https://bioinformaticsonline.com/related/36755?offset=320" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/42143/sibelia-a-comparative-genomics-tool</guid>
	<pubDate>Sat, 22 Aug 2020 02:49:00 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/42143/sibelia-a-comparative-genomics-tool</link>
	<title><![CDATA[Sibelia: A comparative genomics tool]]></title>
	<description><![CDATA[<p><strong>Sibelia</strong>: A comparative genomics tool: It assists biologists in analysing the genomic variations that correlate with pathogens, or the genomic changes that help microorganisms adapt in different environments. Sibelia will also be helpful for the evolutionary and genome rearrangement studies for multiple strains of microorganisms.&nbsp;</p>
<p><strong>Sibelia</strong>&nbsp;is useful in finding: (1) shared regions, (2) regions that present in one group of genomes but not in others, (3) rearrangements that transform one genome to other genomes.</p>
<p>More at&nbsp;<a href="http://bioinf.spbau.ru/sibelia">http://bioinf.spbau.ru/sibelia</a></p>
<p>Sibelia docs&nbsp;<a href="http://gensoft.pasteur.fr/docs/Sibelia/3.0.7/SIBELIA.md">http://gensoft.pasteur.fr/docs/Sibelia/3.0.7/SIBELIA.md</a></p><p>Address of the bookmark: <a href="https://github.com/bioinf/Sibelia" rel="nofollow">https://github.com/bioinf/Sibelia</a></p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/42362/magic-a-tool-for-predicting-transcription-factors-and-cofactors-driving-gene-sets-using-encode-data</guid>
	<pubDate>Thu, 26 Nov 2020 11:05:04 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/42362/magic-a-tool-for-predicting-transcription-factors-and-cofactors-driving-gene-sets-using-encode-data</link>
	<title><![CDATA[MAGIC: A tool for predicting transcription factors and cofactors driving gene sets using ENCODE data]]></title>
	<description><![CDATA[<p><span>The algorithm presented herein,&nbsp;</span><strong>M</strong><span>ining&nbsp;</span><strong>A</strong><span>lgorithm for&nbsp;</span><strong>G</strong><span>enet</span><strong>I</strong><span>c&nbsp;</span><strong>C</strong><span>ontrollers (MAGIC), uses ENCODE ChIP-seq data to look for statistical enrichment of TFs and cofactors in gene bodies and flanking regions in gene lists without an&nbsp;</span><em>a priori</em><span>&nbsp;binary classification of genes as targets or non-targets. When compared to other TF mining resources, MAGIC displayed favourable performance in predicting TFs and cofactors that drive gene changes in 4 settings: </span></p>
<p><span>1) A cell line expressing or lacking single TF, </span></p>
<p><span>2) Breast tumors divided along PAM50 designations </span></p>
<p><span>3) Whole brain samples from WT mice or mice lacking a single TF in a particular neuronal subtype </span></p>
<p><span>4) Single cell RNAseq analysis of neurons divided by Immediate Early Gene expression levels. </span></p>
<p><span>In summary, MAGIC is a standalone application that produces meaningful predictions of TFs and cofactors in transcriptomic experiments.</span></p>
<p><span>More at&nbsp;https://uwmadison.app.box.com/s/8j90e5h2rjrsz3bacaxnq8kor2o64vyg</span></p><p>Address of the bookmark: <a href="https://github.com/asroopra/MAGIC" rel="nofollow">https://github.com/asroopra/MAGIC</a></p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/43867/genomeqc-a-quality-assessment-tool-for-genome-assemblies-and-gene-structure-annotations</guid>
	<pubDate>Thu, 19 May 2022 04:29:05 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/43867/genomeqc-a-quality-assessment-tool-for-genome-assemblies-and-gene-structure-annotations</link>
	<title><![CDATA[GenomeQC: a quality assessment tool for genome assemblies and gene structure annotations]]></title>
	<description><![CDATA[<p><span>The GenomeQC web application is implemented in R/Shiny version 1.5.9 and Python 3.6 and is freely available at&nbsp;</span><a href="https://genomeqc.maizegdb.org/">https://genomeqc.maizegdb.org/</a><span>&nbsp;under the GPL license. All source code and a containerized version of the GenomeQC pipeline is available in the GitHub repository&nbsp;</span><a href="https://github.com/HuffordLab/GenomeQC">https://github.com/HuffordLab/GenomeQC</a><span>.</span></p>
<p>https://bmcgenomics.biomedcentral.com/articles/10.1186/s12864-020-6568-2</p><p>Address of the bookmark: <a href="https://github.com/HuffordLab/GenomeQC" rel="nofollow">https://github.com/HuffordLab/GenomeQC</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/44501/minda-a-tool-for-evaluating-structural-variant-sv-callers</guid>
	<pubDate>Sun, 31 Mar 2024 02:43:50 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/44501/minda-a-tool-for-evaluating-structural-variant-sv-callers</link>
	<title><![CDATA[Minda: a tool for evaluating structural variant (SV) callers]]></title>
	<description><![CDATA[<p dir="auto">Minda is a tool for evaluating structural variant (SV) callers that</p>
<ul dir="auto">
<li>standardizes VCF records for compatibility with both germline and somatic SV callers,</li>
<li>benchmarks against a single VCF input file, or</li>
<li>benchmarks against an ensemble call set created from multiple VCF input files.</li>
</ul><p>Address of the bookmark: <a href="https://github.com/KolmogorovLab/minda" rel="nofollow">https://github.com/KolmogorovLab/minda</a></p>]]></description>
	<dc:creator>LEGE</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/videolist/watch/2759/dynamic-programming-alignment</guid>
	<pubDate>Thu, 22 Aug 2013 09:38:28 -0500</pubDate>
	<link>https://bioinformaticsonline.com/videolist/watch/2759/dynamic-programming-alignment</link>
	<title><![CDATA[Dynamic Programming Alignment]]></title>
	<description><![CDATA[<iframe width="" height="" src="https://www.youtube-nocookie.com/embed/EWJnDMKBEv0" frameborder="0" allowfullscreen></iframe>lecture 9, Chem. C100, Spring 2013, UCLA]]></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/31012/genomecomp</guid>
	<pubDate>Fri, 17 Feb 2017 08:38:32 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/31012/genomecomp</link>
	<title><![CDATA[GenomeComp]]></title>
	<description><![CDATA[<p>GenomeComp is a tool for summarizing, parsing and visualizing the genome wide sequence comparison results derived from voluminous BLAST textual output, so as to locate the rearrangements, insertions or deletions of genome segments between species or strains.<br><br>It can be easily used to compare, parsing and visualize large genomic sequences, especially closely related genomes such as inter-species or inter-strains. In addition, it can also show other sequence features like repeat sequence distributions in one whole-genome DNA sequence by comparing the genome to itself.<br><br>It is a stand-alone graphical user interface (GUI) program which runs on Linux, Unix, Mac OS X (tested on version 10.2.4 only) and Microsoft Windows platforms and is written in Perl/Tk.</p><p>Address of the bookmark: <a href="http://www.mgc.ac.cn/GenomeComp/" rel="nofollow">http://www.mgc.ac.cn/GenomeComp/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/31064/cgaln</guid>
	<pubDate>Wed, 22 Feb 2017 05:14:15 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/31064/cgaln</link>
	<title><![CDATA[Cgaln]]></title>
	<description><![CDATA[<p>Cgaln (Coarse grained alignment) is a program designed to align a pair of whole genomic sequences of not only bacteria but also entire chromosomes of vertebrates on a nominal desktop computer. Cgaln performs an alignment job in two steps, at the block level and then at the nucleotide level. The former "coarse-grained" alignment can explore genomic rearrangements and reduce the regions to be analyzed in the next step. The latter is devoted to detailed alignment within the limited regions found in the first stage. The output of Cgaln is 'glocal' in the sense that rearrangements are taken into consideration while each alignable region is extended as long as possible. Thus, Cgaln is not only fast and memory-efficient, but also can filter noisy outputs without missing the most important homologous segment pairs.</p>
<p>http://www.iam.u-tokyo.ac.jp/chromosomeinformatics/rnakato/cgaln/</p><p>Address of the bookmark: <a href="http://www.iam.u-tokyo.ac.jp/chromosomeinformatics/rnakato/cgaln/" rel="nofollow">http://www.iam.u-tokyo.ac.jp/chromosomeinformatics/rnakato/cgaln/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/32633/a-post-assembly-genome-improvement-toolkit-pagit-to-obtain-annotated-genomes-from-contigs</guid>
	<pubDate>Fri, 12 May 2017 10:50:29 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/32633/a-post-assembly-genome-improvement-toolkit-pagit-to-obtain-annotated-genomes-from-contigs</link>
	<title><![CDATA[A Post-assembly genome-improvement toolkit (PAGIT) to obtain annotated genomes from contigs]]></title>
	<description><![CDATA[<p>PAGIT addresses the need for software to generate high quality draft genomes. It is based on a series of programs that we developed:</p>
<p><a href="https://sourceforge.net/projects/abacas/files/">ABACAS</a>, that is able to contiguate contigs from a de novo assembly against a closely related reference.</p>
<p><a href="https://sourceforge.net/projects/image2/files/">IMAGE</a>, an iterative approach for closing gaps in assembled genomes using mate pair information. It is able to close gaps left open by the assembler in a draft genome, even when using the same data sets as used by the original assembler.</p>
<p><a href="http://icorn.sourceforge.net/">iCORN</a>, that enables errors in the consensus sequence to be corrected by iteratively mapping reads to the current assembly. An improved version, especially correction Pacfic Bioscience assemblies (PacBio) can be found&nbsp;<a href="ftp://ftp.sanger.ac.uk/pub4/resources/software/pagit/ICORN2/icorn2.V0.95.tgz">here</a>.</p>
<p><a href="https://ratt.svn.sourceforge.net/svnroot/ratt">RATT</a>, a tool to transfer the annotation from a reference genome, or an earlier assembly, onto the latest assembly.</p>
<p>PAGIT bundles these software and makes them more accessible for users.</p><p>Address of the bookmark: <a href="http://www.sanger.ac.uk/science/tools/pagit" rel="nofollow">http://www.sanger.ac.uk/science/tools/pagit</a></p>]]></description>
	<dc:creator>Abhimanyu Singh</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/33006/avid-a-global-alignment-program</guid>
	<pubDate>Wed, 24 May 2017 05:19:28 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/33006/avid-a-global-alignment-program</link>
	<title><![CDATA[AVID: A Global Alignment Program]]></title>
	<description><![CDATA[<p>A new global alignment method called AVID. The method is designed to be fast, memory efficient, and practical for sequence alignments of large genomic regions up to megabases long. We present numerous applications of the method, ranging from the comparison of assemblies to alignment of large syntenic genomic regions and whole genome human/mouse alignments. We have also performed a quantitative comparison of AVID with other popular alignment tools. To this end, we have established a format for the representation of alignments and methods for their comparison. These formats and methods should be useful for future studies. The tools we have developed for the alignment comparisons, as well as the AVID program, are publicly available. See Web Site References section for AVID Web address and Web addresses for other programs discussed in this paper.</p><p>Address of the bookmark: <a href="https://www.ncbi.nlm.nih.gov/pmc/articles/PMC430967/" rel="nofollow">https://www.ncbi.nlm.nih.gov/pmc/articles/PMC430967/</a></p>]]></description>
	<dc:creator>Archana Malhotra</dc:creator>
</item>

</channel>
</rss>