<![CDATA[BOL: Related items]]> https://bioinformaticsonline.com/related/31345?offset=1160 https://bioinformaticsonline.com/bookmarks/view/32131/wgs-celera-assembler-version-83rc2 Mon, 10 Apr 2017 04:45:40 -0500 https://bioinformaticsonline.com/bookmarks/view/32131/wgs-celera-assembler-version-83rc2 <![CDATA[WGS Celera Assembler version 8.3rc2]]> These are release notes for Celera Assembler version 8.3rc2, which was released on May 24, 2015.

This distribution package provides a stable, tested, documented version of the software.  The distribution is usable on most Unix-like platforms, and some platforms have pre-compiled binary distributions ready for installation.

The source code package includes full source code (revision 4627), Makefiles, and scripts.  A subset of the kmer package (http://kmer.sourceforge.net/, version r1994), used by some modules of Celera Assembler, is included.  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].

Full documentation can be found online at http://wgs-assembler.sourceforge.net/.

Interesting scripts within it

urbe@urbo214b[bin] ls                                                        []
-rwxrwxr-x 1 urbe urbe  11K Apr 10 11:41 addCNSToStore
-rwxrwxr-x 1 urbe urbe 575K Apr 10 11:41 addReadsToUnitigs
-rwxrwxr-x 1 urbe urbe 128K Apr 10 11:41 analyzeBest
-rwxrwxr-x 1 urbe urbe 257K Apr 10 11:41 analyzePosMap
-rwxrwxr-x 1 urbe urbe 1,5M Apr 10 11:41 analyzeScaffolds
-rwxrwxr-x 1 urbe urbe 224K Apr 10 11:41 asmOutputFasta
-rwxrwxr-x 1 urbe urbe 448K Apr 10 11:41 asmOutputStatistics
-rwxrwxr-x 1 urbe urbe 2,4K Apr 10 11:41 asmToAGP.pl
-rwxrwxr-x 1 urbe urbe 7,6M Apr 10 11:41 blasr
-rwxrwxr-x 1 urbe urbe 1,6M Apr 10 11:41 bogart
-rwxrwxr-x 1 urbe urbe 183K Apr 10 11:41 bogus
-rwxrwxr-x 1 urbe urbe 272K Apr 10 11:41 bogusness
-rwxrwxr-x 1 urbe urbe 247K Apr 10 11:41 buildPosMap
-rwxrwxr-x 1 urbe urbe 213K Apr 10 11:41 buildRefContigs
-rwxrwxr-x 1 urbe urbe 990K Apr 10 11:41 buildUnitigs
-rwxrwxr-x 1 urbe urbe  18K Apr 10 11:41 ca2ace.pl
-rwxrwxr-x 1 urbe urbe  12K Apr 10 11:41 caqc_help.ini
-rwxrwxr-x 1 urbe urbe  61K Apr 10 11:41 caqc.pl
-rwxrwxr-x 1 urbe urbe  23K Apr 10 11:41 cat-corrects
-rwxrwxr-x 1 urbe urbe  24K Apr 10 11:41 cat-erates
-rwxrwxr-x 1 urbe urbe 1,9M Apr 10 11:41 cgw
-rwxrwxr-x 1 urbe urbe 1,4M Apr 10 11:41 cgwDump
-rwxrwxr-x 1 urbe urbe 204K Apr 10 11:41 chimChe
-rwxrwxr-x 1 urbe urbe 201K Apr 10 11:40 chimera
-rwxrwxr-x 1 urbe urbe 220K Apr 10 11:41 classifyMates
-rwxrwxr-x 1 urbe urbe 201K Apr 10 11:41 classifyMatesApply
-rwxrwxr-x 1 urbe urbe 215K Apr 10 11:41 classifyMatesPairwise
-rwxrwxr-x 1 urbe urbe 366K Apr 10 11:41 computeCoverageStat
-rwxrwxr-x 1 urbe urbe 9,8K Apr 10 11:41 convert-fasta-to-v2.pl
-rwxrwxr-x 1 urbe urbe  48K Apr 10 11:41 convertOverlap
-rwxrwxr-x 1 urbe urbe 119K Apr 10 11:41 convertSamToCA
-rwxrwxr-x 1 urbe urbe  20K Apr 10 11:41 convertToPBCNS
-rwxrwxr-x 1 urbe urbe 197K Apr 10 11:41 correct-frags
-rwxrwxr-x 1 urbe urbe 259K Apr 10 11:41 correct-olaps
-rwxrwxr-x 1 urbe urbe 520K Apr 10 11:41 correctPacBio
-rwxrwxr-x 1 urbe urbe 540K Apr 10 11:41 ctgcns
-rwxrwxr-x 1 urbe urbe 162K Apr 10 11:40 deduplicate
-rwxrwxr-x 1 urbe urbe  37K Apr 10 11:41 demotePosMap
-rwxrwxr-x 1 urbe urbe 1,5M Apr 10 11:41 dumpCloneMiddles
-rwxrwxr-x 1 urbe urbe 124K Apr 10 11:41 dumpPBRLayoutStore
-rwxrwxr-x 1 urbe urbe 1,3M Apr 10 11:41 dumpSingletons
-rwxrwxr-x 1 urbe urbe 171K Apr 10 11:41 erate-estimate
-rwxrwxr-x 1 urbe urbe 221K Apr 10 11:40 estimate-mer-threshold
-rwxrwxr-x 1 urbe urbe 1,5M Apr 10 11:41 extendClearRanges
-rwxrwxr-x 1 urbe urbe 1,3M Apr 10 11:41 extendClearRangesPartition
-rwxrwxr-x 1 urbe urbe 205K Apr 10 11:40 extractmessages
-rwxrwxr-x 1 urbe urbe 7,2M Apr 10 11:41 falcon_sense
-rwxrwxr-x 1 urbe urbe 9,8K Apr 10 11:41 fastaToCA
-rwxrwxr-x 1 urbe urbe 124K Apr 10 11:40 fastqAnalyze
-rwxrwxr-x 1 urbe urbe 137K Apr 10 11:40 fastqSample
-rwxrwxr-x 1 urbe urbe  62K Apr 10 11:40 fastqSimulate
-rwxrwxr-x 1 urbe urbe 121K Apr 10 11:40 fastqSimulate-sort
-rwxrwxr-x 1 urbe urbe 246K Apr 10 11:40 fastqToCA
-rwxrwxr-x 1 urbe urbe 140K Apr 10 11:41 filterOverlap
-rwxrwxr-x 1 urbe urbe 341K Apr 10 11:40 finalTrim
-rwxrwxr-x 1 urbe urbe 228K Apr 10 11:41 fixUnitigs
-rwxrwxr-x 1 urbe urbe 147K Apr 10 11:40 fragmentDepth
-rwxrwxr-x 1 urbe urbe  29K Apr 10 11:41 fragsInVars
-rwxrwxr-x 1 urbe urbe 545K Apr 10 11:41 frgs2clones
-rwxrwxr-x 1 urbe urbe 398K Apr 10 11:40 gatekeeper
-rwxrwxr-x 1 urbe urbe 139K Apr 10 11:40 gatekeeperbench
-rwxrwxr-x 1 urbe urbe 167K Apr 10 11:40 gkpStoreCreate
-rwxrwxr-x 1 urbe urbe 147K Apr 10 11:40 gkpStoreDumpFASTQ
-rwxrwxr-x 1 urbe urbe 184K Apr 10 11:41 greedyFragmentTiling
-rwxrwxr-x 1 urbe urbe 1,6K Apr 10 11:41 greedy_layout_to_IUM
-rwxrwxr-x 1 urbe urbe 142K Apr 10 11:40 initialTrim
-rwxrwxr-x 1 urbe urbe 967K Apr 10 11:41 jellyfish
-rwxrwxr-x 1 urbe urbe 219K Apr 10 11:41 markRepeatUnique
-rwxrwxr-x 1 urbe urbe 273K Apr 10 11:40 markUniqueUnique
-rwxrwxr-x 1 urbe urbe 114K Apr 10 11:40 mercy
-rwxrwxr-x 1 urbe urbe 3,8K Apr 10 11:41 mergeqc.pl
-rwxrwxr-x 1 urbe urbe 422K Apr 10 11:40 merTrim
-rwxrwxr-x 1 urbe urbe 125K Apr 10 11:40 merTrimApply
-rwxrwxr-x 1 urbe urbe 376K Apr 10 11:40 meryl
-rwxrwxr-x 1 urbe urbe 176K Apr 10 11:41 metagenomics_ovl_analyses
-rwxrwxr-x 1 urbe urbe 297K Apr 10 11:41 olap-from-seeds
-rwxrwxr-x 1 urbe urbe 275K Apr 10 11:41 outputLayout
-rwxrwxr-x 1 urbe urbe 229K Apr 10 11:41 overlapInCore
-rwxrwxr-x 1 urbe urbe 144K Apr 10 11:40 overlap_partition
-rwxrwxr-x 1 urbe urbe 179K Apr 10 11:41 overlapStats
-rwxrwxr-x 1 urbe urbe 179K Apr 10 11:41 overlapStore
-rwxrwxr-x 1 urbe urbe 153K Apr 10 11:41 overlapStoreBucketizer
-rwxrwxr-x 1 urbe urbe 175K Apr 10 11:41 overlapStoreBuild
-rwxrwxr-x 1 urbe urbe  33K Apr 10 11:41 overlapStoreIndexer
-rwxrwxr-x 1 urbe urbe  48K Apr 10 11:41 overlapStoreSorter
-rwxrwxr-x 1 urbe urbe 604K Apr 10 11:40 overmerry
lrwxrwxrwx 1 urbe urbe    4 Apr 10 11:41 pacBioToCA -> PBcR
-rwxrwxr-x 1 urbe urbe 131K Apr 10 11:41 PBcR
-rwxrwxr-x 1 urbe urbe 2,9M Apr 10 11:41 pbdagcon
-rwxrwxr-x 1 urbe urbe 1,9M Apr 10 11:41 pbutgcns
-rwxrwxr-x 1 urbe urbe 201K Apr 10 11:40 remove_fragment
-rwxrwxr-x 1 urbe urbe 153K Apr 10 11:40 removeMateOverlap
-rwxrwxr-x 1 urbe urbe 2,5K Apr 10 11:41 replaceUIDwithName-fastq
-rwxrwxr-x 1 urbe urbe 1,2K Apr 10 11:41 replaceUIDwithName-posmap
-rwxrwxr-x 1 urbe urbe 1,3M Apr 10 11:41 resolveSurrogates
-rwxrwxr-x 1 urbe urbe 139K Apr 10 11:41 rewriteCache
-rwxrwxr-x 1 urbe urbe 232K Apr 10 11:41 runCA
-rwxrwxr-x 1 urbe urbe  88K Apr 10 11:41 runCA-dedupe
-rwxrwxr-x 1 urbe urbe  14K Apr 10 11:41 runCA-overlapStoreBuild
-rwxrwxr-x 1 urbe urbe 3,6K Apr 10 11:41 run_greedy.csh
-rwxrwxr-x 1 urbe urbe 297K Apr 10 11:40 sffToCA
-rwxrwxr-x 1 urbe urbe  13K Apr 10 11:40 show-corrects
-rwxrwxr-x 1 urbe urbe 557K Apr 10 11:41 splitUnitigs
-rwxrwxr-x 1 urbe urbe 1,4M Apr 10 11:41 terminator
drwxrwxr-x 2 urbe urbe 4,0K Apr 10 11:41 TIGR
-rwxrwxr-x 1 urbe urbe 526K Apr 10 11:41 tigStore
-rwxrwxr-x 1 urbe urbe  35K Apr 10 11:41 tracearchiveToCA
-rwxrwxr-x 1 urbe urbe  35K Apr 10 11:41 tracedb-to-frg.pl
-rwxrwxr-x 1 urbe urbe  44K Apr 10 11:41 trimFastqByQVWindow
-rwxrwxr-x 1 urbe urbe  18K Apr 10 11:40 uidclient
-rwxrwxr-x 1 urbe urbe 589K Apr 10 11:41 unitigger
-rwxrwxr-x 1 urbe urbe  42K Apr 10 11:40 upgrade-v8-to-v9
-rwxrwxr-x 1 urbe urbe  42K Apr 10 11:40 upgrade-v9-to-v10
-rwxrwxr-x 1 urbe urbe  854 Apr 10 11:41 utg2fasta
-rwxrwxr-x 1 urbe urbe 731K Apr 10 11:41 utgcns
-rwxrwxr-x 1 urbe urbe 561K Apr 10 11:41 utgcnsfix


Address of the bookmark: http://wgs-assembler.sourceforge.net/wiki/index.php/Main_Page

]]> Jit https://bioinformaticsonline.com/bookmarks/view/32187/chromhmm-chromatin-state-discovery-and-characterization Wed, 19 Apr 2017 04:06:23 -0500 https://bioinformaticsonline.com/bookmarks/view/32187/chromhmm-chromatin-state-discovery-and-characterization <![CDATA[ChromHMM: Chromatin state discovery and characterization]]> ChromHMM is software for learning and characterizing chromatin states. ChromHMM can integrate multiple chromatin datasets such as ChIP-seq data of various histone modifications to discover de novo the major re-occuring combinatorial and spatial patterns of marks. ChromHMM is based on a multivariate Hidden Markov Model that explicitly models the presence or absence of each chromatin mark. The resulting model can then be used to systematically annotate a genome in one or more cell types. By automatically computing state enrichments for large-scale functional and annotation datasets ChromHMM facilitates the biological characterization of each state. ChromHMM also produces files with genome-wide maps of chromatin state annotations that can be directly visualized in a genome browser. 

