Reoptimization of the shortest common superstring problem
dc.contributor.author
Bilò, Davide
dc.contributor.author
Böckenhauer, Hans-Joachim
dc.contributor.author
Komm, Dennis
dc.contributor.author
Královič, Richard
dc.contributor.author
Mömke, Tobias
dc.contributor.author
Seibert, Sebastian
dc.contributor.author
Zych, Anna
dc.contributor.editor
Kucherov, Gregory
dc.contributor.editor
Ukkonen, Esko
dc.date.accessioned
2017-06-08T23:45:38Z
dc.date.available
2017-06-08T23:45:38Z
dc.date.issued
2009
dc.identifier.isbn
978-3-642-02440-5
dc.identifier.isbn
978-3-642-02441-2
dc.identifier.issn
0302-9743
dc.identifier.issn
1611-3349
dc.identifier.other
10.1007/978-3-642-02441-2_8
dc.identifier.uri
http://hdl.handle.net/20.500.11850/19944
dc.language.iso
en
dc.publisher
Springer
dc.title
Reoptimization of the shortest common superstring problem
dc.type
Conference Paper
ethz.book.title
Combinatorial pattern matching
ethz.journal.title
Lecture Notes in Computer Science
ethz.journal.volume
5577
ethz.journal.abbreviated
LNCS
ethz.pages.start
78
ethz.pages.end
91
ethz.event
20th Annual Symposium on Combinatorial Pattern Matching (CPM 2009)
ethz.event.location
Lille, France
ethz.event.date
June 22-24, 2009
ethz.identifier.nebis
005839833
ethz.publication.place
Berlin
ethz.publication.status
published
ethz.leitzahl
ETH Zürich::00002 - ETH Zürich::00012 - Lehre und Forschung::00007 - Departemente::02150 - Dep. Informatik / Dep. of Computer Science::02643 - Institut für Theoretische Informatik / Inst. Theoretical Computer Science::03340 - Widmayer, Peter / Widmayer, Peter
ethz.leitzahl
ETH Zürich::00002 - ETH Zürich::00012 - Lehre und Forschung::00007 - Departemente::02150 - Dep. Informatik / Dep. of Computer Science::02643 - Institut für Theoretische Informatik / Inst. Theoretical Computer Science::09779 - Komm, Dennis / Komm, Dennis::03666 - Hromkovic, Juraj (emeritus) / Hromkovic, Juraj (emeritus)
ethz.leitzahl.certified
ETH Zürich::00002 - ETH Zürich::00012 - Lehre und Forschung::00007 - Departemente::02150 - Dep. Informatik / Dep. of Computer Science::02643 - Institut für Theoretische Informatik / Inst. Theoretical Computer Science::03340 - Widmayer, Peter / Widmayer, Peter
ethz.leitzahl.certified
ETH Zürich::00002 - ETH Zürich::00012 - Lehre und Forschung::00007 - Departemente::02150 - Dep. Informatik / Dep. of Computer Science::02643 - Institut für Theoretische Informatik / Inst. Theoretical Computer Science::09779 - Komm, Dennis / Komm, Dennis::03666 - Hromkovic, Juraj (emeritus) / Hromkovic, Juraj (emeritus)
ethz.date.deposited
2017-06-08T23:45:52Z
ethz.source
ECIT
ethz.identifier.importid
imp59364caf5cdc651099
ethz.ecitpid
pub:32370
ethz.eth
yes
ethz.availability
Metadata only
ethz.rosetta.installDate
2017-07-12T22:54:45Z
ethz.rosetta.lastUpdated
2024-02-01T15:57:12Z
ethz.rosetta.versionExported
true
ethz.COinS
ctx_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.atitle=Reoptimization%20of%20the%20shortest%20common%20superstring%20problem&rft.jtitle=Lecture%20Notes%20in%20Computer%20Science&rft.date=2009&rft.volume=5577&rft.spage=78&rft.epage=91&rft.issn=0302-9743&1611-3349&rft.au=Bil%C3%B2,%20Davide&B%C3%B6ckenhauer,%20Hans-Joachim&Komm,%20Dennis&Kr%C3%A1lovi%C4%8D,%20Richard&M%C3%B6mke,%20Tobias&rft.isbn=978-3-642-02440-5&978-3-642-02441-2&rft.genre=proceeding&rft_id=info:doi/10.1007/978-3-642-02441-2_8&rft.btitle=Combinatorial%20pattern%20matching
Files in this item
| Files | Size | Format | Open in viewer |
|---|---|---|---|
|
There are no files associated with this item. |
|||
Publication type
-
Conference Paper [36854]