AustralieFrV1, Main, Merge, bibRecord, 00C280

Three heuristics for δ-matching: δ-BM algorithms

Identifieur interne : 00C280 ( Main/Merge ); précédent : 00C279; suivant : 00C281

Three heuristics for δ-matching: δ-BM algorithms

Auteurs : Maxime Crochemore [France] ; Costas S. Iliopoulos [Royaume-Uni, Australie] ; Thierry Lecroq [France] ; Wojciech Plandowski [Pologne] ; Wojciech Rytter [Royaume-Uni]

Source :

Lecture notes in computer science [ 0302-9743 ] ; 2002.

RBID : Pascal:03-0189280

Descripteurs français

Pascal (Inist)
- Acoustique musicale, Algorithme, Traitement donnée, Appariement chaîne, Concordance forme, Distance, Algorithme rapide, Méthode heuristique, 4375.

English descriptors

KwdEn :
- Algorithm, Data processing, Distance, Fast algorithm, Heuristic method, Musical acoustics, Pattern matching, String matching.

Abstract

We consider a version of pattern matching useful in processing large musical data: δ-matching, which consists in finding matches which are 6-approximate in the sense of the distance measured as maximum difference between symbols. The alphabet is an interval of integers, and the distance between two symbols a, b is measured as |a - b|. We present δ-matching algorithms fast on the average providing that the pattern is "non-flat"and the alphabet interval is large. The pattern is "flat" if its structure does not vary substantially. We also consider (δ, γ)-matching, where γ is a bound on the total number of errors. The algorithms, named δ-BM1, δ-BM2 and δ-BM3 can be thought as members of the generalized Boyer-Moore family of algorithms. The algorithms are fast on average. This is the first paper on the subject, previously only "occurrence heuristics" have been considered. Our heuristics are much stronger and refer to larger parts of texts (not only to single positions). We use δ-versions of suffix tries and subword graphs. Surprisingly, in the context of 6-matching subword graphs appear to be superior compared with compacted suffix trees.

Links toward previous steps (curation, corpus...)

to stream PascalFrancis, to step Corpus: 005403
to stream PascalFrancis, to step Curation: 000D23
to stream PascalFrancis, to step Checkpoint: 005159

Links to Exploration step

Pascal:03-0189280

Le document en format XML