Address of the bookmark: http://compbio.mit.edu/ChromHMM/

]]> Abhimanyu Singh https://bioinformaticsonline.com/bookmarks/view/38505/allhic-phasing-and-scaffolding-polyploid-genomes-based-on-hi-c-data Thu, 20 Dec 2018 12:03:32 -0600 https://bioinformaticsonline.com/bookmarks/view/38505/allhic-phasing-and-scaffolding-polyploid-genomes-based-on-hi-c-data <![CDATA[ALLHiC: Phasing and scaffolding polyploid genomes based on Hi-C data]]> The major problem of scaffolding polyploid genome is that Hi-C signals are frequently detected between allelic haplotypes and any existing stat of art Hi-C scaffolding program links the allelic haplotypes together. To solve the problem, we developed a new Hi-C scaffolding pipeline, called ALLHIC, specifically tailored to the polyploid genomes. ALLHIC pipeline contains a total of 5 steps: prune, partition, rescue, optimize and build.

Address of the bookmark: https://github.com/tangerzhang/ALLHiC/wiki

]]> BioStar https://bioinformaticsonline.com/bookmarks/view/32399/mapping-ngs Tue, 02 May 2017 07:58:07 -0500 https://bioinformaticsonline.com/bookmarks/view/32399/mapping-ngs <![CDATA[Mapping NGS]]> NGS data are just a bunch of sequences, you have no idea which region in the genome each sequences comes from, which gene it represents...
To know that you have to align the sequences to the reference sequence. The reference sequence is in most cases the full genome sequence but sometimes, a library of EST sequences is used.
In either way, aligning your sequence reads to the reference sequence is called mapping.

