Simple and Flexible Detection of Contiguous Repeats Using a Suffix Tree
Stoye J, Gusfield D (1998) Report.
Department of Computer Science, University of California, Davis.
Report | Englisch
Download
Es wurden keine Dateien hochgeladen. Nur Publikationsnachweis!
Autor*in
Stoye, JensUniBi 
;
Gusfield, Dan
;
Gusfield, DanEinrichtung
Erscheinungsjahr
1998
Serientitel
Report
Page URI
https://pub.uni-bielefeld.de/record/1970515
Zitieren
Stoye J, Gusfield D. Simple and Flexible Detection of Contiguous Repeats Using a Suffix Tree. Report. Department of Computer Science, University of California, Davis; 1998.
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.
Stoye, Jens, and Gusfield, Dan. 1998. Simple and Flexible Detection of Contiguous Repeats Using a Suffix Tree. Report. Department of Computer Science, University of California, Davis.
Stoye, J., and Gusfield, D. (1998). Simple and Flexible Detection of Contiguous Repeats Using a Suffix Tree. Report, Department of Computer Science, University of California, Davis.
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.
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.
Stoye, J., Gusfield, D.: Simple and Flexible Detection of Contiguous Repeats Using a Suffix Tree. Report. Department of Computer Science, University of California, Davis (1998).
Stoye, Jens, and Gusfield, Dan. Simple and Flexible Detection of Contiguous Repeats Using a Suffix Tree. Department of Computer Science, University of California, Davis, 1998. Report.
Google Scholar