Careful encoding of graph entities allows odgi to efficiently compute and transform pangenomes with minimal overheads. odgi implements a dynamic data structure that leveraged multi-core CPUs and can be updated on the fly.

The edges and path steps are recorded as deltas between the current node id and the target node id, where the node id corresponds to the rank in the global array of nodes. Graphs built from biological data sets tend to have local partial order and, when sorted, the deltas be small. This allows them to be compressed with a variable length integer representation, resulting in a small in-memory footprint at the cost of packing and unpacking.

The RAM and computational savings are substantial. In partially ordered regions of the graph, most deltas will require only a single byte.

Address of the bookmark: https://github.com/pangenome/odgi

1. SPAdes: An assembler specifically designed for single-cell and multi-cell bacterial genomes, as well as small eukaryotic genomes.

2. ABySS: A parallelized assembler for large genomes that uses de Bruijn graphs.

3. Velvet: Another de Bruijn graph-based assembler optimized for short-read sequencing data.

4. SOAPdenovo: A de Bruijn graph-based assembler designed for short reads, widely used for assembling large and complex genomes.

5. MaSuRCA: A hybrid assembler that combines data from multiple sequencing technologies, such as Illumina and PacBio.

6. Canu: A long-read assembler optimized for PacBio and Oxford Nanopore sequencing data.

7. Flye: A long-read assembler suitable for bacterial and small eukaryotic genomes.

8. SMARTdenovo: An assembler designed for long reads, particularly suited for PacBio data.

9. SPAdes Long Read (SPAdesLR): An extension of SPAdes for long-read data, such as those from PacBio or Nanopore.

10. Minia: An assembler optimized for low memory consumption, suitable for small and medium-sized genomes.

11. Unicycler: A hybrid assembler that combines short and long reads for circular bacterial genome assembly.

12. wtdbg2: A de Bruijn graph assembler for long reads, efficient for very large genomes.

13. Shasta: A long-read assembler that uses the Overlap-Layout-Consensus approach, suitable for PacBio and Nanopore data.

14. Sparc: An assembler designed to handle noisy long reads from Nanopore sequencing.

15. CANA: An assembler for metagenomic data, particularly for complex and diverse microbial communities.

16. Ra Assembler: A metagenome assembler for long reads, designed for highly complex metagenomic samples.

Please note that the field of bioinformatics is constantly evolving, and new assembly tools may have emerged since my last update. Additionally, the performance of these tools can vary depending on the characteristics of the sequencing data and the genome being assembled. When selecting an assembly tool, consider the specific requirements of your project, the available data types, and the computational resources at your disposal. Always refer to the respective tool's documentation and publications for the most up-to-date information and recommendations.

It supports most commonly used file formats including SAM/BAM, Wiggle/BigWig, BED, GFF/GTF, VCF.

CrossMap is designed to liftover genome coordinates between assemblies. It’s not a program for aligning sequences to reference genome.

We do not recommend using CrossMap to convert genome coordinates between species.

More at http://crossmap.sourceforge.net/

Address of the bookmark: http://crossmap.sourceforge.net/

More at http://easyfig.sourceforge.net/

Address of the bookmark: http://easyfig.sourceforge.net/

Manual at http://spades.bioinf.spbau.ru/release3.7.1/manual.html

Address of the bookmark: http://bioinf.spbau.ru/spades

More at https://gatb.inria.fr/

Address of the bookmark: https://gatb.inria.fr/

GAEMR’s analysis philosophy is centered on contiguity, correctness, and completeness -- how many pieces in an assembly composed of, how well those pieces accurately represent the genome sequenced, and how much of that genome is represented by those pieces. By performing over twenty different analyses based on these principles, GAEMR gives a clear picture of the condition of a genome assembly. 

Address of the bookmark: https://www.broadinstitute.org/software/gaemr/

NAME OF THE POST : Bioinformatician (Part time 3 days in a week) (One Position only)

DURATION : One Year

NAME OF THE PROJECT : Next generation sequencing facility

EDUCATIONAL QUALIFICATIONS : At least a Masters degree in Bioinformatics and Bachelors degree in any stream of life sciences

REQUIREMENTS :

Around 5 years of experience and proven track record in next generation sequence data analysis (supported by publications in peer-reviewed journals), ability to analyze transcriptomics, Chip-seq, and small RNA –seq data.

