<?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/36616?</link>
	<atom:link href="https://bioinformaticsonline.com/related/36616?" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/43795/anchorwave</guid>
	<pubDate>Wed, 23 Feb 2022 08:14:35 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/43795/anchorwave</link>
	<title><![CDATA[AnchorWave]]></title>
	<description><![CDATA[<p dir="auto">AnchorWave (Anchored Wavefront Alignment) identifies collinear regions via conserved anchors (full-length CDS and full-length exon have been implemented currently) and breaks collinear regions into shorter fragments, i.e., anchor and inter-anchor intervals. By performing sensitive sequence alignment for each shorter interval via a 2-piece affine gap cost strategy and merging them together, AnchorWave generates a whole-genome alignment for each collinear block. AnchorWave implements commands to guide collinear block identification with or without chromosomal rearrangements and provides options to use known polyploidy levels or whole-genome duplications to inform alignment.</p><p>Address of the bookmark: <a href="https://github.com/baoxingsong/AnchorWave" rel="nofollow">https://github.com/baoxingsong/AnchorWave</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/blog/view/14011/dynamic-chromosome-breakpoints</guid>
	<pubDate>Wed, 13 Aug 2014 18:38:10 -0500</pubDate>
	<link>https://bioinformaticsonline.com/blog/view/14011/dynamic-chromosome-breakpoints</link>
	<title><![CDATA[Dynamic chromosome breakpoints !!!]]></title>
	<description><![CDATA[<p>Cell division involves the distribution of identical genetic material, DNA, to two daughters&rsquo; cells. During this process, duplicated deoxyribonucleic acid (DNA) goes through a condensation and decondensation process. This is followed by nuclear envelope dissolution, mitotic spindle assembly, migration of the sister chromatid pairs to the metaphase plate, division and segregation of identical sets of chromosomes into daughter nuclei and nuclear envelope reformation.</p><p>The vital metaphase stage of cell division, when the sister chromatids migrated to the centre and lined up in a row, and pulled apart using attached microtubules in such a way that half the DNA ends up in each daughter cell. However, before the mitotic spindle‐mediated movement gets start and pulled DNA apart, the chromosomes are free to undergo <strong>recombination </strong>which involves the exchange of genetic material either between multiple chromosomes or between different regions of the same chromosome.</p><p><img src="http://www.sciencelearn.org.nz/var/sciencelearn/storage/images/contexts/uniquely-me/sci-media/images/chromosomes-crossing-over/464438-1-eng-NZ/Chromosomes-crossing-over.jpg" alt="image" width="504" height="342" style="border: 0px; border: 0px;"></p><p>During recombination, the precise breakage of each strand, exchange between the strands, and sealing of the resulting recombined molecules happens. The &ldquo;<strong>chromosomal breakpoints</strong>&rdquo; refers to these places where they break. Mostly, this process occurs with a high degree of accuracy at high frequency in both eukaryotic and prokaryotic cells. But occasionally this &ldquo;break and sealing/ break and reattach&rdquo; process goes wrong and the reattachment happens in the wrong place which usually create disaster (with few exceptions).These chromosome disaster or abnormalities involve the gain, loss or rearrangement of visible amounts of genetic material during cell division. These abnormalities are of two type, the first one is numerical abnormalities &nbsp;where severe disorders are caused by the loss or gain of whole chromosomes, which affect the copy number of hundreds or even thousands of genes. The second are structural abnormalities which can be unbalanced or balanced. The former are similar to numerical abnormalities in that genetic material is either gained or lost. The natural defects in chromosome segregation are linked to cancer and several genetic diseases (http://en.wikipedia.org/wiki/List_of_genetic_disorders). Therefore, the enzymes involved in regulating cell division are still the attractive drug targets for many diseases.</p><p>&nbsp;</p><p>&nbsp;</p><p><img src="http://upload.wikimedia.org/wikipedia/commons/4/4a/Chromosomal_translocations.svg" alt="image" width="424" height="331" style="border: 0px; border: 0px;"></p><p>&nbsp;</p><p>Apart from certain chromosome abnormalities, these &ldquo;crossing over&rdquo; of segments of maternal and paternal chromosomes to form hybrid chromosomes have some evolutionary importance and considered as a driver of genetic variation. Moreover, the chromosome breakage in evolution is considered to be non-random in nature(http://www.ploscompbiol.org/article/info%3Adoi%2F10.1371%2Fjournal.pcbi.0020014). In addition the study of breakpoint regions and non-breakpoint (stable) regions of chromosomes indicates both the regions evolved in distinctly different ways ( http://www.ncbi.nlm.nih.gov/pmc/articles/PMC2675965/). These breakage may lead to genetic diseases or participate to chromosomal rearranmgnets and contributed in development of new species.</p><p>I will try to explain the genome hotspots/Evolutionary Breakpoint Regions(EBRs)/fragile regions/weak fragments/&nbsp; in my next blog.</p><p><strong>Software for recombination detection:</strong></p><p><strong>RAT</strong> http://cbr.jic.ac.uk/dicks/software/RAT/</p><p><strong>Breakpointer</strong> https://github.com/ruping/Breakpointer</p><p><strong>DRP</strong> http://web.cbio.uct.ac.za/~darren/rdp.html</p><p><strong>RB-finder</strong> http://www.ncbi.nlm.nih.gov/pubmed/18707535</p><p><strong>LDhat2.0</strong> http://ldhat.sourceforge.net/LDhat2.0/instructions.shtml</p><p><strong>Reference:</strong></p><p>http://www.nature.com/scitable/topicpage/genetic-recombination-514#</p><p>Image: Wikipedia , sciencelearn.org.nz</p><p><strong>Recommended Articles:</strong></p><p>http://www.friendshipcircle.org/blog/2012/05/22/13-chromosomal-disorders-youve-never-heard-of/</p><p>http://web.udl.es/usuaris/e4650869/docencia/segoncicle/genclin98/recursos_classe_%28pdf%29/revisionsPDF/chromosyndromes.pdf</p><p>http://www.ncbi.nlm.nih.gov/pmc/articles/PMC2775595/table/T2/</p><p>http://learn.genetics.utah.edu/content/disorders/chromosomal/</p><p>http://www.ncert.nic.in/html/learning_basket/biology/cc&amp;cd.pdf</p>]]></description>
	<dc:creator>Jitendra Narayan</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/27076/ale-a-generic-assembly-likelihood-evaluation-framework-for-assessing-the-accuracy-of-genome-and-metagenome-assemblies</guid>
	<pubDate>Tue, 26 Apr 2016 03:38:43 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/27076/ale-a-generic-assembly-likelihood-evaluation-framework-for-assessing-the-accuracy-of-genome-and-metagenome-assemblies</link>
	<title><![CDATA[ALE: a Generic Assembly Likelihood Evaluation Framework for Assessing the Accuracy of Genome and Metagenome Assemblies]]></title>
	<description><![CDATA[<p>Assembly Likelihood Evaluation (ALE) framework that overcomes these limitations, systematically evaluating the accuracy of an assembly in a reference-independent manner using rigorous statistical methods. This framework is comprehensive, and integrates read quality, mate pair orientation and insert length (for paired-end reads), sequencing coverage, read alignment and k-mer frequency. ALE pinpoints synthetic errors in both single and metagenomic assemblies, including single-base errors, insertions/deletions, genome rearrangements and chimeric assemblies presented in metagenomes. At the genome level with real-world data, ALE identifies three large misassemblies from the Spirochaeta smaragdinae finished genome, which were all independently validated by Pacific Biosciences sequencing. At the single-base level with Illumina data, ALE recovers 215 of 222 (97%) single nucleotide variants in a training set from a GC-rich Rhodobacter sphaeroides genome. Using real Pacific Biosciences data, ALE identifies 12 of 12 synthetic errors in a Lambda Phage genome, surpassing even Pacific Biosciences' own variant caller, EviCons. In summary, the ALE framework provides a comprehensive, reference-independent and statistically rigorous measure of single genome and metagenome assembly accuracy, which can be used to identify misassemblies or to optimize the assembly process.</p>
<p>More at&nbsp;http://www.ncbi.nlm.nih.gov/pubmed/23303509</p><p>Address of the bookmark: <a href="http://sc932.github.io/ALE/about.html" rel="nofollow">http://sc932.github.io/ALE/about.html</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/35148/mojolicious-a-next-generation-web-framework-for-the-perl-programming-language</guid>
	<pubDate>Fri, 12 Jan 2018 16:48:10 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/35148/mojolicious-a-next-generation-web-framework-for-the-perl-programming-language</link>
	<title><![CDATA[mojolicious: a next generation web framework for the Perl programming language.]]></title>
	<description><![CDATA[<p><span>Back in the early days of the web, many people learned Perl because of a wonderful Perl library called&nbsp;</span><a href="https://metacpan.org/module/CGI" target="_blank">CGI</a><span>. It was simple enough to get started without knowing much about the language and powerful enough to keep you going, learning by doing was much fun. While most of the techniques used are outdated now, the idea behind it is not. Mojolicious is a new endeavor to implement this idea using bleeding edge technologies.</span></p>
<h2>Features</h2>
<ul>
<li>An amazing&nbsp;<strong>real-time web framework</strong>, allowing you to easily grow single file prototypes into well-structured MVC web applications.
<ul>
<li>Powerful out of the box with RESTful routes, plugins, commands, Perl-ish templates, content negotiation, session management, form validation, testing framework, static file server, CGI/<a href="http://plackperl.org/" target="_blank">PSGI</a>&nbsp;detection, first class Unicode support and much more for you to discover.</li>
</ul>
</li>
<li>A powerful&nbsp;<strong>web development toolkit</strong>, that you can use for all kinds of applications, independently of the web framework.
<ul>
<li>Full stack HTTP and WebSocket client/server implementation with IPv6, TLS, SNI, IDNA, HTTP/SOCKS5 proxy, UNIX domain socket, Comet (long polling), Promises/A+, keep-alive, connection pooling, timeout, cookie, multipart and gzip compression support.</li>
<li>Built-in non-blocking I/O web server, supporting multiple event loops as well as optional pre-forking and hot deployment, perfect for building highly scalable web services.</li>
<li>JSON and HTML/XML parser with CSS selector support.</li>
</ul>
</li>
<li>Very clean, portable and object-oriented pure-Perl API with no hidden magic and no requirements besides Perl 5.24.0 (versions as old as 5.10.1 can be used too, but may require additional CPAN modules to be installed)</li>
<li>Fresh code based upon years of experience developing&nbsp;<a href="http://catalystframework.org/" target="_blank">Catalyst</a>, free and open source.</li>
<li>Hundreds of 3rd party&nbsp;<a href="https://metacpan.org/requires/distribution/Mojolicious">extensions</a>&nbsp;and high quality spin-off projects like the&nbsp;<a href="https://metacpan.org/pod/Minion">Minion</a>&nbsp;job queue.</li>
</ul>
<p>http://mojolicious.org/</p><p>Address of the bookmark: <a href="http://mojolicious.org/" rel="nofollow">http://mojolicious.org/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/38489/biotite-a-general-framework-for-computational-biology</guid>
	<pubDate>Mon, 17 Dec 2018 18:52:27 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/38489/biotite-a-general-framework-for-computational-biology</link>
	<title><![CDATA[Biotite: A general framework for computational biology]]></title>
	<description><![CDATA[<p><span>The package is open source and freely available at GitHub (</span><span><a href="https://github.com/biotite-dev/biotite" target="_blank">https://github.com/biotite-dev/biotite</a></span><span>). This package is simple to use especially for the beginners in programming and computationally efficient because of the implementation of Numpy and Cython.&nbsp;Biotite consists of four sub packages: sequence, structure, databases, and application. The&nbsp;</span><em>sequence</em><span>&nbsp;and&nbsp;</span><em>structure</em><span>&nbsp;modules serve for the analysis of sequence and structural data analysis respectively,&nbsp;</span><em>database</em><span>&nbsp;downloads files from the other databases such as RCSB PDB, and&nbsp;</span><em>application</em><span>&nbsp;provides interface for external software.&nbsp;</span></p>
<p><span><span>The&nbsp;</span><em>Biotite</em><span>&nbsp;package bundles popular tasks in computational biology into an unifying framework, which is easy to use on the one hand side, but is also computationally efficient due to intensive usage of&nbsp;</span><em>NumPy</em><span>&nbsp;and&nbsp;</span><em>Cython</em><span>. This package focuses on working with sequence and structure data and supports various file formats and analysis and manipulation functions.</span></span></p><p>Address of the bookmark: <a href="https://github.com/biotite-dev/biotite" rel="nofollow">https://github.com/biotite-dev/biotite</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/40221/dash-a-web-application-framework-that-provides-pure-python-abstraction-around-html-css-and-javascript</guid>
	<pubDate>Tue, 05 Nov 2019 06:39:48 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/40221/dash-a-web-application-framework-that-provides-pure-python-abstraction-around-html-css-and-javascript</link>
	<title><![CDATA[Dash: a web application framework that provides pure Python abstraction around HTML, CSS, and JavaScript.]]></title>
	<description><![CDATA[<p style="margin-top: 0px; margin-bottom: 0.75rem;">Dash is a web application framework that provides pure Python abstraction around HTML, CSS, and JavaScript.</p>
<p style="margin-top: 0px; margin-bottom: 0.75rem;">Dash Bio is a suite of bioinformatics components that make it simpler to analyze and visualize bioinformatics data and interact with them in a Dash application.</p>
<p style="margin-top: 0px; margin-bottom: 0.75rem;">The source can be found on GitHub at<span>&nbsp;</span><a href="https://github.com/plotly/dash-bio">plotly/dash-bio</a>.</p>
<p style="margin-top: 0px; margin-bottom: 0.75rem;">These docs are using Dash Bio version 0.1.4.</p><p>Address of the bookmark: <a href="https://dash.plot.ly/dash-bio" rel="nofollow">https://dash.plot.ly/dash-bio</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36720/dupcar-reconstructing-contiguous-ancestral-regions-with-duplications</guid>
	<pubDate>Mon, 21 May 2018 11:09:02 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36720/dupcar-reconstructing-contiguous-ancestral-regions-with-duplications</link>
	<title><![CDATA[DUPCAR: Reconstructing Contiguous Ancestral Regions with Duplications]]></title>
	<description><![CDATA[we propose a heuristic algorithm, called DUPCAR, for reconstructing ancestral genomic orders with duplications. The method starts from the order of genes in modern genomes and predicts predecessor and successor relationships in the ancestor. Then a greedy algorithm is used to reconstruct the ancestral orders by connecting genes into contiguous regions based on predicted adjacencies. Computer simulation was used to validate the algorithm. We also applied the method to reconstruct the ancestral chromosome X of placental mammals and the ancestral genomes of the ciliate Paramecium tetraurelia.<p>Address of the bookmark: <a href="https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3205822/" rel="nofollow">https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3205822/</a></p>]]></description>
	<dc:creator>Jit</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/29282/cosmic</guid>
	<pubDate>Sat, 01 Oct 2016 15:04:10 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/29282/cosmic</link>
	<title><![CDATA[COSMIC]]></title>
	<description><![CDATA[<p>The accurate description and annotation of structural variants can be complex. &nbsp;This is due to the different resolution that variants are reported from traditional&nbsp;cytogenetic coordinates down to the actual base pair positions. Furthermore, multiple&nbsp;rearrangements in a single area of the genome can make cataloguing and interpreting&nbsp;their effects challenging.&nbsp;</p>
<p>The Rearrangement Overview page describes the one or more breakpoints which make up a structural&nbsp;variant. A breakpoint is defined as a region or point where the sample sequence has altered&nbsp;from the reference sequence. Minimum interpretation is made of this data. One variant event&nbsp;can consist of one or multiple breakpoints. The Syntax (shown above the table) gives a detailed description of the variant and its location &nbsp;(e.g. chr11:g.36585230_76606619del, a deletion of&nbsp;roughly 40Mb on chromosome 11). Syntax is based on HGVS mutation nomenclature recommendations&nbsp;[http://www.hgvs.org/rec.html].&nbsp;</p>
<p>http://cancer.sanger.ac.uk/cosmic/help/rearrangement/overview</p><p>Address of the bookmark: <a href="http://cancer.sanger.ac.uk/cosmic/help/rearrangement/overview" rel="nofollow">http://cancer.sanger.ac.uk/cosmic/help/rearrangement/overview</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<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>

</channel>
</rss>