The only input requierement for UPhO is a tree (or trees) in Newick format in which the leaves are named with a species idenfifier, a field separator, and sequence identifier. By default, the field separator is the character "|" but custom delimiters can be defined. Examples of trees to test UPhO are provided in the TestData folder.

Address of the bookmark: https://github.com/ballesterus/UPhO

SyRI, a pairwise whole-genome comparison tool for chromosome-level assemblies. SyRI starts by finding rearranged regions and then searches for differences in the sequences, which are distinguished for residing in syntenic or rearranged regions. This distinction is important as rearranged regions are inherited differently compared to syntenic regions.

https://genomebiology.biomedcentral.com/articles/10.1186/s13059-019-1911-0

Address of the bookmark: https://github.com/schneebergerlab/syri

Address of the bookmark: https://academic.oup.com/bioinformatics/article/39/12/btad719/7460198?login=false

dna2bit is a software tool developed in C++11, leveraging the capabilities of OpenMP for parallel computing and the popcount technique for efficient bit manipulation. 

Address of the bookmark: https://github.com/lijuzeng/dna2bit

Here is a list of what is changing:

1. All databases at the root level will be dbV5.
2. The dbV5 file naming,  “_v5” will be removed. Databases with  no “_vX” descriptor will be dbV5.
3. dbV4 tarballs will be renamed with "_v4", files included in tarball will not be renamed.
4. dbV4 databases will be moved to a v4 subdirectory.
5. As of 1/13/20 the Cloud directory will be frozen with no more new entries.
6. The will be no more updates to dbV4 databases.
7. The FASTA directory will contain nr, nt, swissprot, and pdbaa files.

If you have any questions or concerns, please contact blast-help@ncbi.nlm.nih.gov

We describe a new method for predicting the ancestral order and orientation of those intervals from their observed adjacencies in modern species. We combine the results from this method with data from chromosome painting experiments to produce a map of an early mammalian genome that accounts for 96.8% of the available human genome sequence data. The precision is further increased by mapping inversions as small as 31 bp. Analysis of the predicted evolutionary breakpoints in the human lineage confirms certain published observations but disagrees with others. Although only a few mammalian genomes are currently sequenced to high precision, our theoretical analyses and computer simulations indicate that our results are reasonably accurate and that they will become highly accurate in the foreseeable future. Our methods were developed as part of a project to reconstruct the genome sequence of the last ancestor of human, dogs, and most other placental mammals;

Address of the bookmark: http://www.bx.psu.edu/miller_lab/car/

Address of the bookmark: http://www.littlest.co.uk/software/bioinf/old_packages/miropeats/

Results from computer simulations show that it is energetically less expensive to bend mismatch-containing, defective DNA (G:T, C:C, C:T, G:A, G:G, T:T, A:A, A+:C) vs. non-defective DNA (containing A:T or G:C base pairs). DNA repair mechanisms likely take advantage of this feature to detect defective DNA based on an increased bending propensity.

http://www.tacc.utexas.edu/news/feature-stories/2013/how-dna-repair-helps-prevent-cancer

http://pubs.acs.org/doi/abs/10.1021/jp403127a

More at http://pandeylab.igm.jhmi.edu/

http://scholar.google.com/citations?user=OhuG0FcAAAAJ&hl=en

Job Description: We are interested in finding an excellent postdoc with interests in protein functional annotation, machine learning and computer grids. The position is open for 3.5 years at the Université Pierre et Marie Curie, in the heart of paris.

Research topic: Protein function annotation, multiple probabilistic models, domain architecture, machine learning, combinatorial optimization, computer grid.

Title: A novel integrative platform for large scale protein annotation that exploits a multitude of diversified probabilistic models in several protein signature databases.

We propose a novel integrated approach for large scale protein annotation that will exploit an unprecedented amount of genomic data as well as sophisticated machine learning techniques and combinatorial optimization approaches taking advantages of High Performance Computing (HPC) environments. The idea is to uncover as much as possible the evolutionary processes of protein sequences that took place throughout the whole tree of life and that affected the evolution of a protein family. We have already demonstrated in a previous work that the problem of functional annotation is inherent to the ability of uncovering such paths. Now, we shall extend this approach to large scale genome annotation by considering 11 different protein databases, constituted by about 10^9 protein sequences, and by producing a large pool of diversified probabilistic models coding for about 10^7 evolutionary protein pathways. Such models will be used to search for specific domains in genomes to be annotated. Our previous methodology needs to be fundamentally improved to deal with this large amount of biological data. In this project, we shall work on the algorithms to reduce the space of models and the search complexity, and we shall implement some important algorithmic changes towards the realization of a powerful integrated annotation tool.

Where: This project is run on the Laboratoire de Biologie Computationnelle et Quantitative UMR7238 CNRS-UPMC – Analytical Genomics team, headed by A.Carbone. It is co-advised with Pierre-Henri Wuillemin, Laboratoire d’Informatique de Paris 6 – Equipe DECISION.

Start date: September 1st, 2014
Contact Person: Alessandra Carbone
Contact: alessandra.carbone@lip6.fr