default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTamar Schlick
Person information
- affiliation: New York University, New York, Department of Chemistry, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[j32]Tamar Schlick
, Stephanie Portillo-Ledesma:
Biomolecular modeling thrives in the age of technology. Nat. Comput. Sci. 1(5): 321-331 (2021)- [j31]Tamar Schlick, Stephanie Portillo-Ledesma:
Publisher Correction: Biomolecular modeling thrives in the age of technology. Nat. Comput. Sci. 1(11): 767 (2021) - 2020
- [j30]Grace Meng, Marva Tariq, Swati Jain, Shereef Elmetwaly, Tamar Schlick:
RAG-Web: RNA structure prediction/design using RNA-As-Graphs. Bioinform. 36(2): 647-648 (2020)
2010 – 2019
- 2019
- [j29]Jaewoon Jung, Wataru Nishima, Marcus Daniels, Gavin Bascom, Chigusa Kobayashi, Adetokunbo Adedoyin, Michael E. Wall, Anna Lappala, Dominic Phillips, William Fischer, Chang-Shung Tung, Tamar Schlick, Yuji Sugita, Karissa Y. Sanbonmatsu:
Scaling molecular dynamics beyond 100, 000 processor cores for large-scale biophysical simulations. J. Comput. Chem. 40(21): 1919-1930 (2019) - [c2]Louis Petingi, Tamar Schlick:
Graph-Theoretic Partitioning of RNAs and Classification of Pseudoknots. AlCoB 2019: 68-79 - 2016
- [i1]Lei Hua, Yang Song, Namhee Kim, Christian Laing, Jason T. L. Wang, Tamar Schlick:
CHSalign: A Web Server That Builds upon Junction-Explorer and RNAJAG for Pairwise Alignment of RNA Secondary Structures with Coaxial Helical Stacking. CoRR abs/1609.01987 (2016) - 2015
- [j28]Bret D. Freudenthal, William A. Beard, Lalith E. Perera, David D. Shock, Taejin Kim, Tamar Schlick, Samuel H. Wilson:
Uncovering the polymerase-induced cytotoxicity of an oxidized nucleotide. Nat. 517(7536): 635-639 (2015) - 2013
- [j27]Yunlang Li, Tamar Schlick:
"Gate-keeper" Residues and Active-Site Rearrangements in DNA Polymerase μ Help Discriminate Non-cognate Nucleotides. PLoS Comput. Biol. 9(5) (2013) - 2012
- [j26]Giulio Quarta, Ken Sin, Tamar Schlick:
Dynamic Energy Landscapes of Riboswitches Help Interpret Conformational Rearrangements and Function. PLoS Comput. Biol. 8(2) (2012) - 2011
- [j25]Joseph A. Izzo, Namhee Kim, Shereef Elmetwaly, Tamar Schlick:
RAG: An Update to the RNA-As-Graphs Resource. BMC Bioinform. 12: 219 (2011)
2000 – 2009
- 2007
- [j24]Namhee Kim, Jin Sup Shin, Shereef Elmetwaly, Hin Hark Gan, Tamar Schlick:
RAGPOOLS: RNA-As-Graph-Pools - a web server for assisting the design of structured RNA pools for in vitro selection. Bioinform. 23(21): 2959-2960 (2007) - 2006
- [j23]Tamar Schlick, Ken A. Dill:
Special Section On Multiscale Modeling In Biology. Multiscale Model. Simul. 5(4): 1174 (2006) - 2004
- [j22]Hin Hark Gan, Daniela Fera, Julie Zorn, Nahum Shiffeldrim, Michael Tang, Uri Laserson, Namhee Kim, Tamar Schlick:
RAG: RNA-As-Graphs database-concepts, analysis, features. Bioinform. 20(8): 1285-1291 (2004) - [j21]Daniela Fera, Namhee Kim, Nahum Shiffeldrim, Julie Zorn, Uri Laserson, Hin Hark Gan, Tamar Schlick:
RAG: RNA-As-Graphs web resource. BMC Bioinform. 5: 88 (2004) - [c1]Uri Laserson, Hin Hark Gan, Tamar Schlick:
Searching for 2D RNA geometries in bacterial genomes. SCG 2004: 373-377 - 2003
- [j20]Danny Barash, Linjing Yang, Xiaoliang Qian, Tamar Schlick:
Inherent speedup limitations in multiple time step/particle mesh Ewald algorithms. J. Comput. Chem. 24(1): 77-88 (2003) - [j19]Qing Zhang, Daniel A. Beard, Tamar Schlick:
Constructing irregular surfaces to enclose macromolecular complexes for mesoscale modeling using the discrete surface charge optimization (DISCO) algorithm. J. Comput. Chem. 24(16): 2063-2074 (2003) - [j18]Danny Barash, Tamar Schlick, Moshe Israeli, Ron Kimmel:
Multiplicative Operator Splittings in Nonlinear Diffusion: From Spatial Splitting to Multiple Timesteps. J. Math. Imaging Vis. 19(1): 33-48 (2003) - 2002
- [j17]Dexuan Xie, Tamar Schlick:
A More Lenient Stopping Rule for Line Search Algorithms. Optim. Methods Softw. 17(4): 683-700 (2002) - 2001
- [j16]Xiaoliang Qian, Daniel Strahs, Tamar Schlick:
A new program for optimizing periodic boundary models of solvated biomolecules (PBCAID). J. Comput. Chem. 22(15): 1843-1850 (2001) - 2000
- [j15]Tamar Schlick, Daniel A. Beard, Jing Huang, Daniel Strahs, Xiaoliang Qian:
Computational challenges in simulating large DNA over long times. Comput. Sci. Eng. 2(6): 38-51 (2000) - [j14]Dexuan Xie, Alexander Tropsha, Tamar Schlick:
An Efficient Projection Protocol for Chemical Databases: Singular Value Decomposition Combined with Truncated-Newton Minimization. J. Chem. Inf. Comput. Sci. 40(1): 167-177 (2000)
1990 – 1999
- 1999
- [j13]Dexuan Xie, Tamar Schlick:
Efficient Implementation of the Truncated-Newton Algorithm for Large-Scale Chemistry Applications. SIAM J. Optim. 10(1): 132-154 (1999) - [j12]Dexuan Xie, Tamar Schlick:
Remark on Algorithm 702 - the updated truncated Newton minimization package. ACM Trans. Math. Softw. 25(1): 108-122 (1999) - [p1]Tamar Schlick:
Some Failures and Successes of Long-Timestep Approaches to Biomolecular Simulations. Computational Molecular Dynamics 1999: 227-262 - 1998
- [j11]Leonid Y. Zaslavsky, Tamar Schlick:
An adaptive multigrid technique for evaluating long-range forces in biomolecular simulations. Appl. Math. Comput. 97(2-3): 237-250 (1998) - 1997
- [j10]Robert D. Skeel, Guihua Zhang, Tamar Schlick:
A Family of Symplectic Integrators: Stability, Accuracy, and Molecular Dynamics Applications. SIAM J. Sci. Comput. 18(1): 203-222 (1997) - 1994
- [j9]Philippe Derreumaux, Guihua Zhang, Tamar Schlick, Bernard R. Brooks:
A Truncated Newton Minimizer Adapted for CHARMM and Biomolecular Applications. J. Comput. Chem. 15(5): 532-552 (1994) - [j8]Victoria Z. Averbukh, Samuel Figueroa, Tamar Schlick:
Remark on Algorithm 566. ACM Trans. Math. Softw. 20(3): 282-285 (1994) - 1993
- [j7]Guihua Zhang, Tamar Schlick:
LIN: A new algorithm to simulate the dynamics of biomolecules by combining implicit-integration and normal mode techniques. J. Comput. Chem. 14(10): 1212-1233 (1993) - [j6]X. Zou, Ionel Michael Navon, M. Berger, Paul Kang-Hoh Phua, Tamar Schlick, François-Xavier Le Dimet:
Numerical Experience with Limited-Memory Quasi-Newton and Truncated Newton Methods. SIAM J. Optim. 3(3): 582-608 (1993) - [j5]Tamar Schlick:
Modified Cholesky Factorizations for Sparse Preconditioners. SIAM J. Sci. Comput. 14(2): 424-445 (1993) - 1992
- [j4]Tamar Schlick, Aaron L. Fogelson:
TNPACK - A truncated Newton minimization package for large-scale problems: I. Algorithm and usage. ACM Trans. Math. Softw. 18(1): 46-70 (1992) - [j3]Tamar Schlick, Aaron L. Fogelson:
TNPACK - a truncated Newton minimization package for large-scale problems: II. Implementation examples. ACM Trans. Math. Softw. 18(1): 71-111 (1992) - [j2]Tamar Schlick, Aaron L. Fogelson:
Algorithm 702: TNPACK-a truncated Newton minimization package for large-scale problems: I. Algorithm and usage. ACM Trans. Math. Softw. 18(2): 141 (1992) - 1991
- [j1]Tamar Schlick:
New Approaches to Potential Energy Minimization and Molecular Dynamics Algorithms. Comput. Chem. 15(3): 251-260 (1991)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:10 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