<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" level="a">Three heuristics for δ-matching: δ-BM algorithms</title>
<author><name sortKey="Crochemore, Maxime" sort="Crochemore, Maxime" uniqKey="Crochemore M" first="Maxime" last="Crochemore">Maxime Crochemore</name>
<affiliation wicri:level="1"><inist:fA14 i1="01"><s1>Institut Gaspard Monge, Université Marne-la-Vallée, Cité Descartes, 5 Bd Descartes, Champs-Sur-Marne</s1>
<s2>77454 Marne-la-Vallée</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
</inist:fA14>
<country>France</country>
<wicri:noRegion>77454 Marne-la-Vallée</wicri:noRegion>
<wicri:noRegion>Champs-Sur-Marne</wicri:noRegion>
<wicri:noRegion>77454 Marne-la-Vallée</wicri:noRegion>
</affiliation>
</author>
<author><name sortKey="Iliopoulos, Costas S" sort="Iliopoulos, Costas S" uniqKey="Iliopoulos C" first="Costas S." last="Iliopoulos">Costas S. Iliopoulos</name>
<affiliation wicri:level="1"><inist:fA14 i1="02"><s1>Dept. of Computer Science, King's College London</s1>
<s2>London WC2R 2LS</s2>
<s3>GBR</s3>
<sZ>2 aut.</sZ>
</inist:fA14>
<country>Royaume-Uni</country>
<wicri:noRegion>London WC2R 2LS</wicri:noRegion>
</affiliation>
<affiliation wicri:level="1"><inist:fA14 i1="03"><s1>School of Computing, Curtin University of Technology, GPO Box 1987 U</s1>
<s2>WA</s2>
<s3>AUS</s3>
<sZ>2 aut.</sZ>
</inist:fA14>
<country>Australie</country>
<wicri:noRegion>WA</wicri:noRegion>
</affiliation>
</author>
<author><name sortKey="Lecroq, Thierry" sort="Lecroq, Thierry" uniqKey="Lecroq T" first="Thierry" last="Lecroq">Thierry Lecroq</name>
<affiliation wicri:level="1"><inist:fA14 i1="04"><s1>LIFAR-ABISS, Faculty des Sciences et Techniques, University de Rouen</s1>
<s2>76821 Mont-Saint-Aignan</s2>
<s3>FRA</s3>
<sZ>3 aut.</sZ>
</inist:fA14>
<country>France</country>
<wicri:noRegion>76821 Mont-Saint-Aignan</wicri:noRegion>
<wicri:noRegion>University de Rouen</wicri:noRegion>
<wicri:noRegion>76821 Mont-Saint-Aignan</wicri:noRegion>
</affiliation>
</author>
<author><name sortKey="Plandowski, Wojciech" sort="Plandowski, Wojciech" uniqKey="Plandowski W" first="Wojciech" last="Plandowski">Wojciech Plandowski</name>
<affiliation wicri:level="1"><inist:fA14 i1="05"><s1>Instytut Informatyki, Uniwersytet Warszawski, ul. Banacha 2</s1>
<s2>02-097, Warszawa</s2>
<s3>POL</s3>
<sZ>4 aut.</sZ>
</inist:fA14>
<country>Pologne</country>
<wicri:noRegion>02-097, Warszawa</wicri:noRegion>
</affiliation>
</author>
<author><name sortKey="Rytter, Wojciech" sort="Rytter, Wojciech" uniqKey="Rytter W" first="Wojciech" last="Rytter">Wojciech Rytter</name>
<affiliation wicri:level="1"><inist:fA14 i1="06"><s1>Department of Computer Science, Liverpool University, Peach Street</s1>
<s2>Liverpool L69 7ZF</s2>
<s3>GBR</s3>
<sZ>5 aut.</sZ>
</inist:fA14>
<country>Royaume-Uni</country>
<wicri:noRegion>Liverpool L69 7ZF</wicri:noRegion>
</affiliation>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">INIST</idno>
<idno type="inist">03-0189280</idno>
<date when="2002">2002</date>
<idno type="stanalyst">PASCAL 03-0189280 INIST</idno>
<idno type="RBID">Pascal:03-0189280</idno>
<idno type="wicri:Area/PascalFrancis/Corpus">005403</idno>
<idno type="wicri:Area/PascalFrancis/Curation">000D23</idno>
<idno type="wicri:Area/PascalFrancis/Checkpoint">005159</idno>
<idno type="wicri:explorRef" wicri:stream="PascalFrancis" wicri:step="Checkpoint">005159</idno>
<idno type="wicri:doubleKey">0302-9743:2002:Crochemore M:three:heuristics:for</idno>
<idno type="wicri:Area/Main/Merge">00C280</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title xml:lang="en" level="a">Three heuristics for δ-matching: δ-BM algorithms</title>
<author><name sortKey="Crochemore, Maxime" sort="Crochemore, Maxime" uniqKey="Crochemore M" first="Maxime" last="Crochemore">Maxime Crochemore</name>
<affiliation wicri:level="3"><inist:fA14 i1="01"><s1>Institut Gaspard Monge, Université Marne-la-Vallée, Cité Descartes, 5 Bd Descartes, Champs-Sur-Marne</s1>
<s2>77454 Marne-la-Vallée</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
</inist:fA14>
<country>France</country>
<placeName><region type="region" nuts="2">Île-de-France</region>
<settlement type="city">Marne-la-Vallée</settlement>
</placeName>
</affiliation>
</author>
<author><name sortKey="Iliopoulos, Costas S" sort="Iliopoulos, Costas S" uniqKey="Iliopoulos C" first="Costas S." last="Iliopoulos">Costas S. Iliopoulos</name>
<affiliation wicri:level="1"><inist:fA14 i1="02"><s1>Dept. of Computer Science, King's College London</s1>
<s2>London WC2R 2LS</s2>
<s3>GBR</s3>
<sZ>2 aut.</sZ>
</inist:fA14>
<country>Royaume-Uni</country>
<wicri:noRegion>London WC2R 2LS</wicri:noRegion>
</affiliation>
<affiliation wicri:level="1"><inist:fA14 i1="03"><s1>School of Computing, Curtin University of Technology, GPO Box 1987 U</s1>
<s2>WA</s2>
<s3>AUS</s3>
<sZ>2 aut.</sZ>
</inist:fA14>
<country>Australie</country>
<wicri:noRegion>WA</wicri:noRegion>
</affiliation>
</author>
<author><name sortKey="Lecroq, Thierry" sort="Lecroq, Thierry" uniqKey="Lecroq T" first="Thierry" last="Lecroq">Thierry Lecroq</name>
<affiliation wicri:level="1"><inist:fA14 i1="04"><s1>LIFAR-ABISS, Faculty des Sciences et Techniques, University de Rouen</s1>
<s2>76821 Mont-Saint-Aignan</s2>
<s3>FRA</s3>
<sZ>3 aut.</sZ>
</inist:fA14>
<country>France</country>
<wicri:noRegion>76821 Mont-Saint-Aignan</wicri:noRegion>
<wicri:noRegion>University de Rouen</wicri:noRegion>
<wicri:noRegion>76821 Mont-Saint-Aignan</wicri:noRegion>
</affiliation>
</author>
<author><name sortKey="Plandowski, Wojciech" sort="Plandowski, Wojciech" uniqKey="Plandowski W" first="Wojciech" last="Plandowski">Wojciech Plandowski</name>
<affiliation wicri:level="1"><inist:fA14 i1="05"><s1>Instytut Informatyki, Uniwersytet Warszawski, ul. Banacha 2</s1>
<s2>02-097, Warszawa</s2>
<s3>POL</s3>
<sZ>4 aut.</sZ>
</inist:fA14>
<country>Pologne</country>
<wicri:noRegion>02-097, Warszawa</wicri:noRegion>
</affiliation>
</author>
<author><name sortKey="Rytter, Wojciech" sort="Rytter, Wojciech" uniqKey="Rytter W" first="Wojciech" last="Rytter">Wojciech Rytter</name>
<affiliation wicri:level="1"><inist:fA14 i1="06"><s1>Department of Computer Science, Liverpool University, Peach Street</s1>
<s2>Liverpool L69 7ZF</s2>
<s3>GBR</s3>
<sZ>5 aut.</sZ>
</inist:fA14>
<country>Royaume-Uni</country>
<wicri:noRegion>Liverpool L69 7ZF</wicri:noRegion>
</affiliation>
</author>
</analytic>
<series><title level="j" type="main">Lecture notes in computer science</title>
<idno type="ISSN">0302-9743</idno>
<imprint><date when="2002">2002</date>
</imprint>
</series>
</biblStruct>
</sourceDesc>
<seriesStmt><title level="j" type="main">Lecture notes in computer science</title>
<idno type="ISSN">0302-9743</idno>
</seriesStmt>
</fileDesc>
<profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>Algorithm</term>
<term>Data processing</term>
<term>Distance</term>
<term>Fast algorithm</term>
<term>Heuristic method</term>
<term>Musical acoustics</term>
<term>Pattern matching</term>
<term>String matching</term>
</keywords>
<keywords scheme="Pascal" xml:lang="fr"><term>Acoustique musicale</term>
<term>Algorithme</term>
<term>Traitement donnée</term>
<term>Appariement chaîne</term>
<term>Concordance forme</term>
<term>Distance</term>
<term>Algorithme rapide</term>
<term>Méthode heuristique</term>
<term>4375</term>
</keywords>
</textClass>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en">We consider a version of pattern matching useful in processing large musical data: δ-matching, which consists in finding matches which are 6-approximate in the sense of the distance measured as maximum difference between symbols. The alphabet is an interval of integers, and the distance between two symbols a, b is measured as |a - b|. We present δ-matching algorithms fast on the average providing that the pattern is "non-flat"and the alphabet interval is large. The pattern is "flat" if its structure does not vary substantially. We also consider (δ, γ)-matching, where γ is a bound on the total number of errors. The algorithms, named δ-BM1, δ-BM2 and δ-BM3 can be thought as members of the generalized Boyer-Moore family of algorithms. The algorithms are fast on average. This is the first paper on the subject, previously only "occurrence heuristics" have been considered. Our heuristics are much stronger and refer to larger parts of texts (not only to single positions). We use δ-versions of suffix tries and subword graphs. Surprisingly, in the context of 6-matching subword graphs appear to be superior compared with compacted suffix trees.</div>
</front>
</TEI>
<affiliations><list><country><li>Australie</li>
<li>France</li>
<li>Pologne</li>
<li>Royaume-Uni</li>
</country>
<region><li>Île-de-France</li>
</region>
<settlement><li>Marne-la-Vallée</li>
</settlement>
</list>
<tree><country name="France"><region name="Île-de-France"><name sortKey="Crochemore, Maxime" sort="Crochemore, Maxime" uniqKey="Crochemore M" first="Maxime" last="Crochemore">Maxime Crochemore</name>
</region>
<name sortKey="Lecroq, Thierry" sort="Lecroq, Thierry" uniqKey="Lecroq T" first="Thierry" last="Lecroq">Thierry Lecroq</name>
</country>
<country name="Royaume-Uni"><noRegion><name sortKey="Iliopoulos, Costas S" sort="Iliopoulos, Costas S" uniqKey="Iliopoulos C" first="Costas S." last="Iliopoulos">Costas S. Iliopoulos</name>
</noRegion>
<name sortKey="Rytter, Wojciech" sort="Rytter, Wojciech" uniqKey="Rytter W" first="Wojciech" last="Rytter">Wojciech Rytter</name>
</country>
<country name="Australie"><noRegion><name sortKey="Iliopoulos, Costas S" sort="Iliopoulos, Costas S" uniqKey="Iliopoulos C" first="Costas S." last="Iliopoulos">Costas S. Iliopoulos</name>
</noRegion>
</country>
<country name="Pologne"><noRegion><name sortKey="Plandowski, Wojciech" sort="Plandowski, Wojciech" uniqKey="Plandowski W" first="Wojciech" last="Plandowski">Wojciech Plandowski</name>
</noRegion>
</country>
</tree>
</affiliations>
</record>

