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

Filter und Suchbegriffe

department=66100

Suche

Publikationen filtern

Darstellung / Sortierung

Zitationsstil: ieee

Export / Einbettung