The most used mappers of DNA-seq data are BWA and Bowtie for DNA-Seq data and Tophat, STAR or HISAT for RNA-Seq data. Mappers differ in which options they can take in, how fast and how accurate they are. Bowtie is faster than BWA, but looses some sensitivity (does not map an equal amount of reads to the correct position in the genome).

Address of the bookmark: http://wiki.bits.vib.be/index.php/Mapping_of_NGS_data

]]> Abhimanyu Singh https://bioinformaticsonline.com/bookmarks/view/38755/svaba-genome-wide-detection-of-structural-variants-and-indels-by-local-assembly Mon, 21 Jan 2019 17:58:56 -0600 https://bioinformaticsonline.com/bookmarks/view/38755/svaba-genome-wide-detection-of-structural-variants-and-indels-by-local-assembly <![CDATA[SvABA: Genome-wide detection of structural variants and indels by local assembly]]> SvABA is a method for detecting structural variants in sequencing data using genome-wide local assembly. Under the hood, SvABA uses a custom implementation of SGA (String Graph Assembler) by Jared Simpson, and BWA-MEM by Heng Li. Contigs are assembled for every 25kb window (with some small overlap) for every region in the genome. The default is to use only clipped, discordant, unmapped and indel reads, although this can be customized to any set of reads at the command line using VariantBam rules. These contigs are then immediately aligned to the reference with BWA-MEM and parsed to identify variants. Sequencing reads are then realigned to the contigs with BWA-MEM, and variants are scored by their read support.

