<?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/31566?offset=510</link>
	<atom:link href="https://bioinformaticsonline.com/related/31566?offset=510" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36849/glean-an-unsupervised-learning-system-to-integrate-disparate-sources-of-gene-structure-evidence</guid>
	<pubDate>Sat, 02 Jun 2018 07:38:33 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36849/glean-an-unsupervised-learning-system-to-integrate-disparate-sources-of-gene-structure-evidence</link>
	<title><![CDATA[GLEAN: an unsupervised learning system to integrate disparate sources of gene structure evidence]]></title>
	<description><![CDATA[<p><span>GLEAN is an unsupervised learning system to integrate disparate sources of gene structure evidence (gene model predictions, EST/protein genomic sequence alignments, SAGE/peptide tags, etc) to produce a consensus gene prediction, without prior training.</span></p><p>Address of the bookmark: <a href="https://sourceforge.net/projects/glean-gene/" rel="nofollow">https://sourceforge.net/projects/glean-gene/</a></p>]]></description>
	<dc:creator>Poonam Mahapatra</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/27679/cluego</guid>
	<pubDate>Thu, 02 Jun 2016 09:51:44 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/27679/cluego</link>
	<title><![CDATA[ClueGO]]></title>
	<description><![CDATA[<p>ClueGO is a Cytoscape plug-in that visualizes the non-redundant biological terms for large clusters of genes in a functionally grouped network and it can be used in combination with GOlorize.</p><p>Address of the bookmark: <a href="http://www.ici.upmc.fr/cluego/" rel="nofollow">http://www.ici.upmc.fr/cluego/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/blog/view/42188/tools-and-method-for-haplotype-phasing</guid>
	<pubDate>Fri, 04 Sep 2020 20:41:40 -0500</pubDate>
	<link>https://bioinformaticsonline.com/blog/view/42188/tools-and-method-for-haplotype-phasing</link>
	<title><![CDATA[Tools and Method for Haplotype phasing !]]></title>
	<description><![CDATA[<div>Huge amounts of genotype data are being produced with recent technological advances, both from increasingly&nbsp; comprehensive and inexpensive genome-wide SNP microarrays and from ever more accessible whole-genome and whole-exome sequencing methods. The vast amount of knowledge contained in these results, however, is best&nbsp; exploited through phased haplotypes, which classify the alleles co-located on the same chromosome. Since sequence and SNP array data normally take the form of unphased genotypes, one does not specifically observe which of the two parental chromosomes, or haplotypes, falls on a specific allele. Fortunately, new advances in both computational and laboratory methods promise improved determination of haplotype phase. Following are useful tools :</div><div>&nbsp;</div><p><strong>Arlequin:</strong>&nbsp;<a href="http://cmpg.unibe.ch/software/arlequin3/" target="_blank">http://cmpg.unibe.ch/software/arlequin3/</a></p><p><strong>BEAGLE:</strong>&nbsp;<a href="http://faculty.washington.edu/browning/beagle/beagle.html" target="_blank">http://faculty.washington.edu/browning/beagle/beagle.html</a></p><p><strong>fastPHASE:</strong>&nbsp;<a href="http://stephenslab.uchicago.edu/software.html" target="_blank">http://stephenslab.uchicago.edu/software.html</a></p><p><strong>GENEHUNTER:</strong>&nbsp;<a href="http://linkage.rockefeller.edu/soft/gh/" target="_blank">http://linkage.rockefeller.edu/soft/gh/</a></p><p><strong>The Genome Analysis Toolkit:</strong></p><p><a href="http://www.broadinstitute.org/gsa/wiki/index.php/The_Genome_Analysis_Toolkit" target="_blank">http://www.broadinstitute.org/gsa/wiki/index.php/The_Genome_Analysis_Toolkit</a></p><p><strong>IMPUTE2:</strong>&nbsp;<a href="https://mathgen.stats.ox.ac.uk/impute/impute_v2.html" target="_blank">https://mathgen.stats.ox.ac.uk/impute/impute_v2.html</a></p><p><strong>MACH:</strong>&nbsp;<a href="http://www.sph.umich.edu/csg/abecasis/MACH/" target="_blank">http://www.sph.umich.edu/csg/abecasis/MACH/</a></p><p><strong>MERLIN:</strong>&nbsp;<a href="http://www.sph.umich.edu/csg/abecasis/Merlin/" target="_blank">http://www.sph.umich.edu/csg/abecasis/Merlin/</a></p><p><strong>PHASE:</strong>&nbsp;<a href="http://stephenslab.uchicago.edu/software.html" target="_blank">http://stephenslab.uchicago.edu/software.html</a></p><p><strong>PL-EM:</strong>&nbsp;<a href="http://www.people.fas.harvard.edu/~junliu/plem/" target="_blank">http://www.people.fas.harvard.edu/~junliu/plem/</a></p><p><strong>&ldquo;Read-backed phasing&rdquo; algorithm</strong>:&nbsp;<a href="http://www.broadinstitute.org/gsa/wiki/index.php/Read-backed_phasing_algorithm" target="_blank">http://www.broadinstitute.org/gsa/wiki/index.php/Read-backed_phasing_algorithm</a></p><p><strong>SHAPE-IT:</strong>&nbsp;<a href="http://www.griv.org/shapeit/" target="_blank">http://www.griv.org/shapeit/</a></p>]]></description>
	<dc:creator>Manisha Mishra</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/pages/view/36392/protein-protein-interaction-sites-predictions</guid>
	<pubDate>Wed, 25 Apr 2018 04:53:20 -0500</pubDate>
	<link>https://bioinformaticsonline.com/pages/view/36392/protein-protein-interaction-sites-predictions</link>
	<title><![CDATA[Protein-Protein Interaction Sites Predictions !]]></title>
	<description><![CDATA[<p><span>The study of Protein&ndash;Protein Interactions (PPIs) has a crucial role in biology, medicine and the pharmaceutical industry. PPIs can be investigated from two aspects: The interaction partners of a specific protein and the amino acid residues participating in a given PPI. Information about a protein&rsquo;s interaction partners allows scientists to construct protein interaction networks, such as signaling pathways, which in turn facilitate the understanding of many biological and clinical observations.&nbsp;</span></p><p><span>Following are the list of tools commonly used to PPIs predictions:</span></p><p>Protein-Protein Interaction Sites</p><p><a href="http://pipe.scs.fsu.edu/ppisp.html" target="_blank">PPISP</a></p><p>A consensus neural network method for predicting protein-protein interaction sites</p><p><a href="http://biunit.naist.jp/homcos/" target="_blank">HOMCOS</a></p><p>A server to predict interacting protein pairs and interacting sites by homology modeling of complex structures</p><p><a href="http://prism.ccbb.ku.edu.tr/hotpoint/" target="_blank">HotPOINT</a></p><p>Prediction of protein interfaces using an empirical model</p><p><a href="http://cubic.bioc.columbia.edu/services/isis/" target="_blank">ISIS</a></p><p>Prediction of interaction hotspots from sequence</p><p><a href="http://kfc.mitchell-lab.org/" target="_blank">KFC server</a></p><p>Automated decision-tree approach to predicting protein-protein interaction hot spots</p><p><a href="http://pipe.scs.fsu.edu/meta-ppisp.html" target="_blank">meta-PPISP</a></p><p>A meta server for predicting protein-protein interaction sites. meta-PPISP is built on three individual web servers:&nbsp;<a href="https://bip.weizmann.ac.il/toolbox/structure/binding.htm#cons">cons-PPISP</a>,&nbsp;<a href="https://bip.weizmann.ac.il/toolbox/structure/binding.htm#pin">PINUP</a>, and&nbsp;<a href="https://bip.weizmann.ac.il/toolbox/structure/binding.htm#pro">Promate</a></p><p><a href="http://www.molsoft.com/oda.html" target="_blank">ODA</a></p><p>Identification of optimal surface patches with the lowest docking desolvation energy values</p><p><a href="http://sparks.informatics.iupui.edu/PINUP/" target="_blank">PINUP</a></p><p>Protein binding site prediction with an empirical scoring function</p><p>Other Sites (DNA, RNA, Metals)</p><p><a href="http://ligin.weizmann.ac.il/~lpgerzon/mbs4/mbs.cgi" target="_blank">CHED</a>&nbsp;</p><p>Web server for predicting soft metal binding sites in proteins</p><p><a href="http://cssb.biology.gatech.edu/skolnick/webservice/DBD-Hunter/" target="_blank">DBD-Hunter</a></p><p>A knowledge-based method for the prediction of DNA-protein interactions</p><p><a href="http://pipe.scs.fsu.edu/displar.html" target="_blank">DISPLAR</a></p><p>Given the structure of a protein known to bind DNA, the method predicts residues that contact DNA using neural network method</p><p><a href="http://idbps.tau.ac.il/" target="_blank">iDBPs</a></p><p>Predicts DNA binding proteins for proteins with known 3D structure.</p><p><a href="http://pfp.technion.ac.il/" target="_blank">PFplus</a></p><div style="text-align: left;">A tool for extracting and displaying positive electrostatic patches on protein surfaces which can be indicative of nucleic acid binding interfaces.</div>]]></description>
	<dc:creator>Poonam Mahapatra</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/27827/guest-faculty-centre-for-bioinformatics-at-pondicherry-university</guid>
  <pubDate>Wed, 15 Jun 2016 03:44:31 -0500</pubDate>
  <link></link>
  <title><![CDATA[Guest Faculty Centre for Bioinformatics at Pondicherry University]]></title>
  <description><![CDATA[
<p>Guest Faculty Centre For Bioinformatics Jobs opportunity in Pondicherry University<br />Qualification : M.Phil. (with NET/SLET)/ M.Tech. / M.E. in Computer Science with a minimum of 55% of marks as per UGC norms.<br />Desirable : Ph.D and Teaching experience in Perl and Java programming.<br />Honorarium : Rs. 1,000/- per lecture (subject to a maximum of Rs. 25,000/- per month)<br />How to apply<br />Walk-in-Interview will be held on 29.06.2016 (Wednesday) at 2:30 P.M at the office of Centre for Bioinformatics, Pondicherry University, Puducherry — 605 014. Interested eligible candidates may attend the Walk-in-Interview along with all original certificates, self attested photocopies and testimonials with a copy of their bio-data. Candidates reporting after 2:30 P.M will not be entertained.</p>

<p>More at http://www.pondiuni.edu.in/news?quicktabs_2=5#quicktabs-2</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37520/mmgenome-tools-for-extracting-individual-genomes-from-metagneomes</guid>
	<pubDate>Thu, 09 Aug 2018 17:41:17 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37520/mmgenome-tools-for-extracting-individual-genomes-from-metagneomes</link>
	<title><![CDATA[mmgenome: Tools for extracting individual genomes from metagneomes]]></title>
	<description><![CDATA[<p>The mmgenome toolbox enables reproducible extraction of individual genomes from metagenomes. It builds on the&nbsp;<a href="http://madsalbertsen.github.io/multi-metagenome/">multi-metagenome</a>&nbsp;concept, but wraps most of the process of extracting genomes in simple R functions. Thereby making the whole process of binning easy and at the same time reproducible through the Rmarkdown format.</p>
<p>The mmgenome R package also facilitates effortless integration with additional data sources and hence should not be seen as "yet another binning method", but rather a package to integrate different binning strategies.</p>
<p>All functions in the mmgenome R package has associated documentation, check it out in R by e.g.&nbsp;<code>?mmplot</code>.</p><p>Address of the bookmark: <a href="https://github.com/MadsAlbertsen/mmgenome" rel="nofollow">https://github.com/MadsAlbertsen/mmgenome</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<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/pages/view/35395/comprehensive-list-of-visualization-tools-for-biological-pathways</guid>
	<pubDate>Tue, 30 Jan 2018 06:01:31 -0600</pubDate>
	<link>https://bioinformaticsonline.com/pages/view/35395/comprehensive-list-of-visualization-tools-for-biological-pathways</link>
	<title><![CDATA[Comprehensive list of visualization tools for biological pathways]]></title>
	<description><![CDATA[<p>The study of biological pathways is a key to understand the different processes inside a cell: proteins exert their function not in isolation but in a tightly controlled network of interactions and reactions. Activation of a pathway typically leads to a change of state in the cell. Pathways come in different flavors, depending on their functions in the cell &ndash; the three main types are metabolic pathways, gene regulatory pathways, and signaling pathways. These biological pathways and networks are not only an appropriate approach to visualize molecular reactions. They have also become one leading method in -omics data analysis and visualization.</p><p><img src="https://photos-1.dropbox.com/t/2/AABemz29qAuSTqSzr5mEsQE7JIMxZlU1CBy0E5n0yUVYbA/12/85115969/png/32x32/1/_/1/2/pathway.png/EOfXoUIYrJ8CIAcoBw/01qsT2eykyPvSH-rNpy3cqioDzZPc4i-xULG3BEZvCk?preserve_transparency=1&amp;size=1280x960&amp;size_mode=3" width="800" height="533" alt="image" style="border: 0px;"></p><p>Following are the comprehensive list of visualization tools for biological pathways:</p><p>BiNA</p><p>Drawings of metabolic networks supporting hiding of cofactors and drawing of chemical structures</p><p>http://bina.unipax.info/</p><p>BioTapestry</p><p>Interactive tool for building, visualizing and sharing gene regulatory network models over the web</p><p>http://www.biotapestry.org/</p><p>Caleydo</p><p>Visual analysis framework targeted at biomolecular data. Visualization of interdependencies between multiple datasets</p><p>http://www.caleydo.org/</p><p>CellDesigner</p><p>A modeling tool for biochemical networks</p><p>http://www.celldesigner.org/</p><p>Edinburgh Pathway Editor</p><p>Edit and draw pathway diagrams</p><p>http://epe.sourceforge.net/SourceForge/EPE.html</p><p>GenMAPP</p><p>Visualization of gene expression and other genomic data on maps representing biological pathways and groupings of genes</p><p>http://www.genmapp.org/</p><p>Ingenuity IPA</p><p>Data integration platform and manually annotated pathways</p><p>http://tinyurl.com/IngenuityPath</p><p>JDesigner</p><p>Graphical modeling environment for biochemical reaction networks</p><p>http://jdesigner.sourceforge.net/Site/JDesigner.html</p><p>KaPPA View</p><p>Plant pathways</p><p>http://kpv.kazusa.or.jp/</p><p>KEGG Atlas</p><p>Interactive Kyoto Encyclopedia of Genes and Genomes pathways</p><p>http://www.genome.jp/kegg/</p><p>Omix&nbsp;</p><p>Visualizing multi-omics data in metabolic networks</p><p>https://www.omix-visualization.com</p><p>PathVisio&nbsp;</p><p>Biological pathway analysis software that allows drawing, editing and analysis of biological pathways</p><p>http://www.pathvisio.org/</p><p>VitaPad&nbsp;</p><p>Application to visualize biological pathways and map experimental data to them</p><p>http://tinyurl.com/vitapad/</p><p>Web tools for pathways</p><p>ArrayXPath&nbsp;</p><p>Mapping and visualizing microarray gene-expression data and integrated biological pathway resources using SVG</p><p>http://tinyurl.com/ArrayXPath/</p><p>GEPAT&nbsp;</p><p>Integrated analysis of transcriptome data in genomic, proteomic and metabolic contexts</p><p>http://gepat.sourceforge.net/</p><p>iPath&nbsp;</p><p>Web-based tool for the visualization, analysis and customization of pathway maps</p><p>http://pathways.embl.de/</p><p>Kegg-Based Viewer&nbsp;</p><p>KEGG-based pathway visualization tool for complex high-throughput data</p><p>http://www.g-language.org/data/marray/</p><p>MapMan&nbsp;</p><p>User-driven tool that displays large datasets onto diagrams of metabolic pathways or other processes</p><p>http://mapman.gabipd.org/web/guest/mapman</p><p>MetPA&nbsp;</p><p>Analysis and visualization of metabolomic data within the biological context of metabolic pathways</p><p>http://metpa.metabolomics.ca</p><p>Omics Viewer&nbsp;</p><p>Data mapping on BioCyc pathways (collection of 5500 pathway/genome databases)</p><p>http://www.biocyc.org/</p><p>Pathway Explorer</p><p>Interactive Java drawing tool for the construction of biological pathway diagrams in a visual way and the annotation of the components and interactions between them</p><p>http://genome.tugraz.at/pathwayexplorer/pathwayexplorer_description.shtml</p><p>Pathway projector&nbsp;</p><p>Zoomable pathway browser using KEGG atlas and Google Maps API</p><p>http://www.g-language.org/PathwayProjector/</p><p>PATIKA&nbsp;</p><p>Integrated environment composed of a central database and a visual editor, built around an extensive ontology and an integration framework</p><p>http://www.cs.bilkent.edu.tr/~patikaweb/</p><p>Reactome SkyPainter&nbsp;</p><p>Visualization of over-represented pathways and reactions from gene lists</p><p>http://www.reactome.org/skypainter-2</p><p>WikiPathways</p><p>Wiki-based, open, public platform dedicated to the curation of biological pathways by and for the scientific community</p><p>http://www.wikipathways.org/</p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/27961/nearhgt</guid>
	<pubDate>Wed, 22 Jun 2016 05:41:57 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/27961/nearhgt</link>
	<title><![CDATA[NearHGT]]></title>
	<description><![CDATA[<p>Horizontal gene transfer (HGT), the transfer of genetic material between organisms, is crucial for genetic innovation and the evolution of genome architecture. Existing HGT detection algorithms rely on a strong phylogenetic signal distinguishing the transferred sequence from ancestral (vertically derived) genes in its recipient genome. Detecting HGT between closely related species or strains is challenging, as the phylogenetic signal is usually weak and the nucleotide composition is normally nearly identical. Nevertheless, there is a great importance in detecting HGT between congeneric species or strains, especially in clinical microbiology, where understanding the emergence of new virulent and drug-resistant strains is crucial, and often time-sensitive.</p>
<p>We developed a novel, self-contained technique named&nbsp;<em>Near HGT</em>, based on the&nbsp;<em>synteny index</em>, to measure the divergence of a gene from its native genomic environment and used it to identify candidate HGT events between closely related strains. The method confirms candidate transferred genes based on the&nbsp;<em>constant relative mutability</em>&nbsp;(CRM). Using CRM, the algorithm assigns a confidence score based on &ldquo;unusual&rdquo; sequence divergence. A gene exhibiting exceptional deviations according to both synteny and mutability criteria, is considered a validated HGT product. We first employed the technique to a set of three&nbsp;<em>E. coli</em>&nbsp;strains and detected several highly probable horizontally acquired genes. We then compared the method to existing HGT detection tools using a larger strain data set.</p>
<p>When combined with additional approaches our new algorithm provides richer picture and brings us closer to the goal of detecting all newly acquired genes in a particular strain.</p>
<p><strong>Availability:</strong><span>&nbsp;The method is publicly available at</span><a href="http://research.haifa.ac.il/~ssagi/software/nearHGT.zip">http://research.haifa.ac.il/~ssagi/software/nearHGT.zip</a></p><p>Address of the bookmark: <a href="http://journals.plos.org/ploscompbiol/article?id=10.1371/journal.pcbi.1004408" rel="nofollow">http://journals.plos.org/ploscompbiol/article?id=10.1371/journal.pcbi.1004408</a></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>

</channel>
</rss>