scispace - formally typeset
Search or ask a question
Author

Sandeep Singh

Bio: Sandeep Singh is an academic researcher from Indian Institute of Technology Roorkee. The author has contributed to research in topics: Medicine & Computer science. The author has an hindex of 52, co-authored 670 publications receiving 11566 citations. Previous affiliations of Sandeep Singh include Pukyong National University & Purdue University.


Papers
More filters
Journal ArticleDOI
04 Sep 2009-Science
TL;DR: Him Hait et al. (p. 1254) report that S1P can also function by direct binding to the nuclear enzymes, histone deacetylases (HDACs) 1 and 2, which are direct intracellular targets of S 1P and link nuclear S1p to epigenetic regulation of gene expression.
Abstract: The pleiotropic lipid mediator sphingosine-1-phosphate (S1P) can act intracellularly independently of its cell surface receptors through unknown mechanisms. Sphingosine kinase 2 (SphK2), one of the isoenzymes that generates S1P, was associated with histone H3 and produced S1P that regulated histone acetylation. S1P specifically bound to the histone deacetylases HDAC1 and HDAC2 and inhibited their enzymatic activity, preventing the removal of acetyl groups from lysine residues within histone tails. SphK2 associated with HDAC1 and HDAC2 in repressor complexes and was selectively enriched at the promoters of the genes encoding the cyclin-dependent kinase inhibitor p21 or the transcriptional regulator c-fos, where it enhanced local histone H3 acetylation and transcription. Thus, HDACs are direct intracellular targets of S1P and link nuclear S1P to epigenetic regulation of gene expression.

880 citations

Journal ArticleDOI
TL;DR: In this article, it was shown that Indian UHP rocks of the Tso Morari Complex reached UHP depths at 53.3F0.7 Ma and reached the Asian trench no later than 57F1 Ma, providing a metamorphic age for comparison with previous paleomagnetic and stratigraphic estimates.

505 citations

