<s>
A	O
factor	B-Application
oracle	I-Application
is	O
a	O
finite	B-Architecture
state	I-Architecture
automaton	I-Architecture
that	O
can	O
efficiently	O
search	O
for	O
factors	O
(	O
substrings	O
)	O
in	O
a	O
body	O
of	O
text	O
.	O
</s>
<s>
Older	O
techniques	O
,	O
such	O
as	O
suffix	B-Architecture
trees	I-Architecture
,	O
were	O
time-efficient	O
but	O
required	O
significant	O
amounts	O
of	O
memory	O
.	O
</s>
<s>
Factor	B-Application
oracles	I-Application
,	O
by	O
contrast	O
,	O
can	O
be	O
constructed	O
in	O
linear	O
time	O
and	O
space	O
in	O
an	O
incremental	O
fashion	O
.	O
</s>
<s>
Older	O
techniques	O
for	O
matching	O
strings	O
include	O
:	O
suffix	B-Algorithm
arrays	I-Algorithm
,	O
suffix	B-Architecture
trees	I-Architecture
,	O
suffix	B-General_Concept
automata	I-General_Concept
or	O
directed	B-General_Concept
acyclic	I-General_Concept
word	I-General_Concept
graphs	I-General_Concept
,	O
and	O
factor	O
automata	O
(	O
Allauzen	O
,	O
Crochemore	O
,	O
Raffinot	O
,	O
1999	O
)	O
.	O
</s>
<s>
In	O
1999	O
,	O
Allauzen	O
,	O
Crochemore	O
,	O
and	O
Raffinot	O
,	O
presented	O
the	O
factor	B-Application
oracle	I-Application
algorithm	O
as	O
a	O
memory	O
efficient	O
improvement	O
upon	O
these	O
older	O
techniques	O
for	O
string	O
matching	O
and	O
compression	O
.	O
</s>
<s>
Starting	O
in	O
the	O
mid-2000s	O
,	O
factor	B-Application
oracles	I-Application
have	O
found	O
application	O
in	O
computer	O
music	O
,	O
as	O
well	O
.	O
</s>
<s>
The	O
provides	O
a	O
Matlab	O
implementation	O
of	O
the	O
factor	B-Application
oracle	I-Application
algorithm	O
.	O
</s>
