Michal Linial

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Thomas Lengauer

> Home > Persons > Michal Linial

Publications

2015
[j42]
- view
  authority control:
- export record
  dblp key:
  - journals/bioinformatics/KarpBKLLSHR15
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/bioinformatics/KarpBKLLSHR15
Peter D. Karp, Bonnie Berger, Diane E. Kovats, Thomas Lengauer, Michal Linial, Pardis Sabeti, Winston Hide, Burkhard Rost:
Message from the ISCB: ISCB Ebola award for important future research on the computational biology of Ebola virus. Bioinform. 31(4): 616-617 (2015)
[j40]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/ploscb/KarpBKLLSHR15
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ploscb/KarpBKLLSHR15
Peter D. Karp, Bonnie Berger, Diane E. Kovats, Thomas Lengauer, Michal Linial, Pardis Sabeti, Winston Hide, Burkhard Rost:
ISCB Ebola Award for Important Future Research on the Computational Biology of Ebola Virus. PLoS Comput. Biol. 11(1) (2015)
2012
[j29]
- view
  authority control:
- export record
  dblp key:
  - journals/bioinformatics/RostGLLMMSHK12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/bioinformatics/RostGLLMMSHK12
Burkhard Rost, Terry Gaasterland, Thomas Lengauer, Michal Linial, Scott Markel, B. J. Morrison McKay, Reinhard Schneider, Paul Horton, Janet Kelso:
Paving the future: finding suitable ISMB venues. Bioinform. 28(19): 2556-2559 (2012)

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.