Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

Martin Kupiec

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 Isaac Meilijson

> Home > Persons > Martin Kupiec

Publications

2011
[j6]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/ploscb/ReuveniMKRT11
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ploscb/ReuveniMKRT11
Shlomi Reuveni, Isaac Meilijson, Martin Kupiec, Eytan Ruppin, Tamir Tuller:
Genome-Scale Analysis of Translation Elongation with a Ribosome Flow Model. PLoS Comput. Biol. 7(9) (2011)
[c3]
- view
  authority control:
- export record
  dblp key:
  - conf/recomb/ReuveniMKRT11
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/recomb/ReuveniMKRT11
Shlomi Reuveni, Isaac Meilijson, Martin Kupiec, Eytan Ruppin, Tamir Tuller:
A Ribosome Flow Model for Analyzing Translation Elongation - (Extended Abstract). RECOMB 2011: 358-360
2005
[j1]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/ploscb/KaufmanKMKR05
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ploscb/KaufmanKMKR05
Alon Kaufman, Alon Keinan, Isaac Meilijson, Martin Kupiec, Eytan Ruppin:
Quantitative Analysis of Genetic and Neuronal Multi-Perturbation Experiments. PLoS Comput. Biol. 1(6) (2005)

a service of

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.