Address of the bookmark: https://github.com/walaj/svaba

]]> Abhimanyu Singh https://bioinformaticsonline.com/blog/view/32587/ten-international-scholarships-for-indian-biotechnology-and-bioinformatics-students Wed, 10 May 2017 04:51:02 -0500 https://bioinformaticsonline.com/blog/view/32587/ten-international-scholarships-for-indian-biotechnology-and-bioinformatics-students <![CDATA[Ten International Scholarships for Indian Biotechnology and Bioinformatics Students]]> Wherever you go around the world, Indian students are in demand. With countries such as Canada and Australia providing huge incentives to Indian students to lure them to their shores, there are many institutions around the world that offer scholarships exclusively to Indian students. Historically these scholarships tend to be aimed towards Masters and PhD programmes however on the rise are scholarships for undergraduate students. Student World Online takes a look at ten international scholarships for Indian undergraduate students abroad.


1. TATA SCHOLARSHIP - Cornell University, New York State, USA
Tata, the Indian multinational conglomerate company, have a foundation known as the Tata Education & Development Trust which has endowed a multi million dollar sum to Cornell University to provide undergraduate scholarships to 20 Indian students every year.  In another example of supporting American universities, the Tata group also pledged US$50 million to Harvard University in recent years, whose executive management programme Ratan Tata attended in the 1970s.  Read more...  

