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, Steffen, and Stoye, Jens. “Finding all Common Intervals of k Permutations”. Proc. of CPM 2001. 2001.Vol. 2089. LNCS. 207-218.
PUB | DOI
 
2001 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 1880197
Heber, Steffen, and Stoye, Jens. “Algorithms for Finding Gene Clusters”. Proc. of WABI 2001. Berlin: Sppringer, 2001.Vol. 2149. LNCS. 252-263.
PUB | DOI
 
2001 | Report | PUB-ID: 1970479
Cieliebak, Marc, Erlebach, Thomas, Lipták, Zsuzsanna, Stoye, Jens, and Welzl, Emo. Algorithmic Complexity of Protein Identification: Combinatorics of Weighted Strings. ETH Zürich, Dept. of Computer Science, 2001. Technical Report.
PUB
 
2000 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 1918981
Heber, Steffen, Stoye, Jens, Hoheisel, Jörg, and Vingron, Martin. “Contig Selection in Physical Mapping”. Proc. of RECOMB 2000. 2000. 155-164.
PUB | DOI | WoS | PubMed | Europe PMC
 
2000 | Sammelwerksbeitrag | Veröffentlicht | PUB-ID: 1918817
Brodal, Gerth S., Lyngsø, Rune B., Pedersen, Christian N. S., and Stoye, Jens. “Finding Maximal Pairs with Bounded Gap”. Matching Patterns (Journal of Discrete Algorithms). Ed. Maxime Crochemore and Leszek Gąsieniec. 2000. 77-104.
PUB
 
2000 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1773345
Krause, Antje, Stoye, Jens, and Vingron, Martin. “The SYSTERS protein sequence cluster set”. Nucleic Acids Research 28.1 (2000): 270-272.
PUB | PDF | DOI | WoS | PubMed | Europe PMC
 
2000 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1773572
Heber, Steffen, Stoye, Jens, Frohme, Marcus, Hoheisel, Jörg, and Vingron, Martin. “Contig selection in physical mapping”. Journal of Computational Biology 7.3-4 (2000): 395-408.
PUB | PDF | DOI | WoS | PubMed | Europe PMC
 
2000 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 1918985
Spang, Rainer, Rehmsmeier, Marc, and Stoye, Jens. “Sequence Database Search Using Jumping Alignments”. Proc. of ISMB 2000. 2000. 367-375.
PUB | PubMed | Europe PMC
 
2000 | Konferenzband | Veröffentlicht | PUB-ID: 1918813
Erich Bornberg-Bauer, Ursula Rost, Jens Stoye, and Martin Vingron, eds. Proceedings of the German Conference on Bioinformatics, GCB 2000. Berlin: Logos Verlag, 2000.
PUB
 
1999 | Report | PUB-ID: 1970509
Brodal, Gerth S., Lyngsø, Rune B., Pedersen, Christian N. S., and Stoye, Jens. Finding Maximal Pairs with Bounded Gap. BRICS, Department of Computer Science, University of Aarhus, 1999. Report.
PUB
 
1999 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 1918971
Brodal, Gerth S., Lyngsø, Rune B., Pedersen, Christian N. S., and Stoye, Jens. “Finding Maximal Pairs with Bounded Gap”. Proc. of CPM 1999. 1999.Vol. 1645. LNCS. 134-149.
PUB | DOI
 
1998 | Report | PUB-ID: 1970515
Stoye, Jens, and Gusfield, Dan. Simple and Flexible Detection of Contiguous Repeats Using a Suffix Tree. Department of Computer Science, University of California, Davis, 1998. Report.
PUB
 
1998 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 1918964
Stoye, Jens, and Gusfield, Dan. “Simple and Flexible Detection of Contiguous Repeats Using a Suffix Tree (Preliminary Version)”. Proc. of CPM 1998. 1998.Vol. 1448. LNCS. 140-152.
PUB | DOI
 
1998 | Report | PUB-ID: 1970513
Gusfield, Dan, and Stoye, Jens. Linear Time Algorithms for Finding and Representing all the Tandem Repeats in a String. Department of Computer Science, University of California, Davis, 1998. Report.
PUB
 

Filter und Suchbegriffe

department=66100

Suche

Publikationen filtern

Darstellung / Sortierung

Zitationsstil: mla

Export / Einbettung