Adriano Marques
Research Subjects
Adriano Marques has a total of 5 co-authors. Here are the top co-authors by number of shared publications:
- Igor M. Soares
Amalgam, Chicago, USA
2 shared publications Fernando Camargo
Amalgam
1 shared publication- Fernando H. F. Camargo
Amalgam, Chicago, USA
1 shared publication Oliver Crook
Oxford Protein Informatics Group, Department of Statistics, Oxford University
1 shared publication- Oliver M. Crook
Kavli Institute for Nanoscience Discovery, University of Oxford, Oxford, UK
1 shared publication
Latest Publications
- 28 April 2022
- Published by Springer Nature in Nature Computational Science
- Vol. 2 (4) , 253-264
Improving lab-of-origin prediction of genetically engineered plasmids via deep metric learning
- 28 April 2022
- Published by Springer Nature in Nature Computational Science
- Vol. 2 (4) , 253-264
Improving lab-of-origin prediction of genetically engineered plasmids via deep metric learning
- Open Access
- 1 December 2021
- Published by Springer Nature in Research Square
Deep metric learning improves lab of origin prediction of genetically engineered plasmids
Genome engineering is undergoing unprecedented development and is now becoming widely available. To ensure responsible biotechnology innovation and to reduce misuse of engineered DNA sequences, it is vital to develop tools to identify the lab-of-origin of engineered plasmids. Genetic engineering attribution (GEA), the ability to make sequence-lab associations, would supportforensic experts in this process. Here, we propose a method, based on metric learning, that ranks the most likely labs-of-origin whilstsimultaneously generating embeddings for plasmid sequences and labs. These embeddings can be used to perform various downstreamtasks, such as clustering DNA sequences and labs, as well as using them as features in machine learning models. Our approach employsa circular shift augmentation approach and is able to correctly rank the lab-of-origin90%of the time within its top 10 predictions -outperforming all current state-of-the-art approaches. We also demonstrate that we can perform few-shot-learning and obtain76%top-10 accuracy using only10%of the sequences. This means, we outperform the previous CNN approach using only one-tenth of the data. We also demonstrate that we are able to extract key signatures in plasmid sequences for particular labs, allowing for an interpretable examination of the model’s outputs.CCS Concepts: Information systems→Similarity measures; Learning to rank.
- 1 December 2021
- Published by Springer Nature in Research Square
Open AccessDeep metric learning improves lab of origin prediction of genetically engineered plasmids
Genome engineering is undergoing unprecedented development and is now becoming widely available. To ensure responsible biotechnology innovation and to reduce misuse of engineered DNA sequences, it is vital to develop tools to identify the lab-of-origin of engineered plasmids. Genetic engineering attribution (GEA), the ability to make sequence-lab associations, would supportforensic experts in this process. Here, we propose a method, based on metric learning, that ranks the most likely labs-of-origin whilstsimultaneously generating embeddings for plasmid sequences and labs. These embeddings can be used to perform various downstreamtasks, such as clustering DNA sequences and labs, as well as using them as features in machine learning models. Our approach employsa circular shift augmentation approach and is able to correctly rank the lab-of-origin90%of the time within its top 10 predictions -outperforming all current state-of-the-art approaches. We also demonstrate that we can perform few-shot-learning and obtain76%top-10 accuracy using only10%of the sequences. This means, we outperform the previous CNN approach using only one-tenth of the data. We also demonstrate that we are able to extract key signatures in plasmid sequences for particular labs, allowing for an interpretable examination of the model’s outputs.CCS Concepts: Information systems→Similarity measures; Learning to rank.