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.

424 Publikationen

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