: Should have the ability to analyze raw primary data generated by Illumina next generation sequencing platforms and create / troubleshoot custom analysis Pipelines.

Should have ability to handle all downstream secondary and tertiary data analysis using commercially available as well as open source softwares (transcriptomics, ChIP-seq, small RNA-seq)

Apart from these, the applicant should have knowledge of the following: Programming: Perl and Python. Operating system:

Linux and Windows. NGS Analysis tools: Maq, BWA, Bowtie, SAM tools, BEDTools, MACS, Galaxy, FastQC, Bismark, MEDIPS, Tophat, Cufflinks, AvadisNGS, CLC Genomics Workbench, Galaxy, BaseSpace, Trinity Statistics: Microsoft Excel and R. Database: MySQL Genome Browser: UCSC, Ensemble, IGV, IGB Motif Analysis Tools: MEME Suite, Transfac and RSAT Functional Annotation Tools: DAVID, GeneCodis, Gene Cards Networking Tools: Cytoscape

EMOLUMENTS : The incumbent will be paid a fee of Rs. 2000/- per sitting/ per day.

SCIENTIST NAME : Dr. Arnab Mukhopadhyay,

Staff Scientific V Next generation sequencing facility

SCIENTIST’S E-MAIL ID : arnab@nii.ac.in

WALK IN INTERVIEW ON : 18th September, 2015

REGISTRATION OF CANDIDATES: 10.30 AM to 11.00 AM

PLEASE NOTE- 1. CANDIDATE MAY FILL UP APPLICATION IN THE PRECRIBED FORMAT ALONG WITH NECESSARY DOCUMENTS FOR VERIFICATION. 2. APPLICATIONS CONTAINING INCOMPLETE INFORMATION SHALL NOT BE ENTERTAINED. 3. DATE OF PASSING THE EXAMINATIONS MUST BE INDICATED CLEARLY. 4. ONLY REGISTERED CANDIDATES WILL BE INTERVIEWED. 5. NO TA/DA WILL BE PAID FOR ATTENDING THE INTERVIEW PRESCRIBED FORM 1. NAME 2. FATHER’S NAME 3. MOTHER’S NAME 4. DATE OF BIRTH 5. SEX (MALE/FEMALE) 6. CATEGORY (SC/ ST/ OBC/ PH) 7. ADDRESS a. (CORRSPONDENCE) b. (PERMANENT) 8. E MAIL, TELEPHONE NO. & MOBILE No (if any) 9. ACADEMIC & PROFESSIONAL QUALIFICATIONS NAME OF EXAMINATION PASSED WITH SUBJECTS YEAR OF PASSING BOARD/ UNIVERSITY PERCENTAGE/ DIVISION REMARKS 10. PAST EXPERIENCE & PRESENT EMPLOYMENT, IF ANY 11. CANDIDATES SHOULD STATE CLEARLY WHETHER THEY HAVE BEEN AWARDED PH.D DEGREE OR THESIS HAS BEEN SUBMITTED. 12. HAVE YOU APPLIED FOR A POSITION EARLIER IN THE INSTITUTE? IF SO:- (1) THE DETAILS OF THE PROJECT AND PROJECT INVESTIGATOR (2) IF CALLED FOR INVERVIEW, RESULTS THEREOF

More at http://www1.nii.res.in/sites/default/files/walkininterview-18sept2015.pdf

Scientists with a long-running Framingham Heart Study looked at 1,932 people (examination of about 1.5 million markers of genetic variations), comparing unrelated friends to unrelated strangers. They found that friends shared about 1% of their genes — a percentage much higher than those shared with strangers.This new findings made it clear that people have more DNA in common with those who are selected as friends than with strangers in the same population. 

The genes that lined up the most were olfactory genes, which deal with smell. The ones that lined up the least were immune system genes. The researchers weren't sure why that happened :/. Olfactory genes might be a straightforward explanation: People who like the same smells tend to be drawn to similar environments, where they meet others with the same tendencies.

Reference:

http://www.pnas.org/content/111/Supplement_3/10796.full

Image : http://i.kinja-img.com

More at http://hgdownload.cse.ucsc.edu/admin/exe/

Address of the bookmark: http://hgdownload.cse.ucsc.edu/admin/exe/