Anuradha S. Mehta

Learn More
Let G = (V,E) be a directed planar graph on n = |V | vertices, and let s ∈ V be any fixed source vertex. We show that G can be preprocessed in O(n polylogn) time to build a data structure of O(n polylogn) size which can answer the following query in O(log n) time for any u, v ∈ V : report distance from s to v in the graph G\{u} We also address the all-pairs(More)
Glycerophospholipid flip-flop across biogenic membranes such as the endoplasmic reticulum (ER) is a fundamental feature of membrane biogenesis. Flip-flop requires the activity of specific membrane proteins called flippases. These proteins have yet to be identified in biogenic membranes and the molecular basis of their action is unknown. It is generally(More)
The C-to-U editing of apolipoprotein-B (apo-B) mRNA is catalyzed by an enzyme complex that recognizes an 11-nt mooring sequence downstream of the editing site. A minimal holoenzyme that edits apo-B mRNA in vitro has been defined. This complex contains apobec-1, the catalytic subunit, and apobec-1 complementation factor (ACF), the RNA-binding subunit that(More)
  • 1