Rachel Kolodny

Dr. Rachel Kolodny

Department of Computer Science, Haifa University, Haifa, 3498838, Israel
orcid

Research Focus & Metrics

Academic Career Length

20Years (2007-Present)

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

Representative Publications

View All Publications
14 November 2007 in Proteins: Structure, Function, and Bioinformatics
Verified
Journal Article
Open access
PDF file
MKMickey Kosloff
Mickey Kosloff
Rachel KolodnyRachel Kolodny
Rachel Kolodny
It is often assumed that in the Protein Data Bank (PDB), two proteins with similar sequences will also have similar structures. Accordingly, it has proved useful to develop subsets of the PDB from which “redundant” structures have been removed, based on a sequence‐based criterion for similarity. Similarly, when predicting protein structure using homology modeling, if a template structure for modeling a target sequence is selected by sequence alone, this implicitly assumes that all sequence‐similar templates are equivalent. Here, we show that this assumption is often not correct and that standard approaches to create subsets of the PDB can lead to the loss of structurally and functionally important information. We have carried out sequence‐based structural superpositions and geometry‐based structural alignments of a large number of protein pairs to determine the extent to which sequence similarity ensures structural similarity. We find many examples where two proteins that are similar in sequence have structures that differ significantly from one another. The source of the structural differences usually has a functional basis. The number of such proteins pairs that are identified and the magnitude of the dissimilarity depend on the approach that is used to calculate the differences; in particular sequence‐based structure superpositioning will identify a larger number of structurally dissimilar pairs than geometry‐based structural alignments. When two sequences can be aligned in a statistically meaningful way, sequence‐based structural superpositioning provides a meaningful measure of structural differences. This approach and geometry‐based structure alignments reveal somewhat different information and one or the other might be preferable in a given application. Our results suggest that in some cases, notably homology modeling, the common use of nonredundant datasets, culled from the PDB based on sequence, may mask important structural and functional information. We have established a data base of sequence‐similar, structurally dissimilar protein pairs that will help address this problem (http://luna.bioc.columbia.edu/rachel/seqsimstrdiff.htm). Proteins 2008.

3 February 2010 in Proceedings of the National Academy of Sciences
Verified
Journal Article
Closed access
IBInbal Budowski-Tal
Inbal Budowski-Tal
YNYuval Nov
Yuval Nov
Rachel KolodnyRachel Kolodny
Rachel Kolodny
Fast identification of protein structures that are similar to a specified query structure in the entire Protein Data Bank (PDB) is fundamental in structure and function prediction. We present FragBag: An ultrafast and accurate method for comparing protein structures. We describe a protein structure by the collection of its overlapping short contiguous backbone segments, and discretize this set using a library of fragments. Then, we succinctly represent the protein as a “bags-of-fragments”—a vector that counts the number of occurrences of each fragment—and measure the similarity between two structures by the similarity between their vectors. Our representation has two additional benefits: (i) it can be used to construct an inverted index, for implementing a fast structural search engine of the entire PDB, and (ii) one can specify a structure as a collection of substructures, without combining them into a single structure; this is valuable for structure prediction, when there are reliable predictions only of parts of the protein. We use receiver operating characteristic curve analysis to quantify the success of FragBag in identifying neighbor candidate sets in a dataset of over 2,900 structures. The gold standard is the set of neighbors found by six state of the art structural aligners. Our best FragBag library finds more accurate candidate sets than the three other filter methods: The SGM, PRIDE, and a method by Zotenko et al. More interestingly, FragBag performs on a par with the computationally expensive, yet highly trusted structural aligners STRUCTAL and CE.

9 December 2020 in eLife
Verified
Journal Article
Open access
LLLiam Longo
Liam Longo
Jagoda JablonskaJagoda Jablonska
Jagoda Jablonska
PVPratik Vyas
Pratik Vyas
MKManil Kanade
Manil Kanade
Rachel KolodnyRachel Kolodny
Rachel Kolodny
DTDan S Tawfik
Dan S Tawfik
This article is dedicated to the memory of Michael G. Rossmann. Dating back to the last universal common ancestor, P-loop NTPases and Rossmanns comprise the most ubiquitous and diverse enzyme lineages. Despite similarities in their overall architecture and phosphate binding motif, a lack of sequence identity and some fundamental structural differences currently designates them as independent emergences. We systematically searched for structure and sequence elements shared by both lineages. We detected homologous segments that span the first βαβ motif of both lineages, including the phosphate binding loop and a conserved aspartate at the tip of β2. The latter ligates the catalytic metal in P-loop NTPases, while in Rossmanns it binds the nucleotide’s ribose moiety. Tubulin, a Rossmann GTPase, demonstrates the potential of the β2-Asp to take either one of these two roles. While convergence cannot be completely ruled out, we show that both lineages likely emerged from a common βαβ segment that comprises the core of these enzyme families to this very day.

19 October 2017 in Proceedings of the National Academy of Sciences
Verified
Journal Article
Open access
PDF file
SNSergey Nepomnyachiy
Sergey Nepomnyachiy
NBNir Ben-Tal
Nir Ben-Tal
Rachel KolodnyRachel Kolodny
Rachel Kolodny
Significance: We question a central paradigm: namely, that the protein domain is the “atomic unit” of evolution. In conflict with the current textbook view, our results unequivocally show that duplication of protein segments happens both above and below the domain level among amino acid segments of diverse lengths. Indeed, we show that significant evolutionary information is lost when the protein is approached as a string of domains. Our finer-grained approach reveals a far more complicated picture, where reused segments often intertwine and overlap with each other. Our results are consistent with a recursive model of evolution, in which segments of various lengths, typically smaller than domains, “hop” between environments. The fit segments remain, leaving traces that can still be detected.

6 May 2013 in Annual Review of Biophysics
Verified
Journal Article
Closed access
Rachel KolodnyRachel Kolodny
Rachel Kolodny
LPLeonid Pereyaslavets
Leonid Pereyaslavets
ASAbraham O. Samson
Abraham O. Samson
MLMichael Levitt
Michael Levitt
In the fifty years since the first atomic structure of a protein was revealed, tens of thousands of additional structures have been solved. Like all objects in biology, proteins structures show common patterns that seem to define family relationships. Classification of proteins structures, which started in the 1970s with about a dozen structures, has continued with increasing enthusiasm, leading to two main fold classifications, SCOP and CATH, as well as many additional databases. Classification is complicated by deciding what constitutes a domain, the fundamental unit of structure. Also difficult is deciding when two given structures are similar. Like all of biology, fold classification is beset by exceptions to all rules. Thus, the perspectives of protein fold space that the fold classifications offer differ from each other. In spite of these ambiguities, fold classifications are useful for prediction of structure and function. Studying the characteristics of fold space can shed light on protein evolution and the physical laws that govern protein behavior.

28 July 2014 in Proceedings of the National Academy of Sciences
Verified
Journal Article
Closed access
PDF file
SNSergey Nepomnyachiy
Sergey Nepomnyachiy
NBNir Ben-Tal
Nir Ben-Tal
Rachel KolodnyRachel Kolodny
Rachel Kolodny
Significance: To globally explore protein space, we use networks to present similarities among a representative set of all known domains. In the “domain network” edges connect domains that share “motifs,” i.e., significantly sized segments of similar sequence and structure, and in the “motif network” edges connect recurring motifs that appear in the same domain. The networks offer a way to organize protein space, and examine how the organization changes upon changing the definition of “evolutionary relatedness” among domains. For example, we use them to highlight and characterize the uniqueness of a class of domains called alpha/beta, in which the alpha and beta elements alternate. The networks can also suggest evolutionary paths between domains, and be used for protein search and design.