2. BRADMAN FOUNDATION SCHOLARSHIP - University of Wollongong, Australia.
Named after Australia's cricket legend Donald Bradman, the UOW Bradman Foundation Scholarship was launched in 2012, with the help of Adam Gilchrist no less, to offer one successful Indian student each year a 50% reduction in tuition fees.  Read more...  

3. HUAWEI MAITREE SCHOLARSHIPS - Various Universities, China
Along with Tata, Huawei are the other huge corporation to be featured.  China's massive telecoms equipment vendor are involved in these scholarships offered to Indian students studying in China.  In 2013 there are 10 generous scholarships available which provide full tuition fees and living expenses.  The courses on which the scholarships are offered include Science and Technology courses, Social Sciences and Culture and Development courses.  Read more...

4. DR. MANMOHAN SINGH SCHOLARSHIPS - Cambridge University, England, UK
These scholarships have been designed to help budding Indian minds follow in the footsteps of Indian prime minister Manmohan Singh by studying at the prestigious Cambridge University.  The scholarships can be applied to any undergarduate course (with the two exceptions of medicine and veterinary science) and cover everything, i.e. tuition and college fees, living expenses and an additional grant to go towards travel expenses.  Read more...

5. OXFORD AND CAMBRIDGE SOCIETY OF INDIA - Oxford & Cambridge Universities, England, UK
As the name might suggest, these are scholarships available for students wishing to study at Oxford or Cambridge (cleverly known together as Oxbridge).  It is only available for applicants who are completing or have completed a degree at an Indian university, however these scholarships are for both undergraduate and graduate students.  Read more...

