PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "Lengauer, Thomas"

Author of the publication

copydeleteadd this publication to your clipboard
Improving fold recognition of protein threading by experimental distance constraints.

, , , and . In Silico Biology, 2 (3): 325-337 (2002)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Dipl.-Ing. Thomas Kuestner

Scan time reduction in DWI of the pancreas using simultaneous multislice technique with different acceleration factors: how fast can we go?, , , , , , , and . Proceedings of the International Society for Magnetic Resonance in Medicine (ISMRM), Honolulu, Hawaii, USA, (April 2017)

Thomas Maier

Thomas Maier

Thomas Maier

Thomas Maier

 

Other publications of authors with the same name

A new Method for Unification of Existing Protein Structure- and Sequence-Families., , , and . German Conference on Bioinformatics, page 78-84. German Research Center for Biotechnology, (2001)Co-clustering of biological networks and gene expression data., , , and . ISMB, page 145-154. (2002)Time-Efficient Docking of Flexible Ligands into Active Sites of Proteins., , and . ISMB, page 300-308. AAAI, (1995)Synthesis of multi-level logic with one symbolic input., and . EURO-DAC, page 60-64. EEE Computer Society, (1991)The Complexity of Compacting Hierarchically Specified Layouts of Integrated Circuits (Preliminary Version). FOCS, page 358-368. IEEE Computer Society, (1982)Robust methods for EMC-driven routing., , , and . IEEE Trans. on CAD of Integrated Circuits and Systems, 13 (11): 1366-1378 (1994)Parallel 'go with the winners' algorithms in distributed memory models., and . J. Parallel Distrib. Comput., 63 (9): 801-814 (2003)Preface: Special RECOMB 2001 Issue.. Journal of Computational Biology, 9 (2): 147-148 (2002)Efficient Solution of Connectivity Problems on Hierarchically Defined Graphs., and . SIAM J. Comput., 17 (6): 1063-1080 (1988)The Binary Network Flow Problem is Logspace Complete for P., and . Theor. Comput. Sci., 75 (3): 357-363 (1990)