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.

410 Publikationen

2000 | Sammelwerksbeitrag | Veröffentlicht | PUB-ID: 1918817
Brodal GS, Lyngsø RB, Pedersen CNS, Stoye J (2000)
Finding Maximal Pairs with Bounded Gap.
In: Matching Patterns (Journal of Discrete Algorithms). Crochemore M, Gąsieniec L (Eds); 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. 367-375.
PUB | PubMed | Europe PMC
 
2000 | Konferenzband | Veröffentlicht | PUB-ID: 1918813
Bornberg-Bauer E, Rost U, Stoye J, Vingron M (Eds) (2000)
Proceedings of the German Conference on Bioinformatics, GCB 2000.
Berlin: Logos Verlag.
PUB
 
1999 | Report | PUB-ID: 1970509
Brodal GS, Lyngsø RB, Pedersen CNS, Stoye J (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 GS, Lyngsø RB, Pedersen CNS, Stoye J (1999)
Finding Maximal Pairs with Bounded Gap.
In: Proc. of CPM 1999. LNCS, 1645. 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, 1448. 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: bio1

Export / Einbettung