Stop the war!

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

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

Knut Reinert

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 Hans-Peter Lenhof

> Home > Persons > Knut Reinert

Publications

2009
[c22]
- view
  authority control:
- export record
  dblp key:
  - conf/birthday/AlthausKKLR09
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/birthday/AlthausKKLR09
Ernst Althaus, Gunnar W. Klau, Oliver Kohlbacher, Hans-Peter Lenhof, Knut Reinert:
Integer Linear Programming in Computational Biology. Efficient Algorithms 2009: 199-218
2006
[j10]
- view
  authority control:
- export record
  dblp key:
  - journals/mp/AlthausCLR06
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/mp/AlthausCLR06
Ernst Althaus, Alberto Caprara, Hans-Peter Lenhof, Knut Reinert:
A branch-and-cut algorithm for multiple sequence alignment. Math. Program. 105(2-3): 387-425 (2006)
2002
[c11]
- no documents available
  - no references & citations available
- export record
  dblp key:
  - conf/eccb/AlthausCLR02
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/eccb/AlthausCLR02
Ernst Althaus, Alberto Caprara, Hans-Peter Lenhof, Knut Reinert:
Multiple sequence alignment with arbitrary gap costs: Computing an optimal solution using polyhedral combinatorics. ECCB 2002: 4-16
2000
[j4]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/dam/KececiogluLMMRV00
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dam/KececiogluLMMRV00
John D. Kececioglu, Hans-Peter Lenhof, Kurt Mehlhorn, Petra Mutzel, Knut Reinert, Martin Vingron:
A polyhedral approach to sequence alignment problems. Discret. Appl. Math. 104(1-3): 143-186 (2000)
1999
[j2]
- view
  authority control:
- export record
  dblp key:
  - journals/bioinformatics/LenhofMR99
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/bioinformatics/LenhofMR99
Hans-Peter Lenhof, Burkhard Morgenstern, Knut Reinert:
An exact solution for the segment-to-segment multiple sequence alignment problem. Bioinform. 15(3): 203-210 (1999)
1998
[j1]
- view
  authority control:
- export record
  dblp key:
  - journals/jcb/LenhofRV98
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jcb/LenhofRV98
Hans-Peter Lenhof, Knut Reinert, Martin Vingron:
A Polyhedral Approach to RNA Sequence Structure Alignment. J. Comput. Biol. 5(3): 517-530 (1998)
[c4]
- no documents available
  - no references & citations available
- export record
  dblp key:
  - conf/gcb/ReinertLM98
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/gcb/ReinertLM98
Knut Reinert, Hans-Peter Lenhof, Burkhard Morgenstern:
An exact solution for the Segment-to-Segment multiple sequence alignment problem. German Conference on Bioinformatics 1998
[c3]
- view
  authority control:
- export record
  dblp key:
  - conf/recomb/LenhofRV98
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/recomb/LenhofRV98
Hans-Peter Lenhof, Knut Reinert, Martin Vingron:
A polyhedral approach to RNA sequence structure alignment. RECOMB 1998: 153-162
1997
[c2]
- view
  authority control:
- export record
  dblp key:
  - conf/recomb/ReinertLMMK97
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/recomb/ReinertLMMK97
Knut Reinert, Hans-Peter Lenhof, Petra Mutzel, Kurt Mehlhorn, John D. Kececioglu:
A branch-and-cut algorithm for multiple sequence alignment. RECOMB 1997: 241-250

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.