A polyhedral approach to sequence alignment problems

Kececioglu, John; Lenhof, Hans-Peter; Mehlhorn, Kurt; Mutzel, Petra; Reinert, Knut; Vingron, Martin

アイテム詳細

登録内容を編集ファイル形式で保存

一時保存へ追加

タグ情報を表示リリース履歴を表示詳細要約

公開

学術論文

A polyhedral approach to sequence alignment problems

MPS-Authors

/persons/resource/persons44909

Lenhof, Hans-Peter
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons45021

Mehlhorn, Kurt
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons45092

Mutzel, Petra
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons45277

Reinert, Knut
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource

There are no locators available

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

フルテキスト (公開)

公開されているフルテキストはありません

付随資料 (公開)

There is no public supplementary material available

引用

Kececioglu, J., Lenhof, H.-P., Mehlhorn, K., Mutzel, P., Reinert, K., & Vingron, M. (2000). A polyhedral approach to sequence alignment problems. Discrete Applied Mathematics, 104, 143-186.

引用: https://hdl.handle.net/11858/00-001M-0000-000F-3341-A

要旨

要旨はありません