first
prev
toc
next
last
Download Citation
Recommend
Mark
Alert
Link
Print
ALGORITHMS FOR COMPUTING APPROXIMATE REPETITIONS IN MUSICAL SEQUENCES
Authors:
Emilios Cambouropoulos a;
Maxime Crochemore b;
Costas Iliopoulos c;
Laurent Mouchard d;
Yoan Pinzon c
| Affiliations: | a Austrian Research Institute for Artificial Intelligence, Schottengasse 3, 1010 Wien, Austria. |
b Institut Gaspard Monge, Universit de Marne-la-Valle, 77454 Marne-la-Valle CEDEX 2, France. |
|
| c Dept. Computer Science, King's College London, London WC2R 2LS, England, and School of Computing, Curtin University of Technology, GPO Box 1987 U, WA. | |
| d LIFAR - ABISS, Universit de Rouen, 76821 Mont Saint Aignan, France, and School of Computing, Curtin University of Technology, GPO Box 1987 U, WA. |
DOI:
10.1080/00207160213939
Publication Frequency:
15 issues per year
Published in:
International Journal of Computer Mathematics,
Volume
79,
Issue
11
2002
, pages 1135
- 1148
International Journal of Computer Mathematics,
Volume
79,
Issue
11
2002
, pages 1135
- 1148
Subjects:
Analysis - Mathematics;
Bioinformatics;
Computer Mathematics;
Discrete Mathematics;
Mathematical Finance;
Mathematical Logic;
Mathematical Numerical Analysis;
Systems & Computer Architecture;
Number of References: 31
Formats available:
PDF
(English)
Article Requests:
Order Reprints
:
Request Permissions
-
Single Article Purchase:
US$37.00
-
buy now
-
Sign In
- Online Sample
add to cart 
[ show other buying options ]
View Article:
View Article (PDF)
Abstract
Here we introduce two new notions of approximate matching with application in computer assisted music analysis. We present algorithms for each notion of approximation: for approximate string matching and for computing approximate squares.
|
| Keywords: String Algorithms; Approximate String Matching; Dynamic Programming; Computer-assisted Music Analysis |
| view references (31) : view citations |
|
Bookmark with:
|
CiteULike
Del.icio.us
BibSonomy
Connotea
More bookmarks
