<?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/19555?offset=1290</link>
	<atom:link href="https://bioinformaticsonline.com/related/19555?offset=1290" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34461/drawid-user-friendly-java-software-for-chromosome-measurements-and-idiogram-drawing</guid>
	<pubDate>Mon, 27 Nov 2017 16:03:49 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34461/drawid-user-friendly-java-software-for-chromosome-measurements-and-idiogram-drawing</link>
	<title><![CDATA[DRAWID: user-friendly Java software for chromosome measurements and idiogram drawing]]></title>
	<description><![CDATA[<p>"DRAWID has number of advantages including a user-friendly interactive interface, possibility for simultaneous chromosome and FISH/GISH/banding signal measurement and idiogram drawing as well as number of useful functions facilitating the procedure of chromosome analysis," explain the scientists.</p>
<p>"The output of the program is Microsoft XL table and publish-ready idiogram picture."</p>
<div>
<p>Find their paper openly published with us at:&nbsp;<a href="https://doi.org/10.3897/compcytogen.v11i4.20830" target="_blank">https://doi.org/10.3897/compcytogen.v11i4.20830</a></p>
</div><p>Address of the bookmark: <a href="https://compcytogen.pensoft.net/articles.php?id=20830" rel="nofollow">https://compcytogen.pensoft.net/articles.php?id=20830</a></p>]]></description>
	<dc:creator>Robert M Willioms</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/blog/view/44219/chromosome-breakpoint-a-breakup-to-remember</guid>
	<pubDate>Tue, 07 Mar 2023 13:31:54 -0600</pubDate>
	<link>https://bioinformaticsonline.com/blog/view/44219/chromosome-breakpoint-a-breakup-to-remember</link>
	<title><![CDATA[Chromosome breakpoint - a breakup to remember]]></title>
	<description><![CDATA[<div><div><div><div><div><div><div><div><div><div><p>Chromosome breakpoint refers to the physical location where a chromosome is broken and rearranged. Chromosome breakage can occur spontaneously or be induced by environmental factors such as radiation, chemicals, or viruses. The rearrangement of genetic material resulting from a chromosome breakpoint can have important consequences, including the development of genetic diseases, chromosomal abnormalities, or cancer.</p><p>Chromosome breakpoints can occur in two ways: interstitial or terminal. Interstitial breakpoints occur within the chromosome, while terminal breakpoints occur at the end of the chromosome. Terminal breakpoints can lead to the loss of genetic material, whereas interstitial breakpoints can result in the duplication or deletion of genetic material.</p><p>Chromosome breakpoints can be detected using a variety of techniques, including cytogenetic analysis, fluorescence in situ hybridization (FISH), and molecular methods such as polymerase chain reaction (PCR) and next-generation sequencing (NGS). These techniques can also help identify the exact location of the breakpoint and the nature of the rearrangement, such as translocations, inversions, deletions, or duplications.</p><p>Translocations are one of the most common types of chromosome rearrangements caused by breakpoints. In a translocation, genetic material is exchanged between two different chromosomes, resulting in a balanced or unbalanced distribution of genetic material. Unbalanced translocations can cause genetic diseases or developmental abnormalities, while balanced translocations can be inherited without any apparent phenotypic effects.</p><p>Inversions occur when a chromosome segment is inverted, resulting in a change in the order of genetic material. Inversions can be pericentric, involving the centromere, or paracentric, not involving the centromere. Inversions can cause genetic diseases or phenotypic effects if they disrupt the function of essential genes or regulatory elements.</p><p>Deletions and duplications are caused by interstitial breakpoints that result in the loss or gain of genetic material. Deletions can cause genetic diseases or developmental abnormalities if they involve essential genes or regulatory elements. Duplications can also have phenotypic effects, depending on the location and size of the duplicated segment.</p><p>Chromosome breakpoints can also be involved in the formation of complex chromosomal rearrangements, such as ring chromosomes or dicentric chromosomes. These complex rearrangements can have important clinical implications, as they can cause genetic diseases or cancer.</p><p>In conclusion, chromosome breakpoints are important genetic events that can lead to the rearrangement of genetic material and have important clinical implications. The detection and characterization of chromosome breakpoints using cytogenetic, molecular, and genomic methods are essential for the diagnosis, prognosis, and treatment of genetic diseases and cancer. Further research is needed to understand the molecular mechanisms underlying chromosome breakage and to develop new therapies targeting these events.</p></div></div></div></div></div></div></div></div></div></div>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/videolist/watch/4094/manufacturing-life-with-j-craig-venter</guid>
	<pubDate>Thu, 29 Aug 2013 08:52:26 -0500</pubDate>
	<link>https://bioinformaticsonline.com/videolist/watch/4094/manufacturing-life-with-j-craig-venter</link>
	<title><![CDATA[Manufacturing Life with J. Craig Venter]]></title>
	<description><![CDATA[<iframe width="" height="" src="https://www.youtube-nocookie.com/embed/PKtozMvSsBk" frameborder="0" allowfullscreen></iframe>J. Craig Venter, CEO of Synthetic Genomics, talks about finding genomic-driven solutions to address global needs such as new sources of energy, food and vaccines in an interview with James Bennet, Editor-in-Chief of The Atlantic. This program is introduced by Pradeep Khosla, the new chancellor of the University of California, San Diego.  Series: "The Atlantic Meets The Pacific" [11/2012] [Public Affairs] [Show ID: 24359]
The Atlantic Meets the Pacific playlist: http://goo.gl/5V8Yb
The Atlantic Meets the Pacific on UCTV: http://www.uctv.tv/atlanticpacific
UCTV: http://www.uctv.tv]]></description>
	
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/news/view/19272/translate2r</guid>
	<pubDate>Fri, 21 Nov 2014 01:16:06 -0600</pubDate>
	<link>https://bioinformaticsonline.com/news/view/19272/translate2r</link>
	<title><![CDATA[translate2R]]></title>
	<description><![CDATA[<p>After their presentation at the international &ldquo;user!&rdquo; conference, data analysis specialist <a href="http://www.eoda.de/en/" target="_blank">eoda</a> starts the public alpha testing of <a href="http://www.eoda.de/en/translate2R.html" target="_blank">translate2R</a>. With the start of alpha testing the innovative migration solution by the company hailing from Kassel discards the working title &ldquo;translateR&rdquo; and takes on the final product brand name &ldquo;translate2R&rdquo;. translate2R is a service for the automated translation of SPSS&reg; syntax to R code, therefore supporting data analysts with a quick and low-risk migration to R.</p><p>The manual translation of many, frequently rather complex SPSS scripts often presents itself as a tedious and error-prone task, and represents a rather large obstacle for many analysts and companies to migrate to a modern, open source data management and analysis tool like R. With translate2R this hurdle will be diminished substantially.</p><p>Find at https://service.eoda.de/translater/?lang=en</p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/news/view/36191/bioinformatics-workshops-no-coding-required</guid>
	<pubDate>Mon, 09 Apr 2018 13:06:01 -0500</pubDate>
	<link>https://bioinformaticsonline.com/news/view/36191/bioinformatics-workshops-no-coding-required</link>
	<title><![CDATA[Bioinformatics Workshops - NO CODING REQUIRED]]></title>
	<description><![CDATA[<p><img src="https://edu.t-bio.info/wp-content/uploads/2018/03/t-bioinfo-bioinformatics-workshops.jpg" alt="Bioinformatics Workshops T-BioInfo" width="568" height="319" style="vertical-align: middle; border: 0px;"></p><p>Pine Biotech, Inc., a US-based startup working with the Tauber Bioinformatics Research Center is offering a full curriculum online preparing students without any technical background for real-life challenges with large scale biomedical data. Workshops on processing, analysis and biomedical interpretation of Next Generation Sequencing data cover important up-to-date algorithms and machine learning approaches. The most important thing is that there are virtually no pre-requisites such as coding, biostatistics or advanced medical skills. If you know what gene is and how the genes are expressed, you are ready to take the courses or join our workshops. Learn more:&nbsp;https://edu.t-bio.info/workshops/</p>]]></description>
	<dc:creator>eliabrodsky</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/33960/mgra-breakpoint-graphs-and-ancestral-genome-reconstructions</guid>
	<pubDate>Tue, 25 Jul 2017 08:48:25 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/33960/mgra-breakpoint-graphs-and-ancestral-genome-reconstructions</link>
	<title><![CDATA[MGRA: Breakpoint graphs and ancestral genome reconstructions]]></title>
	<description><![CDATA[<p>MGRA (Multiple Genome Rearrangements and Ancestors) is a tool for reconstruction of ancestor genomes and evolutionary history of extant genomes.</p>
<p>It takes as an input a set of genomes represented as sequences of genes (or synteny blocks) and produces such sequences for ancestral genomes at the internal nodes of the phylogenetic tree.</p>
<p>The phylogenetic tree may be also specified completely or partially, in the latter case MGRA can reconstruct conserved ancestral regions (CARs) of the ancestral genome of interest.</p>
<p>Since version 2 MGRA supports gene insertion and deletions in addition to genome rearrangements and allows the input genomes to have different gene content.</p>
<p>It also can reconstruct most plausible phylogenetic tree based on the rearrangement characters.</p><p>Address of the bookmark: <a href="http://mgra.cblab.org/" rel="nofollow">http://mgra.cblab.org/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34377/genomicus-genome-browser-that-enables-users-to-navigate-in-genomes-in-several-dimensions</guid>
	<pubDate>Sat, 18 Nov 2017 16:10:16 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34377/genomicus-genome-browser-that-enables-users-to-navigate-in-genomes-in-several-dimensions</link>
	<title><![CDATA[Genomicus: genome browser that enables users to navigate in genomes in several dimensions]]></title>
	<description><![CDATA[<p>Genomicus is a genome browser that enables users to navigate in genomes in several dimensions: linearly along chromosome axes, transversaly across different species, and chronologicaly along evolutionary time.</p>
<p>Once a query gene has been entered, it is displayed in its genomic context in parallel to the genomic context of all its orthologous and paralogous copies in all the other sequenced metazoan genomes. Moreover, Genomicus stores and displays the predicted ancestral genome structure in all the ancestral species within the phylogenetic range of interest.</p>
<p>All the data on extant species displayed in this browser are from&nbsp;<a href="http://www.ensembl.org/">Ensembl</a>.</p><p>Address of the bookmark: <a href="http://genomicus.biologie.ens.fr/genomicus-90.01/cgi-bin/search.pl" rel="nofollow">http://genomicus.biologie.ens.fr/genomicus-90.01/cgi-bin/search.pl</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34488/scripts-for-the-analysis-of-hgt-in-genome-sequence-data</guid>
	<pubDate>Wed, 29 Nov 2017 16:44:10 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34488/scripts-for-the-analysis-of-hgt-in-genome-sequence-data</link>
	<title><![CDATA[Scripts for the analysis of HGT in genome sequence data.]]></title>
	<description><![CDATA[<p><span>Scripts for the analysis of HGT in genome sequence data</span></p><p>Address of the bookmark: <a href="https://github.com/reubwn/hgt" rel="nofollow">https://github.com/reubwn/hgt</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34569/ksnp30-snp-detection-and-phylogenetic-analysis-of-genomes-without-genome-alignment-or-reference-genome</guid>
	<pubDate>Fri, 08 Dec 2017 16:48:40 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34569/ksnp30-snp-detection-and-phylogenetic-analysis-of-genomes-without-genome-alignment-or-reference-genome</link>
	<title><![CDATA[kSNP3.0: SNP detection and phylogenetic analysis of genomes without genome alignment or reference genome]]></title>
	<description><![CDATA[<p><span>Sept. 20, 2017 Version 3.1 released. Major upgrade. Version 3.1 fixes the problems with SNP annotation that arose when NCBI discontinued use of GI numbers. Please read carefully the Preface (page 3) and the File of annotated genomes section (pages 9-10) in the version 3.1 User Guide. Thanks to Tom Slezak for revsing the get_genbank_file3 script and to Tod Stuber (USDA) for testing version 3.1 even though he doesn't need the annotation feature. All users are encouraged to upgrade to version 3.1.&nbsp;<br></span></p><p>Address of the bookmark: <a href="https://sourceforge.net/projects/ksnp/files/" rel="nofollow">https://sourceforge.net/projects/ksnp/files/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/blog/view/34707/string-graph-based-genome-assembly-software-and-tools</guid>
	<pubDate>Tue, 19 Dec 2017 17:17:38 -0600</pubDate>
	<link>https://bioinformaticsonline.com/blog/view/34707/string-graph-based-genome-assembly-software-and-tools</link>
	<title><![CDATA[String graph based genome assembly software and tools !]]></title>
	<description><![CDATA[<p>In&nbsp;<a href="https://en.wikipedia.org/wiki/Graph_theory" title="Graph theory">graph theory</a>, a&nbsp;<strong>string graph</strong>&nbsp;is an&nbsp;<a href="https://en.wikipedia.org/wiki/Intersection_graph" title="Intersection graph">intersection graph</a>&nbsp;of&nbsp;<a href="https://en.wikipedia.org/wiki/Curve" title="Curve">curves</a>&nbsp;in the plane; each curve is called a "string".&nbsp; String graphs were first proposed by E. W. Myers in a&nbsp;<a href="http://bioinformatics.oxfordjournals.org/content/21/suppl_2/ii79.full.pdf+html">2005 publication</a>.&nbsp;In&nbsp;recent&nbsp;<a href="http://genome.cshlp.org/content/early/2012/01/22/gr.126953.111">Genome Research paper</a>&nbsp;describing an innovative approach for assembling large genomes from NGS data caught our attention for several reasons. i) it give different "string graph" prospective of long lasting genome assembly problem ii) the&nbsp;paper is coauthored by Jared Simpson, the developer of&nbsp;<a href="http://www.ncbi.nlm.nih.gov/pmc/articles/PMC2694472/">ABySS assembler</a>&nbsp;and Richard Durbin. iii)&nbsp;Simpson-Durbin algorithm is that it does not rely on de Bruijn graphs, and instead employs a different graph construction approach called &lsquo;string graph&rsquo;.</p><p>Following are the genome assembly tools based on string graph:</p><p>1.SGA (String Graph Assembler)&nbsp;https://github.com/jts/sga</p><p>Assembles large genomes from high coverage short read data. SGA is designed as a modular set of programs, which are used to form an assembly pipeline. SGA implements a set of assembly algorithms based on the FM-index. As the FM-index is a compressed data structure, the algorithms are very memory efficient. The SGA assembly has three distinct phases. The first phase corrects base calling errors in the reads. The second phase assembles contigs from the corrected reads. The third phase uses paired end and/or mate pair data to build scaffolds from the contigs. The output of this software is a PDF report that allows the properties of the genome and data quality to be visually explored. By providing more information to the user at the start of an assembly project, this software will help increase awareness of the factors that make a given assembly easy or difficult, assist in the selection of software and parameters and help to troubleshoot an assembly if it runs into problems.</p><p>2.&nbsp;SAGE: String-overlap Assembly of GEnomes&nbsp;https://github.com/lucian-ilie/SAGE2</p><p>SAGE, for de novo genome assembly. As opposed to most assemblers, which are de Bruijn graph based, SAGE uses the string-overlap graph. SAGE builds upon great existing work on string-overlap graph and maximum likelihood assembly, bringing an important number of new ideas, such as the efficient computation of the transitive reduction of the string overlap graph, the use of (generalized) edge multiplicity statistics for more accurate estimation of read copy counts, and the improved use of mate pairs and min-cost flow for supporting edge merging. The assemblies produced by SAGE for several short and medium-size genomes compared favourably with those of existing leading assemblers.</p><p>3. FSG: Fast String Graph</p><p>The new integrated assembler has been assessed on a standard benchmark, showing that fast string graph (FSG) is significantly faster than SGA while maintaining a moderate use of main memory, and showing practical advantages in running FSG on multiple threads. Moreover, we have studied the effect of coverage rates on the running times.</p><p>4.&nbsp;&nbsp;BASE&nbsp;https://github.com/dhlbh/BASE</p><p>It enhances the classic seed-extension approach by indexing the reads efficiently to generate adaptive seeds that have high probability to appear uniquely in the genome. Such seeds form the basis for BASE to build extension trees and then to use reverse validation to remove the branches based on read coverage and paired-end information, resulting in high-quality consensus sequences of reads sharing the seeds. Such consensus sequences are then extended to contigs.&nbsp;BASE is a practically efficient tool for constructing contig, with significant improvement in quality for long NGS reads. It is relatively easy to extend BASE to include scaffolding.</p><p>5.&nbsp;Fermi&nbsp;https://github.com/lh3/fermi/</p><p>Fermi is a de novo assembler with a particular focus on assembling Illumina&nbsp;short sequence reads from a mammal-sized genome. In addition to the role of a&nbsp;typical assembler, fermi also aims to preserve heterozygotes which are often&nbsp;collapsed by other assemblers. Its ultimate goal is to find a minimal set of&nbsp;unitigs to represent all the information in raw reads.</p><p>If you want to learn about String Graph assembler, please read the following papers -</p><p>i)&nbsp;<a href="http://bioinformatics.oxfordjournals.org/content/21/suppl_2/ii79.full.pdf+html">The Fragment Assembly String Graph - E. W. Myers</a></p><p>This paper describes the String Graph concept.</p><p>ii)&nbsp;<a href="http://bioinformatics.oxfordjournals.org/content/26/12/i367.full#ref-20">Efficient construction of an assembly string graph using the FM-index - Jared T. Simpson and Richard Durbin</a></p><p>This earlier paper from Simpson and Durbin</p><p>iii)&nbsp;<a href="http://genome.cshlp.org/content/early/2012/01/22/gr.126953.111">Efficient de novo assembly of large genomes using compressed data structures - Jared T. Simpson and Richard Durbin</a></p><p>&nbsp;</p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>

</channel>
</rss>