Juan Felipe Beltrán

Juan Felipe Beltrán

Auto-generated profile, based on publicly available information

Juan Felipe Beltrán

Quantum-Si, Inc., Guilford, CT 06437, USA

Research Focus & Metrics

Academic Career Length

14Years (2013-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 January 2018 in Nature Methods
Verified
Journal Article
Closed access
PDF file
MMMichael J Meyer
Michael J Meyer
JBJuan Felipe Beltrán
Juan Felipe Beltrán
SLSiqi Liang
Siqi Liang
RFRobert Fragoza
Robert Fragoza
ARAaron Rumack
Aaron Rumack
HYHaiyuan Yu
Haiyuan Yu

3 February 2016 in Human Mutation
Verified
Journal Article
Closed access
PDF file
MMMichael J. Meyer
Michael J. Meyer
RLRyan Lapcevic
Ryan Lapcevic
ARAlfonso E. Romero
Alfonso E. Romero
MYMark Yoon
Mark Yoon
JDJishnu Das
Jishnu Das
HYHaiyuan Yu
Haiyuan Yu

14 October 2022 in Science
Verified
Journal Article
Closed access
BRBrian D Reed
Brian D Reed
MMMichael J Meyer
Michael J Meyer
VAValentin Abramzon
Valentin Abramzon
OAOmer Ad
Omer Ad
PAPat Adcock
Pat Adcock
JRJonathan M Rothberg
Jonathan M Rothberg
Studies of the proteome would benefit greatly from methods to directly sequence and digitally quantify proteins and detect posttranslational modifications with single-molecule sensitivity. Here, we demonstrate single-molecule protein sequencing using a dynamic approach in which single peptides are probed in real time by a mixture of dye-labeled N-terminal amino acid recognizers and simultaneously cleaved by aminopeptidases. We annotate amino acids and identify the peptide sequence by measuring fluorescence intensity, lifetime, and binding kinetics on an integrated semiconductor chip. Our results demonstrate the kinetic principles that allow recognizers to identify multiple amino acids in an information-rich manner that enables discrimination of single amino acid substitutions and posttranslational modifications. With further development, we anticipate that this approach will offer a sensitive, scalable, and accessible platform for single-molecule proteomic studies and applications.

22 October 2021 in Science Advances
Verified
Journal Article
Open access
HZHao Zhou
Hao Zhou
JBJuan Felipe Beltrán
Juan Felipe Beltrán
IBIlana Lauren Brito
Ilana Lauren Brito
Transfer machinery, niche-specific, and metabolic genes are predictive of gene transfer events across diverse bacterial species.

1 March 2016 in Proceedings of the VLDB Endowment
Verified
Journal Article
Open access
PDF file
MBMatteo Brucato
Matteo Brucato
JBJuan Felipe Beltran
Juan Felipe Beltran
AAAzza Abouzied
Azza Abouzied
AMAlexandra Meliou
Alexandra Meliou
Traditional database queries follow a simple model: they define constraints that each tuple in the result must satisfy. This model is computationally efficient, as the database system can evaluate the query conditions on each tuple individually. However, many practical, real-world problems require a collection of result tuples to satisfy constraints collectively, rather than individually. In this paper, we present package queries , a new query model that extends traditional database queries to handle complex constraints and preferences over answer sets. We develop a full-fledged package query system, implemented on top of a traditional database engine. Our work makes several contributions. First, we design PaQL, a SQL-based query language that supports the declarative specification of package queries. We prove that PaQL is at least as expressive as integer linear programming, and therefore, evaluation of package queries is in general NP-hard. Second, we present a fundamental evaluation strategy that combines the capabilities of databases and constraint optimization solvers to derive solutions to package queries. The core of our approach is a set of translation rules that transform a package query to an integer linear program. Third, we introduce an offline data partitioning strategy allowing query evaluation to scale to large data sizes. Fourth, we introduce S ketch R efine , a scalable algorithm for package evaluation, with strong approximation guarantees ((1 ± ε) 6 -factor approximation). Finally, we present extensive experiments over real-world and benchmark data. The results demonstrate that S ketch R efine is effective at deriving high-quality package results, and achieves runtime performance that is an order of magnitude faster than directly using ILP solvers over large datasets.

5 November 2015
Verified
Conference Paper
Open access
JBJuan Felipe Beltran
Juan Felipe Beltran
ASAysha Siddique
Aysha Siddique
AAAzza Abouzied
Azza Abouzied
JCJay Chen
Jay Chen
Crowdfunding websites like Kickstarter and Indiegogo offer project organizers the ability to market, fund, and build a community around their campaign. While offering support and flexibility for organizers, crowdfunding sites provide very little control to donors. In this paper, we investigate the idea of empowering donors by allowing them to specify conditions for their crowdfunding contributions. We introduce a crowdfunding system, Codo, that allows donors to specify conditional donations. Codo allow donors to contribute to a campaign but hold off on their contribution until certain specific conditions are met (e.g. specific members or groups contribute a certain amount). We begin with a micro study to assess several specific conditional donations based on their comprehensibility and usage likelihood. Based on this study, we formalize conditional donations into a general grammar that captures a broad set of useful conditions. We demonstrate the feasibility of resolving conditions in our grammar by elegantly transforming conditional donations into a system of linear inequalities that are efficiently resolved using off-the-shelf linear program solvers. Finally, we designed a user-friendly crowdfunding interface that supports conditional donations for an actual fund raising campaign and assess the potential of conditional donations through this campaign. We find preliminary evidence that roughly 1 in 3 donors make conditional donations and that conditional donors donate more compared to direct donors.