Journal ArticleDOI
31 Jul 2017-PLOS ONE
TL;DR: The current version of the database holds a total of 852 entries, providing comprehensive information on 239 US-FDA approved therapeutic peptides and proteins and their 380 drug variants, and has annotated the structure of most of the protein and peptides.
Abstract: THPdb (http://crdd.osdd.net/raghava/thpdb/) is a manually curated repository of Food and Drug Administration (FDA) approved therapeutic peptides and proteins. The information in THPdb has been compiled from 985 research publications, 70 patents and other resources like DrugBank. The current version of the database holds a total of 852 entries, providing comprehensive information on 239 US-FDA approved therapeutic peptides and proteins and their 380 drug variants. The information on each peptide and protein includes their sequences, chemical properties, composition, disease area, mode of activity, physical appearance, category or pharmacological class, pharmacodynamics, route of administration, toxicity, target of activity, etc. In addition, we have annotated the structure of most of the protein and peptides. A number of user-friendly tools have been integrated to facilitate easy browsing and data analysis. To assist scientific community, a web interface and mobile App have also been developed.

333 citations

Journal ArticleDOI
TL;DR: A comprehensive review of the application of AI techniques for improving performance of optical communication systems and networks and a summary of opportunities and challenges in optical networking where AI is expected to play a key role in the near future.

271 citations

Journal ArticleDOI
TL;DR: Tertiary structures of peptides were predicted using the state-of-art method, PEPstr and secondary structural states were assigned using DSSP, and a number of web-based tools have been integrated, these include keyword search, data browsing, sequence and structural similarity search.
Abstract: CancerPPD (http://crdd.osdd.net/raghava/cancerppd/) is a repository of experimentally verified anticancer peptides (ACPs) and anticancer proteins. Data were manually collected from published research articles, patents and from other databases. The current release of CancerPPD consists of 3491 ACP and 121 anticancer protein entries. Each entry provides comprehensive information related to a peptide like its source of origin, nature of the peptide, anticancer activity, N- and C-terminal modifications, conformation, etc. Additionally, CancerPPD provides the information of around 249 types of cancer cell lines and 16 different assays used for testing the ACPs. In addition to natural peptides, CancerPPD contains peptides having non-natural, chemically modified residues and D-amino acids. Besides this primary information, CancerPPD stores predicted tertiary structures as well as peptide sequences in SMILES format. Tertiary structures of peptides were predicted using the state-of-art method, PEPstr and secondary structural states were assigned using DSSP. In order to assist users, a number of web-based tools have been integrated, these include keyword search, data browsing, sequence and structural similarity search. We believe that CancerPPD will be very useful in designing peptide-based anticancer therapeutics.

239 citations


Cited by
More filters
01 May 1993
TL;DR: Comparing the results to the fastest reported vectorized Cray Y-MP and C90 algorithm shows that the current generation of parallel machines is competitive with conventional vector supercomputers even for small problems.
Abstract: Three parallel algorithms for classical molecular dynamics are presented. The first assigns each processor a fixed subset of atoms; the second assigns each a fixed subset of inter-atomic forces to compute; the third assigns each a fixed spatial region. The algorithms are suitable for molecular dynamics models which can be difficult to parallelize efficiently—those with short-range forces where the neighbors of each atom change rapidly. They can be implemented on any distributed-memory parallel machine which allows for message-passing of data between independently executing processors. The algorithms are tested on a standard Lennard-Jones benchmark problem for system sizes ranging from 500 to 100,000,000 atoms on several parallel supercomputers--the nCUBE 2, Intel iPSC/860 and Paragon, and Cray T3D. Comparing the results to the fastest reported vectorized Cray Y-MP and C90 algorithm shows that the current generation of parallel machines is competitive with conventional vector supercomputers even for small problems. For large problems, the spatial algorithm achieves parallel efficiencies of 90% and a 1840-node Intel Paragon performs up to 165 faster than a single Cray C9O processor. Trade-offs between the three algorithms and guidelines for adapting them to more complex molecular dynamics simulations are also discussed.

29,323 citations

Journal ArticleDOI
TL;DR: Machine learning addresses many of the same research questions as the fields of statistics, data mining, and psychology, but with differences of emphasis.
Abstract: Machine Learning is the study of methods for programming computers to learn. Computers are applied to a wide range of tasks, and for most of these it is relatively easy for programmers to design and implement the necessary software. However, there are many tasks for which this is difficult or impossible. These can be divided into four general categories. First, there are problems for which there exist no human experts. For example, in modern automated manufacturing facilities, there is a need to predict machine failures before they occur by analyzing sensor readings. Because the machines are new, there are no human experts who can be interviewed by a programmer to provide the knowledge necessary to build a computer system. A machine learning system can study recorded data and subsequent machine failures and learn prediction rules. Second, there are problems where human experts exist, but where they are unable to explain their expertise. This is the case in many perceptual tasks, such as speech recognition, hand-writing recognition, and natural language understanding. Virtually all humans exhibit expert-level abilities on these tasks, but none of them can describe the detailed steps that they follow as they perform them. Fortunately, humans can provide machines with examples of the inputs and correct outputs for these tasks, so machine learning algorithms can learn to map the inputs to the outputs. Third, there are problems where phenomena are changing rapidly. In finance, for example, people would like to predict the future behavior of the stock market, of consumer purchases, or of exchange rates. These behaviors change frequently, so that even if a programmer could construct a good predictive computer program, it would need to be rewritten frequently. A learning program can relieve the programmer of this burden by constantly modifying and tuning a set of learned prediction rules. Fourth, there are applications that need to be customized for each computer user separately. Consider, for example, a program to filter unwanted electronic mail messages. Different users will need different filters. It is unreasonable to expect each user to program his or her own rules, and it is infeasible to provide every user with a software engineer to keep the rules up-to-date. A machine learning system can learn which mail messages the user rejects and maintain the filtering rules automatically. Machine learning addresses many of the same research questions as the fields of statistics, data mining, and psychology, but with differences of emphasis. Statistics focuses on understanding the phenomena that have generated the data, often with the goal of testing different hypotheses about those phenomena. Data mining seeks to find patterns in the data that are understandable by people. Psychological studies of human learning aspire to understand the mechanisms underlying the various learning behaviors exhibited by people (concept learning, skill acquisition, strategy change, etc.).

13,246 citations