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.

414 Publikationen

2001 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 1918992
Heber, S., & Stoye, J., 2001. Finding all Common Intervals of k Permutations. In Proc. of CPM 2001. LNCS. no.2089 pp. 207-218.
PUB | DOI
 
2001 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 1880197
Heber, S., & Stoye, J., 2001. Algorithms for Finding Gene Clusters. In Proc. of WABI 2001. LNCS. no.2149 Berlin: Sppringer, pp. 252-263.
PUB | DOI
 
2001 | Report | PUB-ID: 1970479
Cieliebak, M., et al., 2001. Algorithmic Complexity of Protein Identification: Combinatorics of Weighted Strings, Technical Report, ETH Zürich, Dept. of Computer Science.
PUB
 
2000 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 1918981
Heber, S., et al., 2000. Contig Selection in Physical Mapping. In Proc. of RECOMB 2000. pp. 155-164.
PUB | DOI | WoS | PubMed | Europe PMC
 
2000 | Sammelwerksbeitrag | Veröffentlicht | PUB-ID: 1918817
Brodal, G.S., et al., 2000. Finding Maximal Pairs with Bounded Gap. In M. Crochemore & L. Gąsieniec, eds. Matching Patterns (Journal of Discrete Algorithms). pp. 77-104.
PUB
 
2000 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1773345
Krause, A., Stoye, J., & Vingron, M., 2000. The SYSTERS protein sequence cluster set. Nucleic Acids Research, 28(1), p 270-272.
PUB | PDF | DOI | WoS | PubMed | Europe PMC
 
2000 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1773572
Heber, S., et al., 2000. Contig selection in physical mapping. Journal of Computational Biology, 7(3-4), p 395-408.
PUB | PDF | DOI | WoS | PubMed | Europe PMC
 
2000 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 1918985
Spang, R., Rehmsmeier, M., & Stoye, J., 2000. Sequence Database Search Using Jumping Alignments. In Proc. of ISMB 2000. pp. 367-375.
PUB | PubMed | Europe PMC
 
2000 | Konferenzband | Veröffentlicht | PUB-ID: 1918813
E. Bornberg-Bauer, et al., eds., 2000. Proceedings of the German Conference on Bioinformatics, GCB 2000, Berlin: Logos Verlag.
PUB
 
1999 | Report | PUB-ID: 1970509
Brodal, G.S., et al., 1999. Finding Maximal Pairs with Bounded Gap, Report, BRICS, Department of Computer Science, University of Aarhus.
PUB
 
1999 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 1918971
Brodal, G.S., et al., 1999. Finding Maximal Pairs with Bounded Gap. In Proc. of CPM 1999. LNCS. no.1645 pp. 134-149.
PUB | DOI
 
1998 | Report | PUB-ID: 1970515
Stoye, J., & Gusfield, D., 1998. Simple and Flexible Detection of Contiguous Repeats Using a Suffix Tree, Report, Department of Computer Science, University of California, Davis.
PUB
 
1998 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 1918964
Stoye, J., & Gusfield, D., 1998. Simple and Flexible Detection of Contiguous Repeats Using a Suffix Tree (Preliminary Version). In Proc. of CPM 1998. LNCS. no.1448 pp. 140-152.
PUB | DOI
 
1998 | Report | PUB-ID: 1970513
Gusfield, D., & Stoye, J., 1998. Linear Time Algorithms for Finding and Representing all the Tandem Repeats in a String, Report, Department of Computer Science, University of California, Davis.
PUB
 

Filter und Suchbegriffe

department=66100

Suche

Publikationen filtern

Darstellung / Sortierung

Zitationsstil: harvard1

Export / Einbettung