Creating improvisations on chord progressions using suffix trees
From MaRDI portal
Publication:5207099
DOI10.1080/17459737.2018.1538394zbMath1427.00029OpenAlexW2946788111MaRDI QIDQ5207099
Solon P. Pissis, Lorraine A. K. Ayad, Marc Chemillier
Publication date: 7 January 2020
Published in: Journal of Mathematics and Music (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/17459737.2018.1538394
Nonnumerical algorithms (68W05) Data structures (68P05) Algorithms on strings (68W32) Mathematics and music (00A65)
Related Items (1)
Uses Software
Cites Work
- Very fast and simple approximate string matching
- Using factor oracles for machine improvisation
- Toward a formal study of jazz chord sequences generated by Steedman's grammar
- On-line construction of suffix trees
- A fast string searching algorithm
- Fast Pattern Matching in Strings
- Finding the k shortest simple paths
- Algorithms on Strings
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Creating improvisations on chord progressions using suffix trees