Compressive genomics for protein databases
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. Acc...
Main Authors: | Daniels, Noah M. (Author), Gallant, Andrew (Author), Peng, Jian (Contributor), Cowen, Lenore J. (Author), Baym, Michael Hartmann (Contributor), Berger Leighton, Bonnie (Contributor) |
---|---|
Other Authors: | Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory (Contributor), Massachusetts Institute of Technology. Department of Mathematics (Contributor) |
Format: | Article |
Language: | English |
Published: |
Oxford University Press,
2016-08-26T18:03:39Z.
|
Subjects: | |
Online Access: | Get fulltext |
Similar Items
-
IsoBase: a database of functionally related proteins across PPI networks
by: Park, Daniel Kyu, et al.
Published: (2012) -
Matt: local flexibility aids protein multiple structure alignment.
by: Matthew Menke, et al.
Published: (2008-01-01) -
Formatt: Correcting protein multiple structural alignments by incorporating sequence alignment
by: Daniels Noah M, et al.
Published: (2012-10-01) -
SMURFLite: combining simplified Markov random fields with simulated evolution improves remote homology detection for beta-structural proteins into the twilight zone
by: Daniels, N. M., et al.
Published: (2017) -
Fault tolerance in protein interaction networks: stable bipartite subgraphs and redundant pathways.
by: Arthur Brady, et al.
Published: (2009-01-01)