<?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/26617?offset=1180</link>
	<atom:link href="https://bioinformaticsonline.com/related/26617?offset=1180" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/blog/view/43997/tools-for-rna-classification</guid>
	<pubDate>Tue, 08 Nov 2022 03:39:11 -0600</pubDate>
	<link>https://bioinformaticsonline.com/blog/view/43997/tools-for-rna-classification</link>
	<title><![CDATA[Tools for RNA classification]]></title>
	<description><![CDATA[<p><span>barrnap</span>&nbsp;-&nbsp;<a href="https://github.com/tseemann/barrnap" target="_blank">https://github.com/tseemann/barrnap</a></p><p><span>CPAT</span>&nbsp;-&nbsp;<a href="https://github.com/liguowang/cpat" target="_blank">https://github.com/liguowang/cpat</a>,&nbsp;<a href="http://lilab.research.bcm.edu/" target="_blank">http://lilab.research.bcm.edu/</a>&nbsp;(web server)</p><p><span>CPC2</span>&nbsp;-&nbsp;<a href="https://github.com/gao-lab/CPC2_standalone" target="_blank">https://github.com/gao-lab/CPC2_standalone</a>,&nbsp;<a href="http://cpc2.gao-lab.org/" target="_blank">http://cpc2.gao-lab.org/</a>&nbsp;(web server)</p><p><span>Infernal</span>&nbsp;-&nbsp;<a href="http://eddylab.org/infernal/" target="_blank">http://eddylab.org/infernal/</a>,&nbsp;<a href="https://github.com/EddyRivasLab/infernal" target="_blank">https://github.com/EddyRivasLab/infernal</a></p><p><span>NCBI RefSeq</span>&nbsp;-&nbsp;<a href="https://www.ncbi.nlm.nih.gov/refseq/" target="_blank">https://www.ncbi.nlm.nih.gov/refseq/</a></p><p><span>Rfam</span>&nbsp;-&nbsp;<a href="http://rfam.xfam.org/" target="_blank">http://rfam.xfam.org/</a>,&nbsp;<a href="https://docs.rfam.org/en/latest/index.html" target="_blank">https://docs.rfam.org/en/latest/index.html</a></p><p><span>SILVA</span>&nbsp;-&nbsp;<a href="https://www.arb-silva.de/" target="_blank">https://www.arb-silva.de/</a></p><p><span>RNAmmer</span>&nbsp;-&nbsp;<a href="http://www.cbs.dtu.dk/services/RNAmmer/" target="_blank">http://www.cbs.dtu.dk/services/RNAmmer/</a>&nbsp;(web server, standalone download link)</p>]]></description>
	<dc:creator>Abhi</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/blog/view/45343/simulating-the-unseen-new-tools-reshaping-metagenomic-research</guid>
	<pubDate>Wed, 23 Sep 2026 09:42:30 -0500</pubDate>
	<link>https://bioinformaticsonline.com/blog/view/45343/simulating-the-unseen-new-tools-reshaping-metagenomic-research</link>
	<title><![CDATA[Simulating the Unseen: New Tools Reshaping Metagenomic Research]]></title>
	<description><![CDATA[<p>When benchmarking a new metagenomic pipeline the first step is generally to face a simple problem. A bioinformatician might have a good deal of real sequencing data, but there's a drawback in that the actual biological composition underlying those reads is almost never known. What organisms really were there? In what quantities? How many sequencing errors occurred? Can the pipeline correctly reconstruct the community? Since the true answers are unknown, it is difficult to deal with these questions.</p><p>Metagenomic simulators are a way of dealing with this issue; they produce artificial sequencing datasets in which both the composition of the microorganisms and the expected results are known. Researchers can then test a pipeline on such a controlled dataset and see precisely how well it functions. However, as metagenomic studies have become larger, more diverse, and more complex, simply generating artificial reads is no longer sufficient. The simulators now have to replicate community variation, sequencing errors, different sequencing platforms, massive data volumes, and even laboratory-based biases.</p><p>MIDASim (2024) was designed with a particular emphasis on microbial community dynamics. Unlike previous tools which regarded each simulated sample as individual, MIDASim is able to efficiently generate realistic multi-sample microbiome datasets, covering the cases where changes over time are being tracked. This feature is particularly useful when investigating how microbial communities vary between people, different experimental setups, or at various times. By overcoming the computational limitations of earlier simulation methods, MIDASim has made it easier to carry out large and complex microbiome simulation studies.</p><p>A major challenge is scale. Since modern metagenomic projects can involve millions or even billions of sequencing reads, generating such large synthetic datasets can become a significant computational problem. In order to tackle this issue, Izzy (2025) was developed. As a high-throughput metagenomic read simulator, Izzy is designed with speed in mind while still reproducing the typical patterns of sequencing errors. The people who developed it stated that it can be as much as 60 times faster than earlier tools, which makes large-scale simulations far more practical. Now, researchers can begin to ask not how long a simulation will take but rather what size dataset they want to test.</p><p>At the same time, the sequencing technology became more diverse. Researchers were not any longer restricted to using Illumina short reads since Oxford Nanopore and PacBio long-read sequencing also became important in the field of metagenomic research. In order to address these new requirements, MeSS (Metagenomic Sequence Simulator, 2025) was developed. The programme is based on a Snakemake framework and is therefore compatible with the Illumina, Oxford Nanopore and PacBio platforms. MeSS has also been designed to operate efficiently and to use less memory than earlier tools; it provides ready-made templates for the microbiomes of different sites in the human body, thus giving researchers a simple means of beginning to generate realistic simulated communities.</p><p>The simulation problem became even more specialized. Suppose that sequencing is not based on uniform sampling of DNA? In the case of targeted sequencing and hybridization-capture experiments, particular sequences are deliberately enriched, and the probability of capturing a target depends on both the probe and the target sequence. A standard model based on uniform sampling might fail to take into account this important feature of real experiments. That is why RAmpSim has been designed specifically to handle simulations for capture-based and targeted sequencing. Instead of depending solely on the assumption of uniform sampling, it includes a thermodynamic nearest-neighbor energy model to represent probe&ndash;target interactions and sequence-dependent enrichment. As a result, it is especially suitable for applications such as hybridization capture in metagenomics, where the efficiency of recovering a sequence can depend strongly on how it relates to the capture probes. RAmpSim thus reflects a wider trend towards simulations that aim not only to reproduce sequencing output but also key aspects of the experimental process itself.</p><p>MIDASim, Izzy, MeSS and RAmpSim all demonstrate how fast metagenomic simulation is evolving. MIDASim is able to deal with realistic variation within a large number of and changing microbial communities. Izzy overcomes the problem of generating very large datasets. MeSS provides support for a number of sequencing technologies in an efficient and repeatable manner. RAmpSim increases the experimental realism for capture-based sequencing. Although each of these tools addresses a separate issue, they all contribute to advancing the field.</p><p>Modern metagenomic simulation therefore aims not only at producing artificial FASTQ files. Researchers nowadays desire simulated datasets that reflect community changes, incorporate the characteristics of the sequencing platform, include real error patterns, take into account computational scale, and account for experimental biases. As metagenomic workflows become more advanced, the simulators have to keep up with this development. The tools are now going beyond that of simple data generators; they produce controlled versions of complex metagenomic experiments and thus provide researchers with something that ordinary sequencing data seldom does: a dataset in which the answer is known before any analysis takes place.</p>]]></description>
	<dc:creator>LEGE</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/pages/view/35386/list-of-visualization-tools-for-network-biology</guid>
	<pubDate>Mon, 29 Jan 2018 05:12:24 -0600</pubDate>
	<link>https://bioinformaticsonline.com/pages/view/35386/list-of-visualization-tools-for-network-biology</link>
	<title><![CDATA[List of visualization tools for network biology]]></title>
	<description><![CDATA[<p>Network analysis&nbsp;is any structured technique used to mathematically analyze a circuit (a &ldquo;network&rdquo; of interconnected components). The&nbsp;<span>Network analysis provides the ability to quantify associations between individuals, which makes it possible to infer details about the network as a whole at the species and/or population level.&nbsp;</span>Few tools published in BMC are listed here https://bmcbioinformatics.biomedcentral.com/articles/sections/networks-analysis.</p><p><img src="https://www.dropbox.com/pri/get/Public/Link%20to%20network.gif?_subject_uid=85115969&amp;raw=1&amp;revision_id=BBqs9eYx7G_faj5J33ExdjmtF8nXK2xrN5dUBsKyTLZQ9RB_hGM-YFmWZMBzbQZfRvjYzfs65HbQYrHRyoikxsQscSFTn1Nud2QeJ8KGfVI5wv4Kzp6froKOmPZu8ZygfKo&amp;size=1280x960&amp;size_mode=3&amp;w=AABQaErsFIz5ZjVZSxXvKaSVUkY5ob1Yjk0x7dghy0X7zw" alt="image" style="border: 0px; border: 0px;"></p><p>Following are the list of standalone applications for network analysis:</p><p>Arena 3D</p><p>3D visualization of multi-layer networks</p><p>http://www.arena3d.org</p><p>Biana</p><p>Data integration and network management</p><p>http://sbi.imim.es/web/BIANA.php</p><p>BioLayout Express 3D&nbsp;</p><p>2D/3D network visualization</p><p>http://www.biolayout.org/</p><p>BiologicalNetworks&nbsp;</p><p>Efficient integrated multi-level analysis of microarray, sequence, regulatory and other data</p><p>http://www.biologicalnetworks.org</p><p>BioMiner</p><p>Modeling, analyzing and visualizing biochemical pathways and networks</p><p>http://www.zbi.uni-saarland.de/chair/projects/BioMiner</p><p>Cell Illustrator&nbsp;</p><p>Petri nets for modeling and simulating biological networks</p><p>http://www.cellillustrator.com</p><p>COPASI</p><p>Analysis of biochemical networks and their dynamics</p><p>http://www.copasi.org/</p><p>Cytoscape&nbsp;</p><p>Network visualization and analysis. Over 200 plugins [60]</p><p>http://www.cytoscape.org/</p><p>Dizzy</p><p>Chemical kinetics stochastic simulation software</p><p>http://magnet.systemsbiology.net/software/Dizzy/</p><p>DyCoNet</p><p>Gephi plugin that can be used to identify dynamic communities in networks</p><p>https://github.com/juliemkauffman/DyCoNet</p><p>GENeVis&nbsp;</p><p>Network and pathway visualization</p><p>http://tinyurl.com/genevis/</p><p>GEPHI&nbsp;</p><p>Interactive visualization and exploration for any network and complex system, dynamic and hierarchical graph.</p><p>https://gephi.org</p><p>Igraph</p><p>Collection of network analysis tools with the emphasis on efficiency, portability and ease of use</p><p>http://igraph.sourceforge.net</p><p>Medusa</p><p>Semantic and multi-edged simple networks</p><p>https://sites.google.com/site/medusa3visualization/</p><p>NAViGaTOR</p><p>Visualizing and analyzing protein-protein interaction networks</p><p>http://tinyurl.com/navigator1/</p><p>N-Browse</p><p>Interactive graphical browser for biological networks</p><p>http://www.gnetbrowse.org/</p><p>NeAT</p><p>Topological and clustering analysis of networks</p><p>http://rsat.ulb.ac.be/neat/</p><p>Ondex&nbsp;</p><p>Data integration and visualization of large networks</p><p>http://www.ondex.org/</p><p>Osprey</p><p>Visualization and annotation of biological networks</p><p>http://biodata.mshri.on.ca/osprey/servlet/Index</p><p>Pajek&nbsp;</p><p>Analysis and visualization of large networks and social network analysis</p><p>http://vlado.fmf.uni-lj.si/pub/networks/pajek/</p><p>PathwayAssist&nbsp;</p><p>Navigation and analysis of biological pathways, gene regulation networks and protein interaction maps.</p><p>http://www.ariadnegenomics.com/downloads/</p><p>PIVOT&nbsp;</p><p>Layout algorithms for visualizing protein interactions and families</p><p>http://acgt.cs.tau.ac.il/pivot/</p><p>ProCope&nbsp;</p><p>Prediction and evaluation of protein complexes from purification data experiments</p><p>http://www.bio.ifi.lmu.de/Complexes/ProCope/</p><p>ProViz&nbsp;</p><p>Visualization and exploration of interaction networks. Gene Ontology and PSI-MI formats supported</p><p>http://cbi.labri.fr/eng/proviz.htm</p><p>SpectralNET&nbsp;</p><p>Network analysis and visualizations. Scatter plots and dimensionality reduction algorithms</p><p>https://www.broadinstitute.org/software/spectralnet</p><p>Tulip&nbsp;</p><p>Enables the development of algorithms, visual encodings, interaction techniques, data models and domain-specific visualizations</p><p>http://tulip.labri.fr/TulipDrupal/</p><p>VANESA&nbsp;</p><p>Automatic reconstruction and analysis of biological networks and Petri nets based on life-science database information</p><p>http://agbi.techfak.uni-bielefeld.de/vanesa/</p><p>VANTED&nbsp;</p><p>Network reconstruction, data visualization, integration of various data types, network simulation</p><p>http://tinyurl.com/vanted/</p><p>yEd</p><p>Creation of diagrams manually and import external data</p><p>http://tinyurl.com/yEdGraph/</p><p>Web tools for network analysis</p><p>APID&nbsp;</p><p>Unified protein-protein interactions from BIND, BioGRID, DIP, HPRD, IntAct and MINT</p><p>http://bioinfow.dep.usal.es/apid/</p><p>Arcadia&nbsp;</p><p>Translates text-based descriptions of biological networks (SBML files) into standardized diagrams (Systems Biology Graphical Notation Process Description maps)</p><p>http://arcadiapathways.sourceforge.net/</p><p>AVIS&nbsp;</p><p>Viewer for signaling networks</p><p>http://actin.pharm.mssm.edu/AVIS2</p><p>bioPIXIE&nbsp;</p><p>Discovery of biological networks from diverse functional genomic data</p><p>http://pixie.princeton.edu/pixie</p><p>CellPublisher</p><p>Interactive representations of biochemical processes</p><p>http://cellpublisher.gobics.de/</p><p>Graphle</p><p>Distributed network exploration and visualization of interactive large, dense graphs</p><p>http://tinyurl.com/graphle/</p><p>GraphWeb&nbsp;</p><p>Web server for graph-based analysis of biological networks</p><p>http://biit.cs.ut.ee/graphweb/</p><p>Hubba</p><p>Web-based service to explore the essential nodes in a network</p><p>http://hub.iis.sinica.edu.tw/Hubba</p><p>NetworkBLAST&nbsp;</p><p>Analysis of protein interaction networks across species to infer protein complexes that are conserved in evolution</p><p>http://www.cs.tau.ac.il/~bnet/networkblast.htm</p><p>Pathview&nbsp;</p><p>Tool set for pathway-based data integration and visualization</p><p>http://Pathview.r-forge.r-project.org/</p><p>PINA&nbsp;</p><p>Integrated platform for protein interaction network construction, filtering, analysis, visualization and management</p><p>http://cbg.garvan.unsw.edu.au/pina/home.do</p><p>ReMatch&nbsp;</p><p>Web-based tool for integration of user-given stoichiometric metabolic models into a database collected from public data sources</p><p>http://www.cs.helsinki.fi/group/sysfys/software/rematch/</p><p>SNOW&nbsp;</p><p>Gene mapping on a reference or human protein-protein interaction network that SNOW hosts</p><p>http://snow.bioinfo.cipf.es</p><p>STITCH&nbsp;</p><p>Resource to explore known and predicted interactions of chemicals and proteins</p><p>http://stitch.embl.de/</p><p>STRING</p><p>Protein interaction networks and integration of data such as genomic context, high-throughput experiments, conserved coexpression and previous knowledge derived from the literature</p><p>http://string-db.org</p><p>TVNViewer&nbsp;</p><p>An interactive visualization tool for exploring networks that change over time or space</p><p>http://www.sailing.cs.cmu.edu/main/?page_id=545</p><p>tYNA&nbsp;</p><p>System for managing, comparing and mining multiple networks</p><p>http://tyna.gersteinlab.org/tyna/</p><p>VisANT&nbsp;</p><p>Visualization, mining, analysis and modeling of biological networks, metabolic networks and ecosystems</p><p>http://visant.bu.edu/</p><p>&nbsp;</p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/pages/view/36842/gap-filling-or-contigs-extensions-tools</guid>
	<pubDate>Fri, 01 Jun 2018 08:07:32 -0500</pubDate>
	<link>https://bioinformaticsonline.com/pages/view/36842/gap-filling-or-contigs-extensions-tools</link>
	<title><![CDATA[Gap filling or Contigs extensions tools !]]></title>
	<description><![CDATA[
<p>There are many tools to perform gap filling using Illumina short reads, for example "GapFiller: a de novo assembly approach to fill the gap within paired reads" or "Toward almost closed genomes with GapFiller". There are also some tools like GAPresolution that can help to perform local re-assemblies using 454 reads. We used GAPresolution but it is not a very good software, it is useful only in some specific situations.</p>

<p>Take a look at the PRICE software from the DeRisi lab. Its meant to do something very similar. http://derisilab.ucsf.edu/index.php?page=software</p>

<p>You could also look at SSPACE (http://www.baseclear.com/landingpages/basetools-a-wide-range-of-bioinformatics-solutions/sspacev12/), ATLAS tools (http://www.hgsc.bcm.tmc.edu/content/bcm-hgsc-software), and SCARPA (http://compbio.cs.toronto.edu/hapsembler/scarpa.html).</p>

<p>See the PAGIT protocol: http://www.sanger.ac.uk/resources/software/pagit/ </p>

<p>In particular, take a look at the IMAGE tool: http://genomebiology.com/2010/11/4/R41 </p>

<p>Also SOAPdenovo has ha function for scaffolding. Not sure about ABYSS</p>

<p>Here there is a useful explanation of several tools.</p>

<p>https://bioinformaticsonline.com/search?q=scaffolding&amp;entity_type=object&amp;entity_subtype=bookmarks&amp;offset=0&amp;search_type=entities</p>

<p>I could be wrong, but the above answers to your hypothetical scenario appear to miss the point that you aren't interested in assembling the full genome, just the 100 kb part you're interested in. I suggest the following algorithm:</p>

<p>1. Start with the initial assembly C0 of the contigs you have identified as overlapping your region of interest, and the set S of reads those contigs contain. Let C = C0.</p>

<p>2. Repeat:<br />a. Identify paired-end reads (not in C) for which one or both ends align within, or extending, contigs in C.<br />b. Identify unpaired reads that align extending these new paired-end reads.<br />c. Construct a new assembly C' from C and the new reads identified in (a) and (b).<br />d. Trim C' so it does not extend more than 100 kb to either end of C0. Set C = C'.<br />e. Let S' denote the reads that contribute to C'. If S' does not contain any reads not present in S, stop. Otherwise, Set S = S'.</p>

<p>3. If you don't have a complete assembly of the region of interest, generate an STS for each end of each contig, probe a library for clones including these STSes, subclone these clones into a paired-end sequencing vector, and generate paired-end reads for this library; then try steps (1) and (2) again, adding these new sequencing reads to what you had before.</p>

<p>4. If your average sequencing depth for the region of interest exceeds 25 or so without filling all gaps, it is likely that the remaining gaps represent sequences that are not getting cloned in your sequencing vectors. Try different sequencing vectors.</p>
]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/41996/wgd%E2%80%94simple-command-line-tools-for-the-analysis-of-ancient-whole-genome-duplications</guid>
	<pubDate>Thu, 23 Jul 2020 05:49:45 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/41996/wgd%E2%80%94simple-command-line-tools-for-the-analysis-of-ancient-whole-genome-duplications</link>
	<title><![CDATA[wgd—simple command line tools for the analysis of ancient whole-genome duplications]]></title>
	<description><![CDATA[<p><span>wgd is a easy to use command-line tool for<span>&nbsp;</span></span><em>K</em><sub>S</sub><span><span>&nbsp;</span>distribution construction named wgd. The wgd suite provides commonly used<span>&nbsp;</span></span><em>K</em><sub>S</sub><span><span>&nbsp;</span>and colinearity analysis workflows together with tools for modeling and visualization, rendering these analyses accessible to genomics researchers in a convenient manner.</span></p>
<p><a href="https://academic.oup.com/bioinformatics/article/35/12/2153/5162749">https://academic.oup.com/bioinformatics/article/35/12/2153/5162749</a></p><p>Address of the bookmark: <a href="https://github.com/arzwa/wgd" rel="nofollow">https://github.com/arzwa/wgd</a></p>]]></description>
	<dc:creator>LEGE</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/43268/kmer-a-suite-of-tools-for-dna-sequence-analysis</guid>
	<pubDate>Wed, 18 Aug 2021 00:02:54 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/43268/kmer-a-suite-of-tools-for-dna-sequence-analysis</link>
	<title><![CDATA[Kmer: a suite of tools for DNA sequence analysis]]></title>
	<description><![CDATA[<p>More at&nbsp;https://help.rc.ufl.edu/doc/Kmer</p>
<p>This also includes:</p>
<ul>
<li>A2Amapper: ATAC, Assembly to Assembly Comparision tool:
<ul>
<li>Comparative mapping between two genome assemblies (same species), or between two different genomes (cross species).</li>
</ul>
</li>
</ul>
<ul>
<li>Sim4db:
<ul>
<li>Spliced alignment of cDNA and genomic sequences, from the same (sim4) or related (sim4cc) species. Optimized for high-throughput batched alignment.</li>
</ul>
</li>
</ul>
<ul>
<li>LEAFF:
<ul>
<li>LEAFF (ahem, Let's Extract Anything From Fasta) is a utility program for working with multi-fasta files. In addition to providing random access to the base level, it includes several analysis functions.</li>
</ul>
</li>
</ul>
<ul>
<li>Meryl:
<ul>
<li>An out-of-core k-mer counter. The amount of sequence that can be processed for any size k depends only on the amount of free disk space.</li>
</ul>
</li>
</ul><p>Address of the bookmark: <a href="https://help.rc.ufl.edu/doc/Kmer" rel="nofollow">https://help.rc.ufl.edu/doc/Kmer</a></p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/pages/view/44377/mitochondrial-genome-assembly-tools</guid>
	<pubDate>Wed, 06 Sep 2023 00:37:18 -0500</pubDate>
	<link>https://bioinformaticsonline.com/pages/view/44377/mitochondrial-genome-assembly-tools</link>
	<title><![CDATA[Mitochondrial genome assembly tools !]]></title>
	<description><![CDATA[<p>Mitochondrial genome assembly tools are specialized software and algorithms designed to accurately reconstruct the mitochondrial genome (mitogenome) from sequencing data, typically obtained through techniques like next-generation sequencing (NGS). The mitochondrial genome is relatively small compared to the nuclear genome, making it an ideal target for assembly. Here are some commonly used mitochondrial genome assembly tools:</p><p><strong>MitoFinder:</strong> Mitofinder is a pipeline to assemble mitochondrial genomes and annotate mitochondrial genes from trimmed read sequencing data.</p><p><strong>MitoHiFi:</strong> a python pipeline for mitochondrial genome assembly from PacBio high fidelity reads</p><p>MITObim: MITObim is a tool specifically developed for the iterative assembly of mitochondrial genomes. It starts with a reference mitogenome and iteratively refines the assembly using the read data.</p><p><strong>MITOS:</strong> MITOS is a web-based platform that provides a pipeline for annotating mitochondrial genomes. It integrates multiple software tools for assembly, annotation, and visualization of mitogenomes.</p><p><strong>MIRA:</strong> MIRA (Mimicking Intelligent Read Assembly) is a versatile genome assembly tool that can be used for mitochondrial genome assembly. It supports various sequencing technologies and allows for reference-based or de novo assembly.</p><p><strong>NOVOPlasty:</strong> NOVOPlasty is a user-friendly tool designed for de novo assembly of organelle genomes, including mitochondria. It utilizes a seed-and-extend algorithm and is suitable for both short-read and long-read data.</p><p><strong>MITOS2:</strong> MITOS2 is an updated version of the MITOS pipeline, which automates the annotation of mitochondrial genomes. It provides improved accuracy and additional features for mitochondrial genome analysis.</p><p><strong>GetOrganelle:</strong> While primarily designed for chloroplast genome assembly, GetOrganelle can also be used for mitochondrial genome assembly. It is particularly useful for dealing with high-throughput sequencing data.</p><p><strong>SPAdes:</strong> SPAdes (St. Petersburg genome assembler) is a versatile genome assembly tool that can be employed for mitochondrial genome assembly, especially when dealing with complex datasets that may contain nuclear mitochondrial DNA sequences (numts).</p><p><strong>IDBA-UD:</strong> IDBA-UD (Iterative De Bruijn Graph De Novo Assembler) is another de novo assembly tool that can be used for mitochondrial genome assembly, especially in cases with relatively low coverage.</p><p><strong>Velvet:</strong> Velvet is a de novo assembly tool that can be applied to mitochondrial genome assembly, especially when working with short-read data.</p><p>When selecting a mitochondrial genome assembly tool, it's important to consider the specific characteristics of your sequencing data, such as read length and coverage, as well as the complexity of the mitochondrial genome. Additionally, some tools are better suited for specific organisms or research objectives, so choosing the right tool will depend on your particular project requirements.</p>]]></description>
	<dc:creator>Abhi</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/21538/senior-research-fellow-at-all-india-institute-of-medical-sciences-aiims-delhi-delhi-delhi</guid>
  <pubDate>Wed, 11 Mar 2015 03:06:10 -0500</pubDate>
  <link></link>
  <title><![CDATA[SENIOR RESEARCH FELLOW at All India Institute of Medical Sciences (AIIMS Delhi) - Delhi, Delhi]]></title>
  <description><![CDATA[
<p>Applications are invited from eligible candidates for the following temporary post in an ICMR funded Research Project entitle “An Investigation to find out reasons for Phenotypic Heterogeneity/Variability in 22q11.2 Microdeletion Syndrome” in Department of Reproductive Biology, AIIMS, New Delhi PI: Dr. Ashutosh Halder, Professor, Department of Reproductive Biology </p>

<p>Name of the post: Senior Research Fellow (SRF) <br />Duration: 2 year <br />Salary: Rs. 28000/- per month + 30% HRA <br />Eligibility: MSc (life sciences) with 2 years research experience, NET/GATE qualified <br />Desirable: Experience in the field of Genomics, Epigenomics &amp; Bioinformatics <br />SELECTION PROCEDURE FOR ALL INDIA INSTITUTE OF MEDICAL SCIENCES (AIIMS DELHI) – SENIOR RESEARCH FELLOW POST: </p>

<p>Candidates can apply on or before 15/03/2015 <br />No Detailed information about the selection process is mentioned in the recruitment notification <br />HOW TO APPLY FOR SENIOR RESEARCH FELLOW VACANCY IN ALL INDIA INSTITUTE OF MEDICAL SCIENCES (AIIMS DELHI): </p>

<p>Deadline: 15.03.15 Submit your C.V in Room No. 2099 (Molecular Cytogenetics Lab), 2nd floor, Reproductive Biology, All India Institute of Medical Sciences, New Delhi-110029 or Email CV to: ashutoshhalder@gmail.com Your CV should include the details of your work experience &amp; degrees along with two references with e-mail and contact number Only 10 shortlisted (on merit) candidates will be invited for interview. No TA/DA will be applicable for the same</p>
]]></description>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/21472/asst-professor-at-central-university-of-jharkhand-cuj</guid>
  <pubDate>Sun, 01 Mar 2015 01:17:52 -0600</pubDate>
  <link></link>
  <title><![CDATA[Asst. Professor at Central University of Jharkhand (CUJ)]]></title>
  <description><![CDATA[
<p>Central University of Jharkhand (CUJ) has issued a recruitment notification for the recruitment of Assistant Professor through recruitment notification – Central University of Jharkhand (CUJ) Recruitment 2015 –  Advt. No.: CUJ/Advt./14-15/15 Date: 26th Feb. 2015. Candidates who have completed M.Sc, Ph.D can apply for the new recruitment notification from Central University of Jharkhand (CUJ)</p>

<p>Central University of Jharkhand has been granted funds by the Department of Biotechnology (DBT), Govt. of India to establish “DBT-Boost to CUJ Interdisciplinary Life Sciences Departments for Education and Research” Applications are invited for the Assistant Professor on purely temporary basis. The appointments shall be initially for a period of one year, renewable every year depending on the satisfactory performance, till the end of project.</p>

<p>Position: ASSISTANT PROFESSOR (Total 03)<br />Salary: 45,000/- (fixed) per month<br />Essential Qualifications: i. Good academic record with at least 55% marks (or an equivalent grade in a point scale wherever grading system is followed) at the master’s degree level with specialization in Biodiversity and Systematic/ Systems Biology/ Biophysics/ Bioinformatics from an Indian  University, or an equivalent degree from an accredited foreign university. ii. Besides fulfilling the above qualifications, the candidates must have cleared the National Eligibility Test (NET) conducted by the UGC, CSIR or similar test accredited by the UGC like SLET/SET. iii. Notwithstanding anything contained in i. and ii. candidates, who are or have been awarded Ph.D Degree in accordance with the University Grants Commission (Minimum Standards and Procedure for Award of Ph.D. Degree) Regulation, 2009, shall be exempted from therequirement of the minimum eligibility condition of NET/SLET/SET for recruitment and appointment of Assistant Professor. iv. NET/SLET/SET shall also not be required for such disciplines for which NET/SLET/SET in not conducted.<br />Desirable: Preference will be given to candidates having Ph.D in any of the above mentioned areas with NET</p>

<p>IMPORTANT DATES TO REMEMBER  :</p>

<p>Last Date to Apply for this job 24/3/2015</p>

<p>REFERENCE:</p>

<p>Central University of Jharkhand (CUJ) Recruitment 2015 –  Advt. No.: CUJ/Advt./14-15/15 Date: 26th Feb. 2015.</p>

<p>More at http://cuj.ac.in/careers.php</p>
]]></description>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/21624/ra-bioinformatics-at-ch-charan-singh-university-meerut</guid>
  <pubDate>Wed, 11 Mar 2015 09:07:07 -0500</pubDate>
  <link></link>
  <title><![CDATA[RA Bioinformatics at Ch. Charan Singh University, Meerut]]></title>
  <description><![CDATA[
<p>Ch. Charan Singh University, Meerut</p>

<p>http://molbiolabccsumrt.webs.com/</p>

<p>Applications are invited for one post of RA in a DBT funded research project “Creation of Bioinformatics Infrastructure Facility (BIF) for the promotion of Biology Teaching through Bioinformatics (BTBI) Scheme of BTISet”.</p>

<p>Candidate should have a Ph.D. degree in Bioinformatics/Biotechnology/Genetics and Plant Breeding with adequate experience in the area of Bioinformatics. If a suitable candidate for the post of RA is not available, a JRF/SRF may be appointed.</p>

<p>Candidate for the post of JRF/SRF should have Master’s degree in relevant subject with adequate experience in the area of Bioinformatics and should be NET/DBT-BINC qualified</p>

<p>Interested candidates may send their bio-data to Prof. H. S. Balyan (hsbalyan@gmail.com) (in exceptional case, bio-data may also be submitted at the time of interview) and attend the interview on Monday, March 30, 2015 at 11:00 AM in the Department of Genetics &amp; Plant Breeding, Ch. Charan Singh University, Meerut. Candidates shall bring their original documents at the time of interview for verification. No interview letters will be issued and no TA/DA will be paid.</p>
]]></description>
</item>

</channel>
</rss>