<?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/33973?offset=330</link>
	<atom:link href="https://bioinformaticsonline.com/related/33973?offset=330" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/pages/view/938/list-of-bioinformatics-and-computational-biology-journals</guid>
	<pubDate>Wed, 17 Jul 2013 02:36:53 -0500</pubDate>
	<link>https://bioinformaticsonline.com/pages/view/938/list-of-bioinformatics-and-computational-biology-journals</link>
	<title><![CDATA[List of Bioinformatics and Computational Biology Journals]]></title>
	<description><![CDATA[<p>Hi Bioinformatician and Computational Biologist, this is the comprehensive list of all (?) the bioinformatics and computational biology&nbsp;journals. Please update me if you know any other good journals related with our domains. Feel free to add your comments and suggestions. You comments will be helpful for others...</p><p>*The journals are not listed in any ascending, descending, or impact factors oders.&nbsp;</p><p><a href="http://bioinformatics.oxfordjournals.org/" target="_blank">Bioinformatics</a>&nbsp;</p><p><a href="http://www.liebertpub.com/overview/journal-of-computational-biology/31/" target="_blank">Journal of Computational Biology</a></p><p><a href="http://bib.oxfordjournals.org/" target="_blank">Briefings in Bioinformatics</a></p><p><a href="http://www.bioinfo.de/isb/" target="_blank">In Silico Biology</a></p><p><a href="http://www.cell.com/structure/home" target="_blank">Structure</a></p><p><a href="http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)1469-896X" target="_blank">Protein Science</a></p><p>Protein Engineering</p><p><a href="http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)1615-9861" target="_blank">Proteomics</a></p><p><a href="http://nar.oxfordjournals.org/" target="_blank">Nucleic Acids Research</a></p><p><a href="http://www.sciencedirect.com/science/journal/01677799" target="_blank">Trends in Biotechnology</a></p><p><a href="http://www.pnas.org/" target="_blank">Proceedings of the National Academy of Sciences</a></p><p>Folding and Design</p><p><a href="http://genomebiology.com/" target="_blank">Genome Biology</a></p><p>Journal of Biomedical Informatics</p><p><a href="http://www.bioinformation.net/" target="_blank">Bioinformation</a></p><p><a href="http://www.ripublication.com/jcib.htm" target="_blank"><span>Journal of Computational Intelligence in Bioinformatics</span></a></p><p>Journal of Structural and Functional Genomics</p><p><a href="http://www.journals.elsevier.com/journal-of-molecular-graphics-and-modelling" target="_blank">Journal of Molecular Graphics and Modelling</a></p><p><a href="http://www.academicpress.com/mbe" target="_blank">Metabolic Engineering</a></p><p>Computers &amp; Chemistry</p><p><a href="http://www.journals.elsevier.com/artificial-intelligence-in-medicine" target="_blank">Artificial Intelligence in Medicine</a></p><p><a href="http://www.karger.com/" target="_blank">Journal of Biomedical Science</a></p><p><a href="http://www.journals.elsevier.com/artificial-intelligence" target="_blank">Artificial Intelligence</a></p><p><a href="http://www.springer.com/computer/ai/journal/10994" target="_blank">Machine Learning</a></p><p>Applied Bioinformatics</p><p>Applied Genomics and Proteomics</p><p><a href="http://www.biomedcentral.com/bmcbioinformatics/" target="_blank">BMC Bioinformatics</a></p><p><a href="http://users.comcen.com.au/~journals/bioinfo.htm" target="_blank">Online Journal of Bioinformatics (OJB)</a></p><p><a href="http://psb.stanford.edu/psb-online/" target="_blank">PSB On-Line Proceedings</a></p><p>Bioinformatics: Information Technology &amp; Systems (BITS)</p><p>Data Mining and Knowledge Discovery</p><p>The EMBO Journal</p><p>Current Opinions in Structural Biology</p><p><a href="http://www.horizonpress.com/backlist/jmmb/" target="_blank">Journal of Molecular Microbiology and Biotechnology</a></p><p><a href="http://www.nature.com/nature/index.html" target="_blank">Nature</a></p><p>Nature Structural Biology</p><p><a href="http://jmlr.org/" target="_blank">Journal of Machine Learning Research</a></p><p><a href="http://www.nature.com/ng/index.html" target="_blank">Nature Genetics</a></p><p>Current Opinion in Genetics &amp; Development</p><p><a href="http://www.nature.com/nbt/index.html" target="_blank">Nature Biotechnology</a></p><p>Trends in Biochemical Sciences</p><p><a href="http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)1097-0134" target="_blank">Proteins: Structure, Function, and Genetics</a></p><p><a href="http://www.nature.com/ncb/index.html" target="_blank">Nature Cell Biology</a></p><p>Trends in Genetics</p><p><a href="http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)1439-7633" target="_blank">ChemBioChem</a></p><p>Trends in Molecular Medicine</p><p><a href="http://link.springer.com/" target="_blank">Journal of Molecular Modelling</a></p><p>Trends in Pharmacological Sciences</p><p>Drug Discovery Today</p><p><a href="http://highwire.stanford.edu/lists/freeart.dtl" target="_blank">Others Free Online Full-text Journals</a></p>]]></description>
	<dc:creator>Jitendra Narayan</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/blog/view/44908/top-journals-in-bioinformatics-how-to-choose-where-to-publish-why-it-matters</guid>
	<pubDate>Fri, 26 Sep 2025 06:49:02 -0500</pubDate>
	<link>https://bioinformaticsonline.com/blog/view/44908/top-journals-in-bioinformatics-how-to-choose-where-to-publish-why-it-matters</link>
	<title><![CDATA[Top Journals in Bioinformatics: How to Choose Where to Publish &amp; Why It Matters]]></title>
	<description><![CDATA[<div><p>Bioinformatics is a rapidly growing field at the intersection of biology, computer science, mathematics, and statistics. As data volumes increase, as well as the diversity of data types (genomics, proteomics, metabolomics, imaging, single‑cell data, etc.), the need for robust computational methods, rigorous models, and reproducible tools has never been greater.</p></div><p><br /> A key decision for researchers is: Where should I publish my work? The choice of journal impacts visibility, peer recognition, and long‑term influence of your research. Below I provide a guide to leading journals in bioinformatics, criteria for selecting the journal that best fits your work, and why these considerations matter.</p><p><strong>Leading Journals in Bioinformatics</strong></p><table border="0" cellspacing="0" cellpadding="0">
<tbody>
<tr>
<td valign="top">
<p>Journal</p>
</td>
<td valign="top">
<p>What it&rsquo;s Known For / Strengths</p>
</td>
<td valign="top">
<p>Best Fit for What Kind of Work</p>
</td>
</tr>
<tr>
<td valign="top">
<p>Bioinformatics (Oxford Journals)</p>
</td>
<td valign="top">
<p>Strong for methods, computational biology, database papers, algorithm development.</p>
</td>
<td valign="top">
<p>New computational methods; tools with broad applicability; databases; methodological advances.</p>
</td>
</tr>
<tr>
<td valign="top">
<p>Briefings in Bioinformatics</p>
</td>
<td valign="top">
<p>High impact reviews, overviews, and synthesis articles.</p>
</td>
<td valign="top">
<p>Review‑style articles; comparative studies; widely used tools.</p>
</td>
</tr>
<tr>
<td valign="top">
<p>PLOS Computational Biology</p>
</td>
<td valign="top">
<p>Emphasis on method development plus biological insight; open access.</p>
</td>
<td valign="top">
<p>Interdisciplinary work; computational method with biological applications.</p>
</td>
</tr>
<tr>
<td valign="top">
<p>BMC Bioinformatics</p>
</td>
<td valign="top">
<p>Broad scope; good for software, pipelines, resources; open access.</p>
</td>
<td valign="top">
<p>Software development; pipelines; data resources; benchmarking.</p>
</td>
</tr>
<tr>
<td valign="top">
<p>IEEE Transactions on Computational Biology and Bioinformatics (TCBB)</p>
</td>
<td valign="top">
<p>Rigor in computation, algorithms, performance.</p>
</td>
<td valign="top">
<p>Algorithmic innovations; statistical/computational method work.</p>
</td>
</tr>
<tr>
<td valign="top">
<p>BioData Mining</p>
</td>
<td valign="top">
<p>Focused on data mining / ML in biology.</p>
</td>
<td valign="top">
<p>Machine learning / AI applied to biological datasets; predictive models.</p>
</td>
</tr>
</tbody>
</table><p><strong>Criteria to Use When Choosing a Journal</strong></p><ul>
<li>Scope &amp; Audience</li>
<li>Impact &amp; Visibility</li>
<li>Review Time &amp; Speed</li>
<li>Open Access</li>
<li>Cost / APCs</li>
<li>Reputation vs Practical Fit</li>
<li>Reproducibility, Data &amp; Code Sharing Policies</li>
<li>Indexing &amp; Reach</li>
<li>Quality of the field</li>
<li>Accelerating discovery</li>
<li>Fair access</li>
<li>Credibility &amp; trust</li>
<li>Read recent papers in the journal</li>
<li>Tailor the manuscript</li>
<li>Check the author guidelines</li>
<li>Have backup journals ready</li>
<li>More emphasis on machine learning / AI</li>
<li>Single‑cell, spatial omics, multimodal data</li>
<li>Cloud workflows, reproducible pipelines</li>
<li>Preprints / open peer review</li>
<li>Alternative metrics (software use, downloads, community adoption)</li>
</ul><p>Selecting where to publish in bioinformatics isn&rsquo;t just about prestige; it&rsquo;s about reaching the right audience, ensuring your work is usable, and contributing to the field responsibly.</p>]]></description>
	<dc:creator>LEGE</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>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/35135/alitv%E2%80%94interactive-visualization-of-whole-genome-comparisons</guid>
	<pubDate>Wed, 10 Jan 2018 07:08:17 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/35135/alitv%E2%80%94interactive-visualization-of-whole-genome-comparisons</link>
	<title><![CDATA[AliTV—interactive visualization of whole genome comparisons]]></title>
	<description><![CDATA[<p>AliTV, which provides interactive visualization of whole genome alignments. AliTV reads multiple whole genome alignments or automatically generates alignments from the provided data. Optional feature annotations and phylo- genetic information are supported. The user-friendly, web-browser based and highly customizable interface allows rapid exploration and manipulation of the visualized data as well as the export of publication-ready high-quality figures. AliTV is freely available at&nbsp;<a href="https://github.com/AliTVTeam/AliTV">https://github.com/AliTVTeam/AliTV</a></p>
<p>https://alitvteam.github.io/AliTV/</p><p>Address of the bookmark: <a href="https://github.com/AliTVTeam/AliTV" rel="nofollow">https://github.com/AliTVTeam/AliTV</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/35543/genometools-the-versatile-open-source-genome-analysis-software</guid>
	<pubDate>Wed, 07 Feb 2018 10:44:18 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/35543/genometools-the-versatile-open-source-genome-analysis-software</link>
	<title><![CDATA[GenomeTools: The versatile open source genome analysis software]]></title>
	<description><![CDATA[<p>The&nbsp;<em>GenomeTools</em>&nbsp;genome analysis system is a&nbsp;<a href="http://genometools.org/license.html">free</a>&nbsp;collection of bioinformatics&nbsp;<a href="http://genometools.org/tools.html">tools</a>&nbsp;(in the realm of genome informatics) combined into a single binary named&nbsp;<em>gt</em>. It is based on a C library named &ldquo;libgenometools&rdquo; which consists of several modules.</p>
<p>If you are interested in gene prediction, have a look at&nbsp;<a href="http://genomethreader.org/" title="GenomeThreader gene prediction        software"><em>GenomeThreader</em></a>.</p><p>Address of the bookmark: <a href="http://genometools.org/" rel="nofollow">http://genometools.org/</a></p>]]></description>
	<dc:creator>Jit</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>