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
Brodal, G.S., et al., 1999. Finding Maximal Pairs with Bounded Gap. In Proc. of CPM 1999. LNCS. no.1645 pp. 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. no.1448 pp. 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: harvard1

Export / Einbettung