<?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/28906?offset=920</link>
	<atom:link href="https://bioinformaticsonline.com/related/28906?offset=920" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	
<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/7569/phd-at-university-of-calgary</guid>
  <pubDate>Fri, 27 Dec 2013 20:24:39 -0600</pubDate>
  <link></link>
  <title><![CDATA[PhD at University of Calgary]]></title>
  <description><![CDATA[
<p>Institution/Company: <br />University of Calgary<br />Location: <br />Calgary, AB<br />Job Description: </p>

<p>Novel diagnostic platform for detection of Osteoarthritis</p>

<p>I invite applications from highly motivated individuals to join my laboratory as a PhD student in Systems Biology at the University of Calgary McCaig Institute for Bone and Joint Health. This project is aimed at characterizing the networks of physical (protein-protein) interactions underlying inflammatory processes in patients with Osteoarthritis and how this differs from patients with Rheumatoid Arthritis and normal individuals. This work will eventually lead to the development of a novel diagnostic platform for the non-invasive and accurate detection of early Osteoarthritis. The selected candidate will use state-of-the-art computational methodologies to systematically analyze proteomic data, and develop /implement new algorithms to identify protein and functional interaction networks from high throughput experimental data. The individual will also benefit by working closely with experts at the UofC and UofA through an AIHS Alberta Osteoarthritis Team Grant which includes experts from all pillars of health research. The candidate will also be supported to attend bioinformatics workshops and conferences to advance and disseminate their research.<br />Qualifications: The ideal candidate will have a Master’s degree in Computational Biology, Bioinformatics, or equivalent with strong background knowledge of the Biological Sciences, Biochemistry, and Microbiology. The individual should additionally have experience in handling high-throughput data sets as well as programming skills. The candidate will be registered as a PhD student in Dr. Krawetz’s laboratory, located in the new state-of-the-art Health Research Innovation Centre at the UofC. The individual will have strong verbal and written skills and the ability to work efficiently in a team environment.</p>

<p>In addition to the outstanding research opportunities available in this setting, students also enjoy the many cultural and sporting amenities provided in the city of Calgary, and can take advantage of the unparalleled skiing and hiking in the Rocky Mountains that are less than an hour away.</p>

<p>Candidates must be academically competitive and will be expected to apply for external funding. The stipend is $25,000/yr. For outstanding PhD students, internal top-up award opportunities are available on a competitive basis. If interested in joining the lab, please contact Dr. Krawetz directly at rkrawetz@ucalgary.ca and provide the following information:</p>

<p>- Short cover letter explaining your interest in the lab<br />- Resume<br />- Scanned copy of transcript or listing of course grades<br />- Names and contact information for two individuals who will be willing to provide letters of reference</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/pages/view/34418/spades-hybrid-genome-assembly</guid>
	<pubDate>Mon, 27 Nov 2017 08:05:40 -0600</pubDate>
	<link>https://bioinformaticsonline.com/pages/view/34418/spades-hybrid-genome-assembly</link>
	<title><![CDATA[SPAdes hybrid genome assembly]]></title>
	<description><![CDATA[<p>When you have both Illumina and Nanopore data, then SPAdes remains a good option for hybrid assembly - SPAdes was used to produce the&nbsp;<a href="https://gigascience.biomedcentral.com/articles/10.1186/s13742-015-0101-6">B fragilis assembly</a>&nbsp;by Mick Watson&rsquo;s group.</p><p>Again, running spades.py will show you the options:</p><div><pre><code>spades.py
</code></pre></div><p>This produces:</p><div><pre><code>SPAdes genome assembler v3.10.1

Usage: /usr/local/SPAdes-3.10.1-Linux/bin/spades.py [options] -o &lt;output_dir&gt;

Basic options:
-o      &lt;output_dir&gt;    directory to store all the resulting files (required)
--sc                    this flag is required for MDA (single-cell) data
--meta                  this flag is required for metagenomic sample data
--rna                   this flag is required for RNA-Seq data
--plasmid               runs plasmidSPAdes pipeline for plasmid detection
--iontorrent            this flag is required for IonTorrent data
--test                  runs SPAdes on toy dataset
-h/--help               prints this usage message
-v/--version            prints version

Input data:
--12    &lt;filename&gt;      file with interlaced forward and reverse paired-end reads
-1      &lt;filename&gt;      file with forward paired-end reads
-2      &lt;filename&gt;      file with reverse paired-end reads
-s      &lt;filename&gt;      file with unpaired reads
--pe&lt;#&gt;-12      &lt;filename&gt;      file with interlaced reads for paired-end library number &lt;#&gt; (&lt;#&gt; = 1,2,..,9)
--pe&lt;#&gt;-1       &lt;filename&gt;      file with forward reads for paired-end library number &lt;#&gt; (&lt;#&gt; = 1,2,..,9)
--pe&lt;#&gt;-2       &lt;filename&gt;      file with reverse reads for paired-end library number &lt;#&gt; (&lt;#&gt; = 1,2,..,9)
--pe&lt;#&gt;-s       &lt;filename&gt;      file with unpaired reads for paired-end library number &lt;#&gt; (&lt;#&gt; = 1,2,..,9)
--pe&lt;#&gt;-&lt;or&gt;    orientation of reads for paired-end library number &lt;#&gt; (&lt;#&gt; = 1,2,..,9; &lt;or&gt; = fr, rf, ff)
--s&lt;#&gt;          &lt;filename&gt;      file with unpaired reads for single reads library number &lt;#&gt; (&lt;#&gt; = 1,2,..,9)
--mp&lt;#&gt;-12      &lt;filename&gt;      file with interlaced reads for mate-pair library number &lt;#&gt; (&lt;#&gt; = 1,2,..,9)
--mp&lt;#&gt;-1       &lt;filename&gt;      file with forward reads for mate-pair library number &lt;#&gt; (&lt;#&gt; = 1,2,..,9)
--mp&lt;#&gt;-2       &lt;filename&gt;      file with reverse reads for mate-pair library number &lt;#&gt; (&lt;#&gt; = 1,2,..,9)
--mp&lt;#&gt;-s       &lt;filename&gt;      file with unpaired reads for mate-pair library number &lt;#&gt; (&lt;#&gt; = 1,2,..,9)
--mp&lt;#&gt;-&lt;or&gt;    orientation of reads for mate-pair library number &lt;#&gt; (&lt;#&gt; = 1,2,..,9; &lt;or&gt; = fr, rf, ff)
--hqmp&lt;#&gt;-12    &lt;filename&gt;      file with interlaced reads for high-quality mate-pair library number &lt;#&gt; (&lt;#&gt; = 1,2,..,9)
--hqmp&lt;#&gt;-1     &lt;filename&gt;      file with forward reads for high-quality mate-pair library number &lt;#&gt; (&lt;#&gt; = 1,2,..,9)
--hqmp&lt;#&gt;-2     &lt;filename&gt;      file with reverse reads for high-quality mate-pair library number &lt;#&gt; (&lt;#&gt; = 1,2,..,9)
--hqmp&lt;#&gt;-s     &lt;filename&gt;      file with unpaired reads for high-quality mate-pair library number &lt;#&gt; (&lt;#&gt; = 1,2,..,9)
--hqmp&lt;#&gt;-&lt;or&gt;  orientation of reads for high-quality mate-pair library number &lt;#&gt; (&lt;#&gt; = 1,2,..,9; &lt;or&gt; = fr, rf, ff)
--nxmate&lt;#&gt;-1   &lt;filename&gt;      file with forward reads for Lucigen NxMate library number &lt;#&gt; (&lt;#&gt; = 1,2,..,9)
--nxmate&lt;#&gt;-2   &lt;filename&gt;      file with reverse reads for Lucigen NxMate library number &lt;#&gt; (&lt;#&gt; = 1,2,..,9)
--sanger        &lt;filename&gt;      file with Sanger reads
--pacbio        &lt;filename&gt;      file with PacBio reads
--nanopore      &lt;filename&gt;      file with Nanopore reads
--tslr  &lt;filename&gt;      file with TSLR-contigs
--trusted-contigs       &lt;filename&gt;      file with trusted contigs
--untrusted-contigs     &lt;filename&gt;      file with untrusted contigs

Pipeline options:
--only-error-correction runs only read error correction (without assembling)
--only-assembler        runs only assembling (without read error correction)
--careful               tries to reduce number of mismatches and short indels
--continue              continue run from the last available check-point
--restart-from  &lt;cp&gt;    restart run with updated options and from the specified check-point ('ec', 'as', 'k&lt;int&gt;', 'mc')
--disable-gzip-output   forces error correction not to compress the corrected reads
--disable-rr            disables repeat resolution stage of assembling

Advanced options:
--dataset       &lt;filename&gt;      file with dataset description in YAML format
-t/--threads    &lt;int&gt;           number of threads
                                [default: 16]
-m/--memory     &lt;int&gt;           RAM limit for SPAdes in Gb (terminates if exceeded)
                                [default: 250]
--tmp-dir       &lt;dirname&gt;       directory for temporary files
                                [default: &lt;output_dir&gt;/tmp]
-k              &lt;int,int,...&gt;   comma-separated list of k-mer sizes (must be odd and
                                less than 128) [default: 'auto']
--cov-cutoff    &lt;float&gt;         coverage cutoff value (a positive float number, or 'auto', or 'off') [default: 'off']
--phred-offset  &lt;33 or 64&gt;      PHRED quality offset in the input reads (33 or 64)
                                [default: auto-detect]
</code></pre></div><p>As you can see this is also a &ldquo;pipeline&rdquo; of tools that can be switched on or off. SPAdes takes quite a long time, so for the purposes of this practical, something like this may suffice:</p><div><pre><code>spades.py -t 4 <span>\</span>
          -m 32 <span>\</span>
          -k 31,51,71 <span>\</span>
          --only-assembler <span>\</span>
          -1 miseq.1.fastq -2 miseq.2.fastq <span>\</span>
          --nanopore minion.fastq <span>\</span>
          -o hybrid_assembly
</code></pre></div><p>In turn, these parameters mean</p><ul>
<li>use 4 threads</li>
<li>max memory is 32Gb</li>
<li>use 3 kmer values to build the de bruijn graph(s) - 31, 51 and 71</li>
<li>only run the assembler, not the correction algorithm (for speed)</li>
<li>read 1 and read 2 of the MiSeq data</li>
<li>the nanopore data</li>
<li>put the output in folder &ldquo;hybrid_assembly&rdquo;</li>
</ul>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/7215/postdoc-positions-in-computational-biology-center-for-genomic-science-milan-italy</guid>
  <pubDate>Thu, 12 Dec 2013 18:34:47 -0600</pubDate>
  <link></link>
  <title><![CDATA[Postdoc positions in computational biology - Center for Genomic Science - Milan, Italy]]></title>
  <description><![CDATA[
<p>Job Description: three postdoc positions in computational biology are available at the Center for Genomic Science in Milan (Italy):</p>

<p>- Development of computational methods to investigate the interplay between epigenetic and genetic layers and their role in tumor progression, by integrating genomic, epigenomic and transcriptional data. PI: Mattia Pelizzola (http://tiny.cc/comEpi)<br />- Epigenome and transcriptome analysis in mouse models of Hepatocellular Carcinoma. PI: Bruno Amati - Small and long non-coding RNAs in cancer stem cells. PI: Francesco Nicassio</p>

<p>All projects will benefit from the availability of both in-house and publicly available next-generation sequencing datasets. Familiarity with Linux environment, programming skills (especially in R) and a background in either computational biology, or physics/engineering/math will be advantageous.</p>

<p>Deadline for the application January 6th, to apply: http://genomics.iit.it/resources.html</p>

<p>Start date: March 1st, 2014</p>

<p>Duration: 1+2 years</p>

<p>Contact Person (Referent): Mattia Pelizzola</p>

<p>Ref. E-Mail: mattia.pelizzola@iit.it</p>

<p>Tel: 0039-02-94375058<br />Group Web Page: http://genomics.iit.it</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34567/jobtree-based-python-wrapper-to-run-the-genome-simulation-tool-suite-evolver</guid>
	<pubDate>Fri, 08 Dec 2017 16:26:32 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34567/jobtree-based-python-wrapper-to-run-the-genome-simulation-tool-suite-evolver</link>
	<title><![CDATA[jobTree based python wrapper to run the genome simulation tool suite Evolver]]></title>
	<description><![CDATA[<p><span>evolverSimControl</span><span>&nbsp;(</span><span>eSC</span><span>) can be used to simulate multi-chromosome genome evolution on an arbitrary phylogeny (</span><a href="http://evolution.genetics.washington.edu/phylip/newicktree.html">Newick format</a><span>). In addition to simply running evolver,&nbsp;</span><span>eSC</span><span>&nbsp;also automatically creates statistical summaries of the simulation as it runs including text and image files. Also included are convenience scripts to: check on a running simulation and see detailed status and logging information; extract fasta sequence files from the leaf nodes of a completed simulation; extract pairwise multiple alignment files (</span><a href="http://genome.ucsc.edu/FAQ/FAQformat.html#format5">.maf</a><span>) from leaf and branch nodes from a completed simulation and with the help of&nbsp;</span><a href="https://github.com/dentearl/mafTools/">mafJoin</a><span>, join them together into a single maf covering the entire simulation.</span></p><p>Address of the bookmark: <a href="https://github.com/dentearl/evolverSimControl" rel="nofollow">https://github.com/dentearl/evolverSimControl</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/7383/embo-practical-course-on-bioinformatics-and-genomes-analyses-at-hellenic-pasteur-institute-athens-greece</guid>
  <pubDate>Sat, 21 Dec 2013 10:00:24 -0600</pubDate>
  <link></link>
  <title><![CDATA[EMBO practical Course on  "Bioinformatics and Genomes Analyses" at Hellenic Pasteur Institute, Athens, Greece]]></title>
  <description><![CDATA[
<p>The main objectives of this Practical Course are to strengthen skills <br />of PhD students and young researchers in the domain of Bioinformatics <br />and Genome Data Analyses on the use of advanced fundamental algorithms <br />and their applications in genome studies.</p>

<p>The course topics will include theoretical and practical aspects in:<br />- Genomes comparisons,<br />- Evolutionary analyses (orthologs, paralogs and ancestral genomes <br />inference),<br />- RNAseq and Next Generation Sequencing (including algorithms, methods <br />and sequence mapping tools, data analyses and applications).</p>

<p>The course programme will be centred on theoretical presentations <br />followed by practical sessions. Practical sessions in a Linux <br />environment will involve Unix shell and Perl scripting. Participants <br />are assumed to be familiar with this environment.</p>

<p>A series of lectures delivered by prominent scientists on recent hot <br />topics in genome (Viruses, Prokaryotes, Eukaryotes) studies will be <br />included in the programme and future research perspectives will be <br />highlighted.</p>

<p>The topics that will be included in the course programme are similar <br />to those included in previously organized courses:http://www.pasteur.fr/~tekaia/BGA_courses.html</p>

<p>The course is aimed at motivated Ph.D students and Post-Doctoral <br />Researchers in Academic Institutions, with background in Mathematics, <br />Statistics, Biology or Computer Science and who are involved in <br />Bioinformatics and Genomes studies.</p>

<p>Selection of participants will be based on their background, running <br />research projects and on expressed motivations.<br />Selected students will have free accommodation and meals and are <br />expected to contribute with 200 euros and to pay for their travel <br />expenses.<br />All participants (students and invited speakers) will stay in the same <br />hotel.</p>

<p>Detailed indications are available on the course web site: http://events.embo.org/14-comparative-genomics/index.html</p>

<p>Candidates are advised to complete carefully the application form, <br />together with an abstract of at least one of their running projects, a <br />"one-page CV" and a personal Identity Picture (Photo).</p>

<p>The application deadline is March 14, 2014.</p>

<p>The organizers:<br />Menelaos Manoussakis, Hellenic Pasteur Institute, Athens, Greece.<br />Evdokia Karagouni, Hellenic Pasteur Institute, Athens - Greece.<br />Evie Melanitou,  Institut Pasteur Paris - France.<br />Fredj Tekaia ( Institut Pasteur Paris France)<br />URL: http://www.pasteur.fr/~tekaia/BGA_courses.html</p>

<p>Date: 5 – 17 May, 2014. <br />More at http://events.embo.org/14-comparative-genomics/index.html<br />will take place in the ,</p>
]]></description>
</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>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/news/view/7568/oldest-hominin-dna-sequenced</guid>
	<pubDate>Fri, 27 Dec 2013 19:58:31 -0600</pubDate>
	<link>https://bioinformaticsonline.com/news/view/7568/oldest-hominin-dna-sequenced</link>
	<title><![CDATA[Oldest Hominin DNA Sequenced]]></title>
	<description><![CDATA[<p>Matthias Meyer and his team from the Max Planck Institute for Evolutionary Anthropology in Leipzig, Germany, have developed new techniques for retrieving and sequencing highly degraded ancient DNA. They then joined forces with Juan-Luis Arsuaga and applied the new techniques to a cave bear from the Sima de los Huesos site. After this success, the researchers sampled two grams of bone powder from a hominin thigh bone from the cave. They extracted its DNA and sequenced the genome of the mitochondria or mtDNA, a small part of the genome that is passed down along the maternal line and occurs in many copies per cell. The researchers then compared this ancient mitochondrial DNA with Neandertals, Denisovans, present-day humans, and apes.<br /><br />From the missing mutations in the old DNA sequences the researchers calculated that the Sima hominin lived about 400,000 years ago. They also found that it shared a common ancestor with the Denisovans, an extinct archaic group from Asia related to the Neandertals, about 700,000 years ago. "The fact that the mtDNA of the Sima de los Huesos hominin shares a common ancestor with Denisovan rather than Neandertal mtDNAs is unexpected since its skeletal remains carry Neandertal-derived features," says Matthias Meyer. Considering their age and Neandertal-like features, the Sima hominins were likely related to the population ancestral to both Neandertals and Denisovans. Another possibility is that gene flow from yet another group of hominins brought the Denisova-like mtDNA into the Sima hominins or their ancestors.<br /><br /></p><p>Reference</p><p>http://www.sciencedaily.com/releases/2013/12/131204132018.htm</p>]]></description>
	<dc:creator>Surajeet</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/35432/mummer4-a-fast-and-versatile-genome-alignment-system</guid>
	<pubDate>Sat, 03 Feb 2018 04:59:17 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/35432/mummer4-a-fast-and-versatile-genome-alignment-system</link>
	<title><![CDATA[MUMmer4: A fast and versatile genome alignment system]]></title>
	<description><![CDATA[<p><span>MUMmer4, a substantially improved version of MUMmer that addresses genome size constraints by changing the 32-bit suffix tree data structure at the core of MUMmer to a 48-bit suffix array, and that offers improved speed through parallel processing of input query sequences. With a theoretical limit on the input size of 141Tbp, MUMmer4 can now work with input sequences of any biologically realistic length. We show that as a result of these enhancements, the&nbsp;</span><span>nucmer</span><span>&nbsp;program in MUMmer4 is easily able to handle alignments of large genomes;&nbsp;</span></p><p>Address of the bookmark: <a href="https://mummer4.github.io/" rel="nofollow">https://mummer4.github.io/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/pages/view/7986/list-of-bioinformatics-open-source-projectssoftware</guid>
	<pubDate>Tue, 21 Jan 2014 14:28:37 -0600</pubDate>
	<link>https://bioinformaticsonline.com/pages/view/7986/list-of-bioinformatics-open-source-projectssoftware</link>
	<title><![CDATA[List of bioinformatics open source projects/software.]]></title>
	<description><![CDATA[<p>Open source software is software that can be freely used, changed, and shared (in modified or unmodified form) by anyone. Open source software is made by many people, and distributed under licenses that comply with the Open Source Definition.The Open Source Initiative (OSI) is a global non-profit that supports and promotes the open source movement. Followings are the OS bioinformatics projects/software :</p><p><strong>.NET Bio</strong></p><p>http://blogs.msdn.com/b/msr_er/archive/2011/10/18/microsoft-biology-foundation-evolves-into-new-toolkit-net-bio.aspx</p><p>A language-neutral bioinformatics toolkit built using the Microsoft 4.0 .NET Framework to help developers, researchers, and scientists.</p><p><strong>AMPHORA</strong> ("AutoMated Phylogenomic infeRence Application")</p><p>http://wolbachia.biology.virginia.edu/WuLab/Software.html</p><p><a href="http://en.wikipedia.org/wiki/Metagenomics" title="Metagenomics">Metagenomics</a> analysis software</p><p><strong>Anduril</strong></p><p>http://www.anduril.org/anduril/site/</p><p>Component-based <a href="http://en.wikipedia.org/wiki/Workflow" title="Workflow">workflow</a> framework for data analysis</p><p>Armadillo workflow platform</p><p>Tool for designing and executing phylogenetic workflows</p><p><strong>AutoDock</strong></p><p>http://autodock.scripps.edu/</p><p>suite of automated docking tools</p><p><strong>Biochemical Algorithms Library (BALL)</strong></p><p>http://www.ball-project.org/</p><p>C++ library and framework for molecular modeling and visualization designed for rapid prototyping</p><p><strong>Bio4j</strong></p><p>http://bio4j.com/</p><p>Bio4j is a <a href="http://en.wikipedia.org/wiki/Bioinformatics" title="Bioinformatics">bioinformatics</a> platform and <a href="http://en.wikipedia.org/wiki/Chart" title="Chart">graph</a> based <a href="http://en.wikipedia.org/wiki/Database" title="Database">database</a> built around most data available in <a href="http://en.wikipedia.org/wiki/UniProt" title="UniProt">UniProt</a> KB(<a href="http://en.wikipedia.org/wiki/Swiss-Prot" title="Swiss-Prot">Swiss-Prot</a> + <a href="http://en.wikipedia.org/wiki/TrEMBL" title="TrEMBL">TrEMBL</a>), <a href="http://en.wikipedia.org/wiki/Gene_Ontology" title="Gene Ontology">Gene Ontology</a> (GO), <a href="http://en.wikipedia.org/w/index.php?title=UniRef&amp;action=edit&amp;redlink=1" title="UniRef (page does not exist)">UniRef</a> (50,90,100), <a href="http://en.wikipedia.org/wiki/RefSeq" title="RefSeq">RefSeq</a>, <a href="http://en.wikipedia.org/wiki/National_Center_for_Biotechnology_Information" title="National Center for Biotechnology Information">NCBI</a> taxonomy, and Expasy Enzyme DB</p><p><strong>Bioclipse</strong></p><p>www.bioclipse.net</p><p>Visual platform for <a href="http://en.wikipedia.org/wiki/Cheminformatics" title="Cheminformatics">chemo</a>- and <a href="http://en.wikipedia.org/wiki/Bioinformatics" title="Bioinformatics">bioinformatics</a> based on the <a href="http://en.wikipedia.org/wiki/Eclipse_%28software%29" title="Eclipse (software)">Eclipse</a> Rich Client Platform (RCP).</p><p><strong>Bioconductor</strong></p><p>http://www.bioconductor.org/</p><p><a href="http://en.wikipedia.org/wiki/R_%28programming_language%29" title="R (programming language)">R (programming language)</a> language toolkit</p><p><strong>Bioinformatics Learning Tutorial (BLT)</strong></p><p>http://sourceforge.net/projects/biotutorial/</p><p>Educational <a href="http://en.wikipedia.org/wiki/Interactive_tutorials" title="Interactive tutorials">interactive tutorials</a> and 3D animations for Replication, Transcription, and Translation</p><p><strong>BioHaskell</strong></p><p>http://biohaskell.org/</p><p><a href="http://en.wikipedia.org/wiki/Haskell_%28programming_language%29" title="Haskell (programming language)">Haskell (programming language)</a></p><p><strong>BioJava</strong></p><p>http://biojava.org/wiki/Main_Page</p><p><a href="http://en.wikipedia.org/wiki/Java_%28programming_language%29" title="Java (programming language)">Java (programming language)</a></p><p><strong>BioMOBY</strong></p><p>http://biomoby.org/</p><p>registry of <a href="http://en.wikipedia.org/wiki/Web_services" title="Web services">web services</a></p><p><strong>BioPerl</strong></p><p>http://www.bioperl.org/wiki/Main_Page</p><p><a href="http://en.wikipedia.org/wiki/Perl" title="Perl">Perl</a> language toolkit</p><p><strong>BioPHP</strong></p><p>http://www.biophp.org/</p><p><a href="http://en.wikipedia.org/wiki/PHP" title="PHP">PHP</a> language toolkit</p><p><strong>Biopython</strong></p><p>http://biopython.org/wiki/Main_Page</p><p><a href="http://en.wikipedia.org/wiki/Python_%28programming_language%29" title="Python (programming language)">Python</a> language toolkit</p><p><strong>BioRails</strong></p><p>https://github.com/biorails</p><p>a <a href="http://en.wikipedia.org/wiki/Data_management_system" title="Data management system">data management system</a> designed to support researchers in <a href="http://en.wikipedia.org/wiki/Drug_discovery" title="Drug discovery">drug discovery</a></p><p><strong>BioRuby</strong></p><p>http://bioruby.org/</p><p><a href="http://en.wikipedia.org/wiki/Ruby_%28programming_language%29" title="Ruby (programming language)">Ruby</a> language toolkit</p><p><strong>BioSmalltalk</strong></p><p>https://code.google.com/p/biosmalltalk/</p><p><a href="http://en.wikipedia.org/wiki/Smalltalk_%28programming_language%29" title="Smalltalk (programming language)">Smalltalk</a> language toolkit</p><p><strong>BioUno</strong></p><p>http://www.biouno.org/</p><p><a href="http://en.wikipedia.org/w/index.php?title=BioUno&amp;action=edit&amp;redlink=1" title="BioUno (page does not exist)">BioUno</a> is a project that applies <a href="http://en.wikipedia.org/wiki/Continuous_Integration" title="Continuous Integration">Continuous Integration</a> tools and techniques in <a href="http://en.wikipedia.org/wiki/Bioinformatics" title="Bioinformatics">Bioinformatics</a>. It uses <a href="http://en.wikipedia.org/wiki/Jenkins_%28software%29" title="Jenkins (software)">Jenkins</a> and its plug-in API to create <a href="http://en.wikipedia.org/wiki/Bioinformatics_workflow_management_system" title="Bioinformatics workflow management system">biology workflows</a> and manage <a href="http://en.wikipedia.org/wiki/Computer_clusters" title="Computer clusters">computer clusters</a>.</p><p><strong>caCORE</strong></p><p>&nbsp;</p><p>ontologic representation environment</p><p><strong>caArray</strong></p><p>https://cabig-stage.nci.nih.gov/community/tools/caArray</p><p>ontologic representation environment</p><p><strong>EMBOSS</strong></p><p>http://emboss.sourceforge.net/</p><p>Suite of packages for sequencing, searching, etc.</p><p><strong>Gaggle</strong></p><p>https://www.gaggle.net/</p><p>A framework for interoperability between systems biology software</p><p><strong>Galaxy</strong></p><p>http://galaxyproject.org/</p><p><a href="http://en.wikipedia.org/wiki/Scientific_workflow_system" title="Scientific workflow system">Scientific workflow</a> and <a href="http://en.wikipedia.org/wiki/Data_integration" title="Data integration">data integration</a> system</p><p><strong>GenePattern</strong></p><p>http://www.broadinstitute.org/cancer/software/genepattern/</p><p><a href="http://en.wikipedia.org/wiki/Scientific_workflow_system" title="Scientific workflow system">Scientific workflow system</a> that provides access to more than 150 genomic analysis tools</p><p><strong>GeWorkbench</strong></p><p>http://wiki.c2b2.columbia.edu/workbench/index.php/Home</p><p>Genomic <a href="http://en.wikipedia.org/wiki/Data_integration" title="Data integration">data integration</a> platform</p><p><strong>GMOD</strong></p><p>http://www.gmod.org/wiki/Main_Page</p><p>Toolkit for addressing many common challenges at biological databases.</p><p><strong>GeneProf</strong></p><p>http://www.geneprof.org/GeneProf/</p><p>A web-based, bioinformatics software suite for the analysis of functional genomics experiments, e.g. RNA-seq or ChIP-seq.</p><p><strong>GeneTalk</strong></p><p>http://www.gene-talk.de/</p><p>Tool for filtering sequence variants in <a href="http://en.wikipedia.org/wiki/Variant_Call_Format" title="Variant Call Format">VCF</a> files. Network for scientists and clinicians for expertise and knowledge exchange. Database of annotations aboute sequence variants with clinically relevant information.</p><p><strong>GenGIS</strong></p><p>http://kiwi.cs.dal.ca/GenGIS/Main_Page</p><p>Application that allows users to combine digital map data with information about biological sequences collected from the environment.</p><p><strong>GenomeSpace</strong></p><p>http://www.genomespace.org/</p><p>Centralized web application that provides data format transformations and facilitates connections with other bioinformatics tools</p><p><strong>GENtle</strong></p><p>http://directory.fsf.org/wiki/GENtle</p><p>An equivalent to the proprietary <a href="http://en.wikipedia.org/wiki/Vector_NTI" title="Vector NTI">Vector NTI</a>, a tool to analyze and edit <a href="http://en.wikipedia.org/wiki/DNA" title="DNA">DNA</a> sequence files</p><p><strong>Integrated Genome Browser</strong></p><p>http://bioviz.org/igb/</p><p><a href="http://en.wikipedia.org/wiki/Java_%28software_platform%29" title="Java (software platform)">Java</a>-based desktop <a href="http://en.wikipedia.org/wiki/Genome_browser" title="Genome browser">genome browser</a></p><p><strong>Integrative Genomics Viewer (IGV)</strong></p><p>http://www.broadinstitute.org/igv/</p><p>High-performance desktop tool for interactive visual exploration of diverse genomic data</p><p><strong>IntAct</strong></p><p>http://www.ebi.ac.uk/intact/</p><p>molecular interaction database</p><p><strong>InterMine</strong></p><p>http://intermine.github.io/intermine.org/</p><p>Extensive data warehouse system for the analysis and integration of biological datasets</p><p><strong>Java Treeview</strong></p><p>http://jtreeview.sourceforge.net/</p><p>microarray data viewer</p><p><strong>LabKey Server</strong></p><p>http://labkey.com/</p><p>platform for integrating, analyzing and sharing data</p><p><strong>OpenClinica</strong></p><p>https://www.openclinica.com/</p><p>software for capturing and managing data in clinical trials</p><p><a href="http://www.biomedcentral.com/1471-2164/13/512">PromKappa</a></p><p>http://xbioinformatics.wordpress.com/tag/promkappa/</p><p>PromKappa (Promoter analysis by Kappa) software program used for promoter pattern generation and promoter analysis.</p><p><strong>MeV: Multi-Experiment Viewer</strong></p><p>http://www.tm4.org/mev.html</p><p>a desktop application for the analysis, visualization and data-mining of large-scale genomic data</p><p><strong>PathVisio</strong></p><p>http://www.pathvisio.org/</p><p>a desktop software for drawing, analysis and visualization of biological pathways</p><p>REDCRAFT</p><p>software for determining tertiary protein structure given assigned Residual Dipolar Coupling data</p><p>SAM Tools</p><p>Data format (SAM) and accompanying tool suite, for storing large nucleotide sequence alignments</p><p><a href="http://en.wikipedia.org/wiki/Staden_Package" title="Staden Package">Staden Package</a></p><p>Sequence assembly, editing and analysis, primarily consisting of gap4, gap5 and spin.</p><p><a href="http://en.wikipedia.org/wiki/STAMP" title="STAMP">STAMP</a></p><p>Software package for analyzing metagenomic profiles that promotes &lsquo;best practices&rsquo; in choosing appropriate statistical techniques and reporting results.</p><p><a href="http://supfam.org/supraHex">supraHex</a></p><p>An open-source R/Bioconductor package for omics data analysis using a supra-hexagonal map</p><p><a href="http://en.wikipedia.org/wiki/Taverna_workbench" title="Taverna workbench">Taverna workbench</a></p><p>Tool for designing and executing workflows</p><p>TGAC Browser</p><p>Genome Browser, visualisation solutions for big data in the genomic era</p><p>T-REX WebServer</p><p>Bioinformatics and phylogenetics webserver (NJ, PhyML, RAxML, MAFFT, MUSCLE, Newick viewer, <a href="http://en.wikipedia.org/wiki/Horizontal_gene_transfer" title="Horizontal gene transfer">Horizontal gene transfer</a> detection, Reticulograms, Substitution models)</p><p><a href="http://en.wikipedia.org/wiki/UGENE" title="UGENE">UGENE</a></p><p>integrated bioinformatics tools</p><p>Visomics</p><p>bioinformatics tools for omics data</p><p>Genome Analysis Toolkit 1.0 (GATK 1.0)</p><p>a software package to analyse next-generation resequencing data</p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36257/aligngraph-algorithm-for-secondary-de-novo-genome-assembly-guided-by-closely-related-references</guid>
	<pubDate>Tue, 17 Apr 2018 16:21:20 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36257/aligngraph-algorithm-for-secondary-de-novo-genome-assembly-guided-by-closely-related-references</link>
	<title><![CDATA[AlignGraph: algorithm for secondary de novo genome assembly guided by closely related references]]></title>
	<description><![CDATA[<p>AlignGraph is a software that extends and joins contigs or scaffolds by reassembling them with help provided by a reference genome of a closely related organism.</p>
<p>Using AlignGraph</p>
<pre><code>AlignGraph --read1 reads_1.fa --read2 reads_2.fa --contig contigs.fa --genome genome.fa --distanceLow distanceLow --distanceHigh distancehigh --extendedContig extendedContigs.fa --remainingContig remainingContigs.fa [--kMer k --insertVariation insertVariation --coverage coverage --part p --fastMap --ratioCheck --iterativeMap --misassemblyRemoval --resume]</code></pre>
<h3>&nbsp;</h3><p>Address of the bookmark: <a href="https://github.com/baoe/AlignGraph" rel="nofollow">https://github.com/baoe/AlignGraph</a></p>]]></description>
	<dc:creator>Manisha Mishra</dc:creator>
</item>

</channel>
</rss>