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, 2089). S. 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. Berlin: Sppringer. (LNCS, 2149). S. 252-263.
PUB | DOI
 
2001 | Report | PUB-ID: 1970479
Cieliebak, M.; Erlebach, T.; Lipták, Z.; Stoye, J.; Welzl, E. (2001): Algorithmic Complexity of Protein Identification: Combinatorics of Weighted Strings. ETH Zürich, Dept. of Computer Science.
PUB
 
2000 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 1918981
Heber, S.; Stoye, J.; Hoheisel, J.; Vingron, M. (2000): Contig Selection in Physical Mapping. In: Proc. of RECOMB 2000. S. 155-164.
PUB | DOI | WoS | PubMed | Europe PMC
 
2000 | Sammelwerksbeitrag | Veröffentlicht | PUB-ID: 1918817
Brodal, G. S.; Lyngsø, R. B.; Pedersen, C. N. S.; Stoye, J. (2000): Finding Maximal Pairs with Bounded Gap. In: Maxime Crochemore; Leszek Gąsieniec (Hrsg.): Matching Patterns (Journal of Discrete Algorithms). S. 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): 270-272.
PUB | PDF | DOI | WoS | PubMed | Europe PMC
 
2000 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1773572
Heber, S.; Stoye, J.; Frohme, M.; Hoheisel, J.; Vingron, M. (2000): Contig selection in physical mapping Journal of Computational Biology,7:(3-4): 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. S. 367-375.
PUB | PubMed | Europe PMC
 
2000 | Konferenzband | Veröffentlicht | PUB-ID: 1918813
Erich Bornberg-Bauer; Ursula Rost; Jens Stoye; Martin Vingron (Hrsg.) (2000): Proceedings of the German Conference on Bioinformatics, GCB 2000. Berlin: Logos Verlag.
PUB
 
1999 | Report | PUB-ID: 1970509
Brodal, G. S.; Lyngsø, R. B.; Pedersen, C. N. S.; Stoye, J. (1999): Finding Maximal Pairs with Bounded Gap. BRICS, Department of Computer Science, University of Aarhus.
PUB
 
1999 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 1918971
Brodal, G. S.; Lyngsø, R. B.; Pedersen, C. N. S.; Stoye, J. (1999): Finding Maximal Pairs with Bounded Gap. In: Proc. of CPM 1999. (LNCS, 1645). S. 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. 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, 1448). S. 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. Department of Computer Science, University of California, Davis.
PUB
 

Filter und Suchbegriffe

department=66100

Suche

Publikationen filtern

Darstellung / Sortierung

Zitationsstil: wels

Export / Einbettung