Sciweavers

8 search results - page 2 / 2
» Understanding maximal repetitions in strings
Sort
View
IPL
2008
93views more  IPL 2008»
13 years 9 months ago
Computing Longest Previous Factor in linear time and applications
We give two optimal linear-time algorithms for computing the Longest Previous Factor (LPF) array corresponding to a string w. For any position i in w, LPF[i] gives the length of th...
Maxime Crochemore, Lucian Ilie
ITS
2004
Springer
124views Multimedia» more  ITS 2004»
14 years 3 months ago
Combining Competing Language Understanding Approaches in an Intelligent Tutoring System
When implementing a tutoring system that attempts a deep understanding of students’ natural language explanations, there are three basic approaches to choose between; symbolic, i...
Pamela W. Jordan, Maxim Makatchev, Kurt VanLehn
BMCBI
2007
124views more  BMCBI 2007»
13 years 9 months ago
CRISPR Recognition Tool (CRT): a tool for automatic detection of clustered regularly interspaced palindromic repeats
Background: Clustered Regularly Interspaced Palindromic Repeats (CRISPRs) are a novel type of direct repeat found in a wide range of bacteria and archaea. CRISPRs are beginning to...
Charles Bland, Teresa L. Ramsey, Fareedah Sabree, ...