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.

419 Publikationen

2002 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 1919000
Cieliebak M, Lipták Z, Welzl E, Erlebach T, Stoye J (2002)
Algorithmic Complexity of Protein Identification: Searching in Weighted Strings.
In: Proc. of IFIP TCS 2002. 143-156.
PUB
 
2002 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1773578 OA
Spang R, Rehmsmeier M, Stoye J (2002)
A novel approach to remote homology detection: jumping alignments.
Journal of Computational Biology 9(5): 747-760.
PUB | PDF | DOI | WoS | PubMed | Europe PMC
 
2002 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1773332 OA
Stoye J, Gusfield D (2002)
Simple and flexible detection of contiguous repeats using a suffix tree.
Theoretical Computer Science 270(1-2): 843-856.
PUB | PDF | DOI | WoS
 
2002 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1773329 OA
Bergeron A, Heber S, Stoye J (2002)
Common intervals and sorting by reversals: a marriage of necessity.
Bioinformatics 18(Suppl 2): S54-S63.
PUB | PDF | DOI | WoS | PubMed | Europe PMC
 
2002 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 1918995
Heber S, Stoye J, Frohme M, Hoheisel J, Vingron M (2002)
Resampling Methods in Physical Mapping.
In: Proc. of GfKl 2000. 437-444.
PUB
 
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. 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, 2149. Berlin: Sppringer: 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. Technical Report.
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. 155-164.
PUB | DOI | WoS | PubMed | Europe PMC
 
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 OA
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 OA
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