Please note that PUB no longer supports Internet Explorer versions 8 or 9 (or earlier).

We recommend upgrading to the latest Internet Explorer, Google Chrome, or Firefox.

424 Publikationen

2008 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 2308974
Structural Identifiability in Low-Rank Matrix Factorization
Fritzilas, Epameinondas, Structural Identifiability in Low-Rank Matrix Factorization. Computing and Combinatorics 14th Annual International Conference, COCOON 2008 Dalian, China, June 27-29, 2008 Proceedings (). Berlin u.a., 2008
PUB | DOI
 
2008 | Sammelwerksbeitrag | Veröffentlicht | PUB-ID: 2499103
The Complexity of the Exact Weighted Independent Set Problem
Milanivc, M., The Complexity of the Exact Weighted Independent Set Problem. Combinatorial optimization and theoretical computer science: interfaces and perspectives : 30th anniversary of the LAMSADE (). London, UK, 2008
PUB | DOI
 
2008 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 2499108
Genome Halving under DCJ Revisited
Mixtacki, Julia, Genome Halving under DCJ Revisited. Computing and Combinatorics. 14th Annual International Conference, COCOON 2008 Dalian, China, June 27-29, 2008 Proceedings (). , 2008
PUB
 
2008 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 1919198
Detecting Repeat Families in Incompletely Sequenced Genomes
Quitzau, José Augusto Amgarten, Detecting Repeat Families in Incompletely Sequenced Genomes. Proc. of WABI 2008 5251 (). , 2008
PUB | DOI
 
2008 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 2498846
The relative worst order ratio applied to seat reservation
Boyar, Joan, The relative worst order ratio applied to seat reservation. ACM Transactions on Algorithms 4 (4). , 2008
PUB | DOI | WoS
 
2008 | Report | Veröffentlicht | PUB-ID: 2499065
Computing with Priced Information: game trees and the value dependent cost model
Cicalese, F., Computing with Priced Information: game trees and the value dependent cost model. (). , 2008
PUB
 
2008 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 2499072
Computing Alignment Seed Sensitivity with Probabilistic Arithmetic Automata
Herms, Inke, Computing Alignment Seed Sensitivity with Probabilistic Arithmetic Automata. Algorithms in Bioinformatics: 8th International Workshop, WABI 2008, Karlsruhe, Germany, September 15-19, 2008. Proceedings (). Berlin u.a., 2008
PUB | DOI
 
2008 | Report | Veröffentlicht | PUB-ID: 2308930 OA
Computing with Priced Information: game trees and the value dependent cost model
Cicalese, Ferdinando, Computing with Priced Information: game trees and the value dependent cost model. (). Bielefeld, 2008
PUB | PDF
 
2008 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 2499098
A polynomial algorithm to find an independent set of maximum weight in a fork-free graph
Lozin, V. V., A polynomial algorithm to find an independent set of maximum weight in a fork-free graph. J. Discr. Alg. 6 (4). , 2008
PUB | DOI
 
2008 | Sammelwerksbeitrag | Veröffentlicht | PUB-ID: 2499120
Integer Linear Programming Techniques for Discovering Approximate Gene Clusters
Rahmann, Sven, Integer Linear Programming Techniques for Discovering Approximate Gene Clusters. Bioinformatics Algorithms: Techniques and Applications (). Hoboken, NJ, USA, 2008
PUB | DOI
 

Filter und Suchbegriffe

department=66100

Suche

Publikationen filtern

Darstellung / Sortierung

Zitationsstil: default

Export / Einbettung