<?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/29912?offset=1400</link>
	<atom:link href="https://bioinformaticsonline.com/related/29912?offset=1400" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/30831/fsa-fast-statistical-alignment</guid>
	<pubDate>Mon, 06 Feb 2017 04:26:01 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/30831/fsa-fast-statistical-alignment</link>
	<title><![CDATA[FSA: Fast Statistical Alignment]]></title>
	<description><![CDATA[<p><span>FSA is a probabilistic multiple sequence alignment algorithm which uses a "distance-based" approach to aligning homologous protein, RNA or DNA sequences. Much as distance-based phylogenetic reconstruction methods like Neighbor-Joining build a phylogeny using only pairwise divergence estimates, FSA builds a multiple alignment using only pairwise estimations of homology. This is made possible by the sequence annealing technique for constructing a multiple alignment from pairwise comparisons, developed by Ariel Schwartz in&nbsp;</span><a href="http://www.eecs.berkeley.edu/Pubs/TechRpts/2007/EECS-2007-39.html">"Posterior Decoding Methods for Optimization and Control of Multiple Alignments</a><span>."</span></p>
<p>FSA brings the high accuracies previously available only for small-scale analyses of proteins or RNAs to large-scale problems such as aligning thousands of sequences or megabase-long sequences. FSA introduces several novel methods for constructing better alignments:</p>
<ul>
<li>FSA uses machine-learning techniques to estimate gap and substitution parameters on the fly for each set of input sequences. This "query-specific learning" alignment method makes FSA very robust: it can produce superior alignments of sets of homologous sequences which are subject to very different evolutionary constraints.</li>
<li>FSA is capable of aligning hundreds or even thousands of sequences using a randomized inference algorithm to reduce the computational cost of multiple alignment. This randomized inference can be over ten times faster than a direct approach with little loss of accuracy.</li>
<li>FSA can quickly align very long sequences using the "anchor annealing" technique for resolving anchors and projecting them with transitive anchoring. It then stitches together the alignment between the anchors using the methods described above.</li>
<li>The included GUI, MAD (Multiple Alignment Display), can display the intermediate alignments produced by FSA, where each character is colored according to the probability that it is correctly aligned (see the picture and&nbsp;<a href="http://fsa.sourceforge.net/images/Suchard_SIV.fsa.mov">movie</a>&nbsp;at the top of the page).</li>
</ul>
<p><span>You can see more information on the&nbsp;</span><a href="http://fsa.sourceforge.net/FAQ.html">FAQ</a><span>.&nbsp;</span></p>
<p>&nbsp;</p><p>Address of the bookmark: <a href="http://fsa.sourceforge.net/" rel="nofollow">http://fsa.sourceforge.net/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/30897/finestructure-v2-globetrotter</guid>
	<pubDate>Mon, 13 Feb 2017 08:40:23 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/30897/finestructure-v2-globetrotter</link>
	<title><![CDATA[fineSTRUCTURE v2 &amp; GLOBETROTTER]]></title>
	<description><![CDATA[<p>Software available at this site</p>
<div>
<ul>
<li><a href="https://people.maths.bris.ac.uk/%7Emadjl/finestructure/finestructure_info.html">FineSTRUCTURE version 2</a>, a pipeline for running ChromoPainter and FineSTRUCTURE for population inference. A GUI is available for interpretation. Download from the <a href="https://people.maths.bris.ac.uk/%7Emadjl/finestructure/finestructure.html">Downloads</a> page.</li>
<li><a href="https://people.maths.bris.ac.uk/%7Emadjl/finestructure/finestructureR.html">FineSTRUCTURE R scripts</a>, a facility for exploring the results when the GUI is unavailable.</li>
<li><a href="https://people.maths.bris.ac.uk/%7Emadjl/finestructure/globetrotter.html">GLOBETROTTER</a>, the admixture dating method based on ChromoPainter. Download from the <a href="https://people.maths.bris.ac.uk/%7Emadjl/finestructure/finestructure.html">Downloads</a> page.</li>
<li><a href="https://people.maths.bris.ac.uk/%7Emadjl/finestructure/admixture.html">AdmixturePainting</a>, A set of R tools to inmterpret the results of ADMIXTURE and STRUCTURE-like mixture models.</li>
<li><a href="https://people.maths.bris.ac.uk/%7Emadjl/finestructure/radpainter.html">RADpainter</a>, finestructure and ChromoPainter for RAD tag data used for non-model organisms.</li>
<li>Scripts to perform many types of conversion. Included in the main software download from the <a href="https://people.maths.bris.ac.uk/%7Emadjl/finestructure/finestructure.html">Downloads</a> page.</li>
</ul>
What this page is This page provides information about and downloads for <strong>methodology for Chromosome Painting</strong>. It is not a facility to analyse your genome. Sorry if you were misled by the punchy name!<br> About Chromosome Painting Painting is an efficient way of identifying important haplotype information from dense genotype data. It describes ancestry in an efficient way suitable for a range of further analyses, including population identification and admixture dating.</div><p>Address of the bookmark: <a href="http://paintmychromosomes.com/" rel="nofollow">http://paintmychromosomes.com/</a></p>]]></description>
	<dc:creator>Shruti Paniwala</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/31207/laj-viewing-and-manipulating-the-output-from-pairwise-alignment-programs</guid>
	<pubDate>Wed, 01 Mar 2017 08:35:40 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/31207/laj-viewing-and-manipulating-the-output-from-pairwise-alignment-programs</link>
	<title><![CDATA[Laj: viewing and manipulating the output from pairwise alignment programs]]></title>
	<description><![CDATA[<p>Laj is a tool for viewing and manipulating the output from pairwise alignment programs such as <a href="http://bio.cse.psu.edu/">blastz</a>. It can display interactive dotplot, pip, and text representations of the alignments, a diagram showing the locations of exons and repeats, and annotation links to other web sites containing additional information about particular regions.</p>
<p>The program is written in Java in order to provide a graphical user interface that is portable across a variety of computer platforms; indeed its name stands for "Local Alignments with Java". Currently it exists in two forms, a stand-alone application and a web-based applet, with slightly different capabilities.</p><p>Address of the bookmark: <a href="http://www.bx.psu.edu/~ratan/" rel="nofollow">http://www.bx.psu.edu/~ratan/</a></p>]]></description>
	<dc:creator>Abhimanyu Singh</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/view/459</guid>
	<pubDate>Thu, 11 Jul 2013 14:39:19 -0500</pubDate>
	<link>https://bioinformaticsonline.com/view/459</link>
	<title><![CDATA[Python vs Perl]]></title>
	<description><![CDATA[<p>Why bioinformatician still using Perl when Python is easy to code, good in ReXp and faster than perl?</p>]]></description>
	<dc:creator>Rahul Agarwal</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/840/junior-research-fellow-jrf</guid>
  <pubDate>Sat, 13 Jul 2013 11:17:22 -0500</pubDate>
  <link></link>
  <title><![CDATA[Junior Research Fellow (JRF)]]></title>
  <description><![CDATA[
<p>School of Biotechnology<br />Gautam Buddha University<br />Greater Noida, UP - 201310</p>

<p>Applications are invited for one position of Junior Research Fellow (JRF) in a Department of Biotechnology (DBT) sponsored research project entitled “Design, synthesis and evaluation of potent aminopeptidase inhibitors for malarial therapy” under the supervision of Dr. Shakti Sahi.</p>

<p>The monthly fellowship of JRF will be Rs 12,000/- plus HRA as per the University rules.</p>

<p>Essential Qualification: Master degree in any discipline of Life Science with NET qualified.</p>

<p>Desirable Qualification: Preference will be given to candidates having research experience in in silico drug designing/Bioinformatics.</p>

<p>Interested candidates may send their resume to undersigned on or before 14th July 2013 by post-mail/e-mail shaktis@gbu.ac.in or shaktisahi@gmail.com. No TA and DA will be paid for appearing for the interview. Dr. Shakti Sahi (Principle Investigator)</p>

<p>Advertisement:<br />www.gbu.ac.in/Recruitment/JRF_Advt_DBTProject_Shakt</p>
]]></description>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/researchlabs/view/847/nedelec-lab</guid>
  <pubDate>Sat, 13 Jul 2013 17:38:55 -0500</pubDate>
  <link></link>
  <title><![CDATA[Nedelec Lab]]></title>
  <description><![CDATA[
<p>Location :European Molecular Biology Laboratory (EMBL), Heidelberg, Germany.</p>

<p>Our long-term research objective is to understand microtubule organization in living cells, with an emphasis on mitosis. We develop in-vitro assays, quantitative image analysis and cytosim, a computer simulation to study cellular architecture from a mechanistic angle, modeling the interactions of microtubules and related proteins such as molecular motors. In the past, we combined simulations and experiments to study microtubule self-organization, and the mechanical stability of two interacting asters. More recently, we looked at the focusing of mitotic fibers, the formation of antiparallel arrays of microtubules in fission yeast and the spindle positionning in C. elegans.<br />We are supported by BioMS, an initiative in Systems Biology, and involved in Cell networks.</p>

<p>Link: http://www.cytosim.org</p>
]]></description>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/researchlabs/view/855/bahlo-lab</guid>
  <pubDate>Sun, 14 Jul 2013 12:17:38 -0500</pubDate>
  <link></link>
  <title><![CDATA[Bahlo Lab]]></title>
  <description><![CDATA[
<p>Melanie Bahlo is an applied statistician working in the areas of statistical genetics, bioinformatics and population genetics. Her main area of research is linkage mapping, in humans and mice.</p>

<p>Research Area:<br />Mapping loci in ENU mutants in mice in complex pedigrees<br />Investigation of DNA sharing in distantly related individuals<br />CNV analysis in pedigrees and connections to linkage studies<br />Statistical Genetics</p>

<p>Link @ http://www.wehi.edu.au/faculty_members/dr_melanie_bahlo</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/32131/wgs-celera-assembler-version-83rc2</guid>
	<pubDate>Mon, 10 Apr 2017 04:45:40 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/32131/wgs-celera-assembler-version-83rc2</link>
	<title><![CDATA[WGS Celera Assembler version 8.3rc2]]></title>
	<description><![CDATA[<p>These are release notes for Celera Assembler version 8.3rc2, which was released on May 24, 2015.<br><br>This distribution package provides a stable, tested, documented version of the software.&nbsp; The distribution is usable on most Unix-like platforms, and some platforms have pre-compiled binary distributions ready for installation.<br><br>The source code package includes full source code (revision 4627), Makefiles, and scripts.&nbsp; A subset of the kmer package (http://kmer.sourceforge.net/, version r1994), used by some modules of Celera Assembler, is included.&nbsp; This distribution includes [http://samtools.sourceforge.net/ SAMtools], [http://www.cbcb.umd.edu/software/jellyfish/ Jellyfish 2.0], [https://github.com/pbjd/pbutgcns PBUTGCNS], [https://github.com/PacificBiosciences/pbdagcon PBDAGCON], [https://github.com/PacificBiosciences/BLASR BLASR], and parts of the [https://github.com/PacificBiosciences/FALCON/tree/v0.1.3 Falcon assembler].<br><br>Full documentation can be found online at http://wgs-assembler.sourceforge.net/.</p>
<p>Interesting scripts within it</p>
<p>urbe@urbo214b[bin] ls&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; []<br>-rwxrwxr-x 1 urbe urbe&nbsp; 11K Apr 10 11:41 addCNSToStore<br>-rwxrwxr-x 1 urbe urbe 575K Apr 10 11:41 addReadsToUnitigs<br>-rwxrwxr-x 1 urbe urbe 128K Apr 10 11:41 analyzeBest<br>-rwxrwxr-x 1 urbe urbe 257K Apr 10 11:41 analyzePosMap<br>-rwxrwxr-x 1 urbe urbe 1,5M Apr 10 11:41 analyzeScaffolds<br>-rwxrwxr-x 1 urbe urbe 224K Apr 10 11:41 asmOutputFasta<br>-rwxrwxr-x 1 urbe urbe 448K Apr 10 11:41 asmOutputStatistics<br>-rwxrwxr-x 1 urbe urbe 2,4K Apr 10 11:41 asmToAGP.pl<br>-rwxrwxr-x 1 urbe urbe 7,6M Apr 10 11:41 blasr<br>-rwxrwxr-x 1 urbe urbe 1,6M Apr 10 11:41 bogart<br>-rwxrwxr-x 1 urbe urbe 183K Apr 10 11:41 bogus<br>-rwxrwxr-x 1 urbe urbe 272K Apr 10 11:41 bogusness<br>-rwxrwxr-x 1 urbe urbe 247K Apr 10 11:41 buildPosMap<br>-rwxrwxr-x 1 urbe urbe 213K Apr 10 11:41 buildRefContigs<br>-rwxrwxr-x 1 urbe urbe 990K Apr 10 11:41 buildUnitigs<br>-rwxrwxr-x 1 urbe urbe&nbsp; 18K Apr 10 11:41 ca2ace.pl<br>-rwxrwxr-x 1 urbe urbe&nbsp; 12K Apr 10 11:41 caqc_help.ini<br>-rwxrwxr-x 1 urbe urbe&nbsp; 61K Apr 10 11:41 caqc.pl<br>-rwxrwxr-x 1 urbe urbe&nbsp; 23K Apr 10 11:41 cat-corrects<br>-rwxrwxr-x 1 urbe urbe&nbsp; 24K Apr 10 11:41 cat-erates<br>-rwxrwxr-x 1 urbe urbe 1,9M Apr 10 11:41 cgw<br>-rwxrwxr-x 1 urbe urbe 1,4M Apr 10 11:41 cgwDump<br>-rwxrwxr-x 1 urbe urbe 204K Apr 10 11:41 chimChe<br>-rwxrwxr-x 1 urbe urbe 201K Apr 10 11:40 chimera<br>-rwxrwxr-x 1 urbe urbe 220K Apr 10 11:41 classifyMates<br>-rwxrwxr-x 1 urbe urbe 201K Apr 10 11:41 classifyMatesApply<br>-rwxrwxr-x 1 urbe urbe 215K Apr 10 11:41 classifyMatesPairwise<br>-rwxrwxr-x 1 urbe urbe 366K Apr 10 11:41 computeCoverageStat<br>-rwxrwxr-x 1 urbe urbe 9,8K Apr 10 11:41 convert-fasta-to-v2.pl<br>-rwxrwxr-x 1 urbe urbe&nbsp; 48K Apr 10 11:41 convertOverlap<br>-rwxrwxr-x 1 urbe urbe 119K Apr 10 11:41 convertSamToCA<br>-rwxrwxr-x 1 urbe urbe&nbsp; 20K Apr 10 11:41 convertToPBCNS<br>-rwxrwxr-x 1 urbe urbe 197K Apr 10 11:41 correct-frags<br>-rwxrwxr-x 1 urbe urbe 259K Apr 10 11:41 correct-olaps<br>-rwxrwxr-x 1 urbe urbe 520K Apr 10 11:41 correctPacBio<br>-rwxrwxr-x 1 urbe urbe 540K Apr 10 11:41 ctgcns<br>-rwxrwxr-x 1 urbe urbe 162K Apr 10 11:40 deduplicate<br>-rwxrwxr-x 1 urbe urbe&nbsp; 37K Apr 10 11:41 demotePosMap<br>-rwxrwxr-x 1 urbe urbe 1,5M Apr 10 11:41 dumpCloneMiddles<br>-rwxrwxr-x 1 urbe urbe 124K Apr 10 11:41 dumpPBRLayoutStore<br>-rwxrwxr-x 1 urbe urbe 1,3M Apr 10 11:41 dumpSingletons<br>-rwxrwxr-x 1 urbe urbe 171K Apr 10 11:41 erate-estimate<br>-rwxrwxr-x 1 urbe urbe 221K Apr 10 11:40 estimate-mer-threshold<br>-rwxrwxr-x 1 urbe urbe 1,5M Apr 10 11:41 extendClearRanges<br>-rwxrwxr-x 1 urbe urbe 1,3M Apr 10 11:41 extendClearRangesPartition<br>-rwxrwxr-x 1 urbe urbe 205K Apr 10 11:40 extractmessages<br>-rwxrwxr-x 1 urbe urbe 7,2M Apr 10 11:41 falcon_sense<br>-rwxrwxr-x 1 urbe urbe 9,8K Apr 10 11:41 fastaToCA<br>-rwxrwxr-x 1 urbe urbe 124K Apr 10 11:40 fastqAnalyze<br>-rwxrwxr-x 1 urbe urbe 137K Apr 10 11:40 fastqSample<br>-rwxrwxr-x 1 urbe urbe&nbsp; 62K Apr 10 11:40 fastqSimulate<br>-rwxrwxr-x 1 urbe urbe 121K Apr 10 11:40 fastqSimulate-sort<br>-rwxrwxr-x 1 urbe urbe 246K Apr 10 11:40 fastqToCA<br>-rwxrwxr-x 1 urbe urbe 140K Apr 10 11:41 filterOverlap<br>-rwxrwxr-x 1 urbe urbe 341K Apr 10 11:40 finalTrim<br>-rwxrwxr-x 1 urbe urbe 228K Apr 10 11:41 fixUnitigs<br>-rwxrwxr-x 1 urbe urbe 147K Apr 10 11:40 fragmentDepth<br>-rwxrwxr-x 1 urbe urbe&nbsp; 29K Apr 10 11:41 fragsInVars<br>-rwxrwxr-x 1 urbe urbe 545K Apr 10 11:41 frgs2clones<br>-rwxrwxr-x 1 urbe urbe 398K Apr 10 11:40 gatekeeper<br>-rwxrwxr-x 1 urbe urbe 139K Apr 10 11:40 gatekeeperbench<br>-rwxrwxr-x 1 urbe urbe 167K Apr 10 11:40 gkpStoreCreate<br>-rwxrwxr-x 1 urbe urbe 147K Apr 10 11:40 gkpStoreDumpFASTQ<br>-rwxrwxr-x 1 urbe urbe 184K Apr 10 11:41 greedyFragmentTiling<br>-rwxrwxr-x 1 urbe urbe 1,6K Apr 10 11:41 greedy_layout_to_IUM<br>-rwxrwxr-x 1 urbe urbe 142K Apr 10 11:40 initialTrim<br>-rwxrwxr-x 1 urbe urbe 967K Apr 10 11:41 jellyfish<br>-rwxrwxr-x 1 urbe urbe 219K Apr 10 11:41 markRepeatUnique<br>-rwxrwxr-x 1 urbe urbe 273K Apr 10 11:40 markUniqueUnique<br>-rwxrwxr-x 1 urbe urbe 114K Apr 10 11:40 mercy<br>-rwxrwxr-x 1 urbe urbe 3,8K Apr 10 11:41 mergeqc.pl<br>-rwxrwxr-x 1 urbe urbe 422K Apr 10 11:40 merTrim<br>-rwxrwxr-x 1 urbe urbe 125K Apr 10 11:40 merTrimApply<br>-rwxrwxr-x 1 urbe urbe 376K Apr 10 11:40 meryl<br>-rwxrwxr-x 1 urbe urbe 176K Apr 10 11:41 metagenomics_ovl_analyses<br>-rwxrwxr-x 1 urbe urbe 297K Apr 10 11:41 olap-from-seeds<br>-rwxrwxr-x 1 urbe urbe 275K Apr 10 11:41 outputLayout<br>-rwxrwxr-x 1 urbe urbe 229K Apr 10 11:41 overlapInCore<br>-rwxrwxr-x 1 urbe urbe 144K Apr 10 11:40 overlap_partition<br>-rwxrwxr-x 1 urbe urbe 179K Apr 10 11:41 overlapStats<br>-rwxrwxr-x 1 urbe urbe 179K Apr 10 11:41 overlapStore<br>-rwxrwxr-x 1 urbe urbe 153K Apr 10 11:41 overlapStoreBucketizer<br>-rwxrwxr-x 1 urbe urbe 175K Apr 10 11:41 overlapStoreBuild<br>-rwxrwxr-x 1 urbe urbe&nbsp; 33K Apr 10 11:41 overlapStoreIndexer<br>-rwxrwxr-x 1 urbe urbe&nbsp; 48K Apr 10 11:41 overlapStoreSorter<br>-rwxrwxr-x 1 urbe urbe 604K Apr 10 11:40 overmerry<br>lrwxrwxrwx 1 urbe urbe&nbsp;&nbsp;&nbsp; 4 Apr 10 11:41 pacBioToCA -&gt; PBcR<br>-rwxrwxr-x 1 urbe urbe 131K Apr 10 11:41 PBcR<br>-rwxrwxr-x 1 urbe urbe 2,9M Apr 10 11:41 pbdagcon<br>-rwxrwxr-x 1 urbe urbe 1,9M Apr 10 11:41 pbutgcns<br>-rwxrwxr-x 1 urbe urbe 201K Apr 10 11:40 remove_fragment<br>-rwxrwxr-x 1 urbe urbe 153K Apr 10 11:40 removeMateOverlap<br>-rwxrwxr-x 1 urbe urbe 2,5K Apr 10 11:41 replaceUIDwithName-fastq<br>-rwxrwxr-x 1 urbe urbe 1,2K Apr 10 11:41 replaceUIDwithName-posmap<br>-rwxrwxr-x 1 urbe urbe 1,3M Apr 10 11:41 resolveSurrogates<br>-rwxrwxr-x 1 urbe urbe 139K Apr 10 11:41 rewriteCache<br>-rwxrwxr-x 1 urbe urbe 232K Apr 10 11:41 runCA<br>-rwxrwxr-x 1 urbe urbe&nbsp; 88K Apr 10 11:41 runCA-dedupe<br>-rwxrwxr-x 1 urbe urbe&nbsp; 14K Apr 10 11:41 runCA-overlapStoreBuild<br>-rwxrwxr-x 1 urbe urbe 3,6K Apr 10 11:41 run_greedy.csh<br>-rwxrwxr-x 1 urbe urbe 297K Apr 10 11:40 sffToCA<br>-rwxrwxr-x 1 urbe urbe&nbsp; 13K Apr 10 11:40 show-corrects<br>-rwxrwxr-x 1 urbe urbe 557K Apr 10 11:41 splitUnitigs<br>-rwxrwxr-x 1 urbe urbe 1,4M Apr 10 11:41 terminator<br>drwxrwxr-x 2 urbe urbe 4,0K Apr 10 11:41 TIGR<br>-rwxrwxr-x 1 urbe urbe 526K Apr 10 11:41 tigStore<br>-rwxrwxr-x 1 urbe urbe&nbsp; 35K Apr 10 11:41 tracearchiveToCA<br>-rwxrwxr-x 1 urbe urbe&nbsp; 35K Apr 10 11:41 tracedb-to-frg.pl<br>-rwxrwxr-x 1 urbe urbe&nbsp; 44K Apr 10 11:41 trimFastqByQVWindow<br>-rwxrwxr-x 1 urbe urbe&nbsp; 18K Apr 10 11:40 uidclient<br>-rwxrwxr-x 1 urbe urbe 589K Apr 10 11:41 unitigger<br>-rwxrwxr-x 1 urbe urbe&nbsp; 42K Apr 10 11:40 upgrade-v8-to-v9<br>-rwxrwxr-x 1 urbe urbe&nbsp; 42K Apr 10 11:40 upgrade-v9-to-v10<br>-rwxrwxr-x 1 urbe urbe&nbsp; 854 Apr 10 11:41 utg2fasta<br>-rwxrwxr-x 1 urbe urbe 731K Apr 10 11:41 utgcns<br>-rwxrwxr-x 1 urbe urbe 561K Apr 10 11:41 utgcnsfix<br><br><br></p><p>Address of the bookmark: <a href="http://wgs-assembler.sourceforge.net/wiki/index.php/Main_Page" rel="nofollow">http://wgs-assembler.sourceforge.net/wiki/index.php/Main_Page</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/researchlabs/view/867/bc-cancer-agency-genome-sciences-centre</guid>
  <pubDate>Sun, 14 Jul 2013 13:21:27 -0500</pubDate>
  <link></link>
  <title><![CDATA[BC Cancer Agency Genome Sciences Centre]]></title>
  <description><![CDATA[
<p>Research Area</p>

<p>Genome analysis, genome visualization, mutation detection, molecular docking, comparative genomics, cancer informatics</p>

<p>Link @ http://www.bcgsc.ca</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/32184/metagenomics-assembly-workshop</guid>
	<pubDate>Tue, 18 Apr 2017 04:28:19 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/32184/metagenomics-assembly-workshop</link>
	<title><![CDATA[Metagenomics assembly workshop !!]]></title>
	<description><![CDATA[<div>
<div>
<div id="welcome-to-metagenomics-workshop">
<p>Welcome to the one-day metagenomics assembly workshop. This tutorial will guide you through the typical steps of metagenome assembly and binning.</p>
<div>
<ul>
<li><a href="http://denbi-metagenomics-workshop.readthedocs.io/en/latest/data.html">The Tutorial Data Set</a></li>
<li><a href="http://denbi-metagenomics-workshop.readthedocs.io/en/latest/qc/index.html">FastQC Quality Control</a></li>
<li><a href="http://denbi-metagenomics-workshop.readthedocs.io/en/latest/assembly/index.html">Assembly</a>
<ul>
<li><a href="http://denbi-metagenomics-workshop.readthedocs.io/en/latest/assembly/velvet.html">Velvet Assembly</a></li>
<li><a href="http://denbi-metagenomics-workshop.readthedocs.io/en/latest/assembly/megahit.html">MEGAHIT Assembly</a></li>
<li><a href="http://denbi-metagenomics-workshop.readthedocs.io/en/latest/assembly/idba_ud.html">IDBA-UD Assembly</a></li>
<li><a href="http://denbi-metagenomics-workshop.readthedocs.io/en/latest/assembly/ray.html">Ray Assembly</a></li>
</ul>
</li>
<li><a href="http://denbi-metagenomics-workshop.readthedocs.io/en/latest/geneprediction/index.html">Gene Prediction</a></li>
<li><a href="http://denbi-metagenomics-workshop.readthedocs.io/en/latest/evaluation/index.html">Assembly Evaluation</a>
<ul>
<li><a href="http://denbi-metagenomics-workshop.readthedocs.io/en/latest/evaluation/mapping.html">Read Mapping</a></li>
<li><a href="http://denbi-metagenomics-workshop.readthedocs.io/en/latest/evaluation/metaquast.html">MetaQUAST</a></li>
</ul>
</li>
<li><a href="http://denbi-metagenomics-workshop.readthedocs.io/en/latest/binning/index.html">Binning</a>
<ul>
<li><a href="http://denbi-metagenomics-workshop.readthedocs.io/en/latest/binning/maxbin.html">MaxBin Binning</a></li>
<li><a href="http://denbi-metagenomics-workshop.readthedocs.io/en/latest/binning/metabat.html">MetaBAT Binning</a></li>
</ul>
</li>
<li><a href="http://denbi-metagenomics-workshop.readthedocs.io/en/latest/classification/index.html">Classification</a>
<ul>
<li><a href="http://denbi-metagenomics-workshop.readthedocs.io/en/latest/classification/kraken.html">Kraken Taxonomic Sequence Classification System</a></li>
</ul>
</li>
</ul>
</div>
</div>
</div>
</div>
<div><a href="http://denbi-metagenomics-workshop.readthedocs.io/en/latest/data.html" title="The Tutorial Data Set">Next&nbsp;<span></span></a>
<p>&nbsp;</p>
</div><p>Address of the bookmark: <a href="http://denbi-metagenomics-workshop.readthedocs.io/en/latest/index.html" rel="nofollow">http://denbi-metagenomics-workshop.readthedocs.io/en/latest/index.html</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

</channel>
</rss>