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.

412 Publikationen

2001 | Report | PUB-ID: 1970479
Algorithmic Complexity of Protein Identification: Combinatorics of Weighted Strings
Cieliebak, Marc, Algorithmic Complexity of Protein Identification: Combinatorics of Weighted Strings. (). ETH Zürich, Dept. of Computer Science, 2001
PUB
 
2000 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 1918981
Contig Selection in Physical Mapping
Heber, Steffen, Contig Selection in Physical Mapping. Proc. of RECOMB 2000 (). , 2000
PUB | DOI | WoS | PubMed | Europe PMC
 
2000 | Sammelwerksbeitrag | Veröffentlicht | PUB-ID: 1918817
Finding Maximal Pairs with Bounded Gap
Brodal, Gerth S., Finding Maximal Pairs with Bounded Gap. Matching Patterns (Journal of Discrete Algorithms) (). , 2000
PUB
 
2000 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1773345
The SYSTERS protein sequence cluster set
Krause, Antje, The SYSTERS protein sequence cluster set. Nucleic Acids Research 28 (1). , 2000
PUB | PDF | DOI | WoS | PubMed | Europe PMC
 
2000 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1773572
Contig selection in physical mapping
Heber, Steffen, Contig selection in physical mapping. Journal of Computational Biology 7 (3-4). , 2000
PUB | PDF | DOI | WoS | PubMed | Europe PMC
 
2000 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 1918985
Sequence Database Search Using Jumping Alignments
Spang, Rainer, Sequence Database Search Using Jumping Alignments. Proc. of ISMB 2000 (). , 2000
PUB | PubMed | Europe PMC
 
2000 | Konferenzband | Veröffentlicht | PUB-ID: 1918813
Proceedings of the German Conference on Bioinformatics, GCB 2000
Bornberg-Bauer, Erich, Proceedings of the German Conference on Bioinformatics, GCB 2000. (). Berlin, 2000
PUB
 
1999 | Report | PUB-ID: 1970509
Finding Maximal Pairs with Bounded Gap
Brodal, Gerth S., Finding Maximal Pairs with Bounded Gap. (). BRICS, Department of Computer Science, University of Aarhus, 1999
PUB
 
1999 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 1918971
Finding Maximal Pairs with Bounded Gap
Brodal, Gerth S., Finding Maximal Pairs with Bounded Gap. Proc. of CPM 1999 1645 (). , 1999
PUB | DOI
 
1998 | Report | PUB-ID: 1970515
Simple and Flexible Detection of Contiguous Repeats Using a Suffix Tree
Stoye, Jens, Simple and Flexible Detection of Contiguous Repeats Using a Suffix Tree. (). Department of Computer Science, University of California, Davis, 1998
PUB
 
1998 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 1918964
Simple and Flexible Detection of Contiguous Repeats Using a Suffix Tree (Preliminary Version)
Stoye, Jens, Simple and Flexible Detection of Contiguous Repeats Using a Suffix Tree (Preliminary Version). Proc. of CPM 1998 1448 (). , 1998
PUB | DOI
 
1998 | Report | PUB-ID: 1970513
Linear Time Algorithms for Finding and Representing all the Tandem Repeats in a String
Gusfield, Dan, Linear Time Algorithms for Finding and Representing all the Tandem Repeats in a String. (). Department of Computer Science, University of California, Davis, 1998
PUB
 

Filter und Suchbegriffe

department=66100

Suche

Publikationen filtern

Darstellung / Sortierung

Zitationsstil: default

Export / Einbettung