Pour manipuler ce document sous Unix (Dilib)

EXPLOR_STEP=$WICRI_ROOT/Wicri/Asie/explor/AustralieFrV1/Data/Main/Merge

HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 00C280 | SxmlIndent | more

HfdSelect -h $EXPLOR_AREA/Data/Main/Merge/biblio.hfd -nk 00C280 | SxmlIndent | more

Pour mettre un lien sur cette page dans le réseau Wicri

{{Explor lien
   |wiki=    Wicri/Asie
   |area=    AustralieFrV1
   |flux=    Main
   |étape=   Merge
   |type=    RBID
   |clé=     Pascal:03-0189280
   |texte=   Three heuristics for δ-matching: δ-BM algorithms
}}

This area was generated with Dilib version V0.6.33.
Data generation: Tue Dec 5 10:43:12 2017. Site generation: Tue Mar 5 14:07:20 2024

	Serveur d'exploration sur les relations entre la France et l'Australie
	Attention, ce site est en cours de développement ! Attention, site généré par des moyens informatiques à partir de corpus bruts. Les informations ne sont donc pas validées.

Serveur d'exploration sur les relations entre la France et l'Australie

Three heuristics for δ-matching: δ-BM algorithms

Three heuristics for δ-matching: δ-BM algorithms

Source :

Descripteurs français

English descriptors

Abstract

Links toward previous steps (curation, corpus...)

Links to Exploration step

Le document en format XML

Pour manipuler ce document sous Unix (Dilib)

Pour mettre un lien sur cette page dans le réseau Wicri