Noah Daniels

Noah Daniels


Research Focus & Metrics

Academic Career Length

21Years (2006-Present)

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

Representative Publications

View All Publications
5 February 2023 in Energies
Verified
Journal Article
Open access
PDF file
TJTim Jonas
Tim Jonas
NDNoah Daniels
Noah Daniels
GMGretchen A Macht
Gretchen A Macht
For a user-centered deployment of electric vehicle supply equipment (EVSE) infrastructure, it is vital to understand electric vehicle user charging behavior. This study identifies user behavioral patterns by analyzing data from more than 7000 charging stations in Canada, comparing residential vs. public Level 2, and public direct current fast (DCFC) vs. public Level 2 charging. A novel algorithm, CHAODA, was applied to identify differences between DCFC and other Level 2 charging options. Through a multivariate and holistic methodology, various patterns emerge, identifying differences in the utilization and seasonality of different EVSE types. The study provides evidence of an “EV Duck Curve” that amplifies the baseline of the power production “Duck Curve,” confirming future challenges for grid stability. Implementations of this study can support future EVSE infrastructure planning efforts and help improve the overall service of electric vehicle supply equipment and grid stability.

1 August 2015 in Cell Systems
Verified
Journal Article
Open access
PDF file
YYY. William Yu
Y. William Yu
NDNoah Daniels
Noah Daniels
DDDavid Christian Danko
David Christian Danko
BBBonnie Berger
Bonnie Berger
• We describe entropy-scaling search for finding approximate matches in a database • Search complexity is bounded in time and space by the entropy of the database • We make tools that enable search of three largely intractable real-world databases • The tools dramatically accelerate metagenomic, chemical, and protein structure search

22 July 2016 in Communications of the ACM
Verified
Journal Article
Open access
BBBonnie Berger
Bonnie Berger
NDNoah Daniels
Noah Daniels
YYY. William Yu
Y. William Yu
Algorithmic advances take advantage of the structure of massive biological data landscape.

19 June 2013 in Bioinformatics
Verified
Journal Article
Open access
PDF file
NDNoah Daniels
Noah Daniels
AGAndrew Gallant
Andrew Gallant
JPJian Peng
Jian Peng
LCLenore J. Cowen
Lenore J. Cowen
MBMichael Baym
Michael Baym
BBBonnie Berger
Bonnie Berger
Motivation: The exponential growth of protein sequence databases has increasingly made the fundamental question of searching for homologs a computational bottleneck. The amount of unique data, however, is not growing nearly as fast; we can exploit this fact to greatly accelerate homology search. Acceleration of programs in the popular PSI/DELTA-BLAST family of tools will not only speed-up homology search directly but also the huge collection of other current programs that primarily interact with large protein databases via precisely these tools. Results: We introduce a suite of homology search tools, powered by compressively accelerated protein BLAST (CaBLASTP), which are significantly faster than and comparably accurate with all known state-of-the-art tools, including HHblits, DELTA-BLAST and PSI-BLAST. Further, our tools are implemented in a manner that allows direct substitution into existing analysis pipelines. The key idea is that we introduce a local similarity-based compression scheme that allows us to operate directly on the compressed data. Importantly, CaBLASTP’s runtime scales almost linearly in the amount of unique data, as opposed to current BLASTP variants, which scale linearly in the size of the full protein database being searched. Our compressive algorithms will speed-up many tasks, such as protein structure prediction and orthology mapping, which rely heavily on homology search. Availability: CaBLASTP is available under the GNU Public License at http://cablastp.csail.mit.edu/ Contact:bab@mit.edu

28 April 2009 in PLOS ONE
Verified
Journal Article
Open access
PDF file
ABArthur Brady
Arthur Brady
KMKyle Maxwell
Kyle Maxwell
NDNoah Daniels
Noah Daniels
LCLenore J. Cowen
Lenore J. Cowen
As increasing amounts of high-throughput data for the yeast interactome become available, more system-wide properties are uncovered. One interesting question concerns the fault tolerance of protein interaction networks: whether there exist alternative pathways that can perform some required function if a gene essential to the main mechanism is defective, absent or suppressed. A signature pattern for redundant pathways is the BPM (between-pathway model) motif, introduced by Kelley and Ideker. Past methods proposed to search the yeast interactome for BPM motifs have had several important limitations. First, they have been driven heuristically by local greedy searches, which can lead to the inclusion of extra genes that may not belong in the motif; second, they have been validated solely by functional coherence of the putative pathways using GO enrichment, making it difficult to evaluate putative BPMs in the absence of already known biological annotation. We introduce stable bipartite subgraphs, and show they form a clean and efficient way of generating meaningful BPMs which naturally discard extra genes included by local greedy methods. We show by GO enrichment measures that our BPM set outperforms previous work, covering more known complexes and functional pathways. Perhaps most importantly, since our BPMs are initially generated by examining the genetic-interaction network only, the location of edges in the protein-protein physical interaction network can then be used to statistically validate each candidate BPM, even with sparse GO annotation (or none at all). We uncover some interesting biological examples of previously unknown putative redundant pathways in such areas as vesicle-mediated transport and DNA repair.

9 March 2012 in Bioinformatics
Verified
Journal Article
Open access
PDF file
NDNoah Daniels
Noah Daniels
RHRaghavendra Hosur
Raghavendra Hosur
BBBonnie Berger
Bonnie Berger
LCLenore J. Cowen
Lenore J. Cowen
Motivation: One of the most successful methods to date for recognizing protein sequences that are evolutionarily related has been profile hidden Markov models (HMMs). However, these models do not capture pairwise statistical preferences of residues that are hydrogen bonded in beta sheets. These dependencies have been partially captured in the HMM setting by simulated evolution in the training phase and can be fully captured by Markov random fields (MRFs). However, the MRFs can be computationally prohibitive when beta strands are interleaved in complex topologies. We introduce SMURFLite, a method that combines both simplified MRFs and simulated evolution to substantially improve remote homology detection for beta structures. Unlike previous MRF-based methods, SMURFLite is computationally feasible on any beta-structural motif. Results: We test SMURFLite on all propeller and barrel folds in the mainly-beta class of the SCOP hierarchy in stringent cross-validation experiments. We show a mean 26% (median 16%) improvement in area under curve (AUC) for beta-structural motif recognition as compared with HMMER (a well-known HMM method) and a mean 33% (median 19%) improvement as compared with RAPTOR (a well-known threading method) and even a mean 18% (median 10%) improvement in AUC over HHPred (a profile–profile HMM method), despite HHpred's use of extensive additional training data. We demonstrate SMURFLite's ability to scale to whole genomes by running a SMURFLite library of 207 beta-structural SCOP superfamilies against the entire genome of Thermotoga maritima, and make over a 100 new fold predictions. Availability and implementaion: A webserver that runs SMURFLite is available at: http://smurf.cs.tufts.edu/smurflite/ Contact: lenore.cowen@tufts.edu; bab@mit.edu