Substring

Results: 165



#Item
51Permuted Longest-Common-Prefix Array ¨ ¨ Juha Karkk ainen University of Helsinki

Permuted Longest-Common-Prefix Array ¨ ¨ Juha Karkk ainen University of Helsinki

Add to Reading List

Source URL: www.cs.ucr.edu

Language: English - Date: 2009-06-23 14:14:16
52Advanced Algorithms – COMS31900Lecture 8 Suffix Trees Benjamin Sach

Advanced Algorithms – COMS31900Lecture 8 Suffix Trees Benjamin Sach

Add to Reading List

Source URL: www.cs.bris.ac.uk

Language: English - Date: 2014-03-11 09:18:19
53Traitor-Tracing on Binary Strings Michael J. Collins Sandia National Laboratories⋆ Albuquerque, NM USA 87185

Traitor-Tracing on Binary Strings Michael J. Collins Sandia National Laboratories⋆ Albuquerque, NM USA 87185

Add to Reading List

Source URL: eprint.iacr.org

Language: English - Date: 2009-12-23 13:49:52
54Semi-local string comparison Alexander Tiskin http://www.dcs.warwick.ac.uk/~tiskin Department of Computer Science University of Warwick

Semi-local string comparison Alexander Tiskin http://www.dcs.warwick.ac.uk/~tiskin Department of Computer Science University of Warwick

Add to Reading List

Source URL: www.cs.ucr.edu

Language: English - Date: 2006-07-07 01:33:40
55Exact pattern matching Advanced Algorithms – COMS31900 Input A text string T (length n) and a pattern string P (length m

Exact pattern matching Advanced Algorithms – COMS31900 Input A text string T (length n) and a pattern string P (length m

Add to Reading List

Source URL: www.cs.bris.ac.uk

Language: English - Date: 2014-03-11 09:18:19
56Distributed and Paged Suffix Trees for Large Genetic Databases Raphaël Clifford and Marek Sergot ,   Imperial College London, UK

Distributed and Paged Suffix Trees for Large Genetic Databases Raphaël Clifford and Marek Sergot , Imperial College London, UK

Add to Reading List

Source URL: www.cs.ucr.edu

Language: English - Date: 2003-07-07 11:33:13
57Biosequence Algorithms, SpringLecture 6: Introduction to Suffix Trees ¨ Pekka Kilpelainen University of Kuopio

Biosequence Algorithms, SpringLecture 6: Introduction to Suffix Trees ¨ Pekka Kilpelainen University of Kuopio

Add to Reading List

Source URL: www.cs.uku.fi

Language: English - Date: 2005-02-10 03:04:59
58EUROSPEECHGENEVA  Automatic Construction of Unique Signatures and Confusable Sets for Natural Language Directory Assistance Applications E.E. Jan, Benoˆıt Maison, Lidia Mangu and Geoffrey Zweig IBM T. J. Watson

EUROSPEECHGENEVA Automatic Construction of Unique Signatures and Confusable Sets for Natural Language Directory Assistance Applications E.E. Jan, Benoˆıt Maison, Lidia Mangu and Geoffrey Zweig IBM T. J. Watson

Add to Reading List

Source URL: research.microsoft.com

Language: English - Date: 2005-03-03 12:11:22
59h hhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhh  Chapter 9 ❖

h hhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhh Chapter 9 ❖

Add to Reading List

Source URL: www.nondot.org

Language: English - Date: 2001-03-26 23:04:26
60A Tale of Three Algorithms: Linear Time Suffix Array Construction ¨ ainen ¨ Juha Karkk

A Tale of Three Algorithms: Linear Time Suffix Array Construction ¨ ainen ¨ Juha Karkk

Add to Reading List

Source URL: cs.ioc.ee

Language: English - Date: 2006-09-05 14:35:13