Efficient repeat finding in sets of strings via suffix arrays
Discrete mathematics & theoretical computer science, Tome 15 (2013) no. 2
Cet article a éte moissonné depuis la source Episciences
Discrete Algorithms
@article{DMTCS_2013_15_2_a3,
author = {Barenbaum, Pablo and Becher, Ver\'onica and Deymonnaz, Alejandro and Halsband, Melisa and Heiber, Pablo Ariel},
title = {Efficient repeat finding in sets of strings via suffix arrays},
journal = {Discrete mathematics & theoretical computer science},
year = {2013},
volume = {15},
number = {2},
doi = {10.46298/dmtcs.597},
language = {en},
url = {http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.597/}
}
TY - JOUR AU - Barenbaum, Pablo AU - Becher, Verónica AU - Deymonnaz, Alejandro AU - Halsband, Melisa AU - Heiber, Pablo Ariel TI - Efficient repeat finding in sets of strings via suffix arrays JO - Discrete mathematics & theoretical computer science PY - 2013 VL - 15 IS - 2 UR - http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.597/ DO - 10.46298/dmtcs.597 LA - en ID - DMTCS_2013_15_2_a3 ER -
%0 Journal Article %A Barenbaum, Pablo %A Becher, Verónica %A Deymonnaz, Alejandro %A Halsband, Melisa %A Heiber, Pablo Ariel %T Efficient repeat finding in sets of strings via suffix arrays %J Discrete mathematics & theoretical computer science %D 2013 %V 15 %N 2 %U http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.597/ %R 10.46298/dmtcs.597 %G en %F DMTCS_2013_15_2_a3
Barenbaum, Pablo; Becher, Verónica; Deymonnaz, Alejandro; Halsband, Melisa; Heiber, Pablo Ariel. Efficient repeat finding in sets of strings via suffix arrays. Discrete mathematics & theoretical computer science, Tome 15 (2013) no. 2. doi: 10.46298/dmtcs.597
Cité par Sources :