6. EDINBURGH NAPIER UNIVERSITY - Scotland, UK
This one applies to all countries in the Indian subcontinent and is for both undergraduate and graduate courses. Edinburgh Napier University offers a merit based discount of £2,000 Pounds.  Read more...

7. SHEFFIELD UNIVERSITY - Sheffield, UK
Provides merit-based scholarships for undergraduate and graduate programmes across all subjects. Read more...

8. INDIA 4EU II - Several Universities across Europe
Pioneered by the European Union and involving partner universities in France, Finland, Germany, Italy, Portugal, Spain and Sweden, the India 4EU II initiative is aimed at encouraging Indian students to study, work and live in Europe.  The initiative is well funded and allows the successful students tuition fees, expenses for living and travel costs as well as insurance during their time at one of the partner universities.  Read more...

9. TRINITY COLLEGE DUBLIN - Ireland
Valid for undergraduate courses in the faculties of Arts, Humanities, Social Sciences, Science, Computer Science or Engineering, the Trinity College Dublin offers Indian students scholarships to the tune of €9,000 per annum over a year degree course.  Read more...

10. UNIVERSITY COLLEGE DUBLIN - Ireland
Another of Ireland and Dublin's finest, the UCD awards one Global Excellence Undergraduate Scholarship which provides the worthy student a substantial 50% towards their tuition fees and is valid for all courses save medicine, radiography and veterinary medicine.  UCD also offers a Global Undergraduate Scholarship scheme for undergrads accepted on science, social sciences, arts and business courses.  This is all thanks to a €250,000 fund that will allow for 57 Indian students to benefit from scholarships at UCD.  Read more...

]]> Priya Singh https://bioinformaticsonline.com/bookmarks/view/32726/ergo-20-bioinformatics-suites Tue, 16 May 2017 08:14:10 -0500 https://bioinformaticsonline.com/bookmarks/view/32726/ergo-20-bioinformatics-suites <![CDATA[ERGO 2.0 Bioinformatics suites]]> ERGO 2.0 provides a systems biology informatics toolkit centered on comparative genomics to capture, query, and visualize sequenced genomes.  Using Igenbio's proprietary algorithms, and the most comprehensive genomic database integrated with the largest collection of microbial metabolic and non-metabolic pathways, ERGO™ assigns functions to genes, integrates genes into pathways, and identifies previously unknown or mischaracterized genes, cryptic pathways, and gene products. 

Address of the bookmark: https://www.igenbio.com/ergo/

]]> Jit https://bioinformaticsonline.com/opportunity/view/33966/ra-bioinformatics-at-national-institute-of-biomedical-genomics-india Wed, 26 Jul 2017 03:49:52 -0500 <![CDATA[RA Bioinformatics at NATIONAL INSTITUTE OF BIOMEDICAL GENOMICS, INDIA]]> NATIONAL INSTITUTE OF BIOMEDICAL GENOMICS
(An Autonomous Institution of the Government of India)
P.O.: N.S.S., Kalyani 741251, West Bengal

Advertisement No. 137/ESTB/NIBMG/17-18

Position available Project Description: Several positions are available for the project titled: “A unified web-portal for analysis, integration and visualization of multi-omics data”. The goal of this project is to develop a user-accessible resource for integrated analysis and visualization of multi-OMICs data sets (including gene expression, genotype, methylation, microRNA, etc.). Data sets generated on various platforms shall be maintained in a stable database, accessed through standard querying mechanisms, and the results shall be displayed via user-friendly interface. The analysis engine shall run on open-source software (such as R/Bioconductor) developed in-house. All positions are contractual.

Appointment will be initially given for a period of one year which is extendable depending upon performance, availability of funds and requirements of the institute.

Project Code: 20275 Position: (No. of positions available)

Research Associate (3)

Position 1: Ph.D. or equivalent in statistics, computer science, mathematics, bioinformatics, or related subject.
Position 1: Those with experience in database management shall be preferred. Experience with UNIX or GNU/Linux operating system.
Position 1: Creation and maintenance of a database for population- and diseaseassociated variation resource. Development of programmatic interface for querying the database, filtering of the results and identification of genes of interest.

Rs. 36000/- + 10% HRA

Please apply online via web link http://apply.nibmg.ac.in/ (no other form of application will be accepted). The last date of application is 14-08-2017. All letters to attend screening test and /or interview will be sent only to the short-listed candidates by Email only. No correspondence will be made with applicants who are not shortlisted /not called for screening test and /or interview. No TA/DA will be paid for attending the screening test and /or interview.
Detail information at http://www.nibmg.ac.in/academic/Advt_20275.pdf

More Info: http://www.nibmg.ac.in/?q=Project%20Linked%20Personnel

]]> https://bioinformaticsonline.com/bookmarks/view/40516/nextdenovo-string-graph-based-de-novo-assembler-for-tgs-long-reads Sun, 05 Jan 2020 04:08:29 -0600 https://bioinformaticsonline.com/bookmarks/view/40516/nextdenovo-string-graph-based-de-novo-assembler-for-tgs-long-reads <![CDATA[NextDenovo: string graph-based de novo assembler for TGS long reads]]> NextDenovo is a string graph-based de novo assembler for TGS long reads. It uses a "correct-then-assemble" strategy similar to canu, but requires significantly less computing resources and storages. After assembly, the per-base error rate is about 97-98%, to further improve single base accuracy, please use NextPolish.

NextDenovo contains two core modules: NextCorrect and NextGraph. NextCorrect can be used to correct TGS long reads with approximately 15% sequencing errors, and NextGraph can be used to construct a string graph with corrected reads. It also contains a modified version of minimap2 for adapting input and output and producing more sensitive and accurate dovetail overlaps, and some useful utilities (see here for more details).

Address of the bookmark: https://github.com/Nextomics/NextDenovo

]]> Jit https://bioinformaticsonline.com/bookmarks/view/34479/bioinformatics-lectures Wed, 29 Nov 2017 05:39:54 -0600 https://bioinformaticsonline.com/bookmarks/view/34479/bioinformatics-lectures <![CDATA[Bioinformatics lectures !]]>
Computational Biology is a huge field of study, that touches upon many distinct algorithmic and biological areas of study. What we are able to cover in this course will depend, in part, on the pace at which we move, which I will attempt to adjust as appropriate. However, here is a tentative list of topics I hope to cover this semester (not necessarily in order).
  • Optimal sequence alignment (global, local, and glocal alignment &mdash with constant & affine gap penalties
  • Algorithms and data structures for efficient text indexing and exact search
  • Heuristics for read alignment and mapping &mdash mapping DNA-seq and RNA-seq reads
  • Genome assembly &mdash k-mers, De Brujin graph construction and representation, long-read technology and read-overlap graph assembly
  • Motif finding via Gibbs sampling
  • Gene finding &mdash statistical models for ab initio and evidence-guided prediction of genes
  • RNA-seq and transcriptomics &mdash transcript assembly, abundance estimation and differential expression testing
  • Phylogenetics &mdash The small and large phylogeny problem; parsimony, maximum likelihood and Bayesian methods

Address of the bookmark: https://rob-p.github.io/CSE549F16/lectures/

]]> Jit