Linear Time Algorithms for Finding and Representing all the Tandem Repeats in a String
Gusfield D, Stoye J (1998) Report.
Department of Computer Science, University of California, Davis.
Report | Englisch
Download
Es wurden keine Dateien hochgeladen. Nur Publikationsnachweis!
Autor*in
Gusfield, Dan;
Stoye, JensUniBi 
Einrichtung
Erscheinungsjahr
1998
Serientitel
Report
Page URI
https://pub.uni-bielefeld.de/record/1970513
Zitieren
Gusfield D, Stoye J. Linear Time Algorithms for Finding and Representing all the Tandem Repeats in a String. Report. Department of Computer Science, University of California, Davis; 1998.
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.
Gusfield, Dan, and Stoye, Jens. 1998. Linear Time Algorithms for Finding and Representing all the Tandem Repeats in a String. Report. Department of Computer Science, University of California, Davis.
Gusfield, D., and 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.
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.
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.
Gusfield, D., Stoye, J.: Linear Time Algorithms for Finding and Representing all the Tandem Repeats in a String. Report. Department of Computer Science, University of California, Davis (1998).
Gusfield, Dan, and Stoye, Jens. Linear Time Algorithms for Finding and Representing all the Tandem Repeats in a String. Department of Computer Science, University of California, Davis, 1998. Report.
Google Scholar