A linear time algorithm for consecutive permutation pattern matching, Information Processing Letters, vol.113, issue.12, pp.430-433, 2013. ,
DOI : 10.1016/j.ipl.2013.03.015
The Art of Computer Programming, Volume I: Fundamental Algorithms, 1997. ,
Combinatorial problems and exercices, 1979. ,
Stack sortable permutations, Discrete Mathematics, vol.33, issue.2, pp.185-196, 1981. ,
DOI : 10.1016/0012-365X(81)90165-5
URL : https://doi.org/10.1016/0012-365x(81)90165-5
Pattern matching for permutations, Information Processing Letters, vol.65, issue.5, pp.277-283, 1998. ,
DOI : 10.1016/S0020-0190(97)00209-3
Algorithms for Pattern Involvement in Permutations, Algorithms and Computation ? ISAAC 2001, pp.355-366, 2001. ,
DOI : 10.1016/S0012-365X(96)83023-8
URL : http://www.cs.otago.ac.nz/staffpriv/mike/Papers/Recognition/Recognition.pdf
Pattern Matching for 321-Avoiding Permutations, Algorithms and Computation ? ISAAC 2009, pp.1064-1073, 2009. ,
DOI : 10.1007/978-3-642-10631-6_107
URL : https://hal.archives-ouvertes.fr/hal-00620322
Finding pattern matchings for permutations, Information Processing Letters, vol.61, issue.6, pp.293-295, 1997. ,
DOI : 10.1016/S0020-0190(97)00029-X
Finding small patterns in permutations in linear time, 25th Annual ACM-SIAM Symposium on Discrete Algorithms ? SODA 2014, SIAM, pp.82-101, 2014. ,
DOI : 10.1137/1.9781611973402.7
URL : http://epubs.siam.org/doi/pdf/10.1137/1.9781611973402.7
The computational landscape of permutation patterns ,
Single and Multiple Consecutive Permutation Motif Search ,
DOI : 10.1007/978-3-642-45030-3_7
URL : https://hal.archives-ouvertes.fr/hal-00859363
A fast algorithm for order-preserving pattern matching, Information Processing Letters, vol.115, issue.2, pp.397-402, 2015. ,
DOI : 10.1016/j.ipl.2014.10.018
Order-Preserving Matching with Filtration, Experimental Algorithms ? SEA 2014, pp.307-314, 2014. ,
DOI : 10.1007/978-3-319-07959-2_26
Efficient Algorithms for the Order Preserving Pattern Matching Problem ,
DOI : 10.1016/j.ipl.2013.03.015
URL : http://arxiv.org/pdf/1501.04001
Order preserving pattern matching revisited, Pattern Recognition Letters, vol.55, pp.15-21, 2015. ,
DOI : 10.1016/j.patrec.2014.11.013
Order-preserving pattern matching with k mismatches, Combinatorial Pattern Matching ? CPM 2014, pp.130-139, 2014. ,
DOI : 10.1016/j.tcs.2015.08.022
URL : http://arxiv.org/pdf/1309.6453
Order Preserving Prefix Tables, String Processing and Information Retrieval ? SPIRE 2014, pp.111-116, 2014. ,
DOI : 10.1007/978-3-319-11918-2_11
On Representations of Ternary Order Relations in Numeric Strings, Algorithms for Big Data ? IABCD 2014 of CEUR Workshop Proceedings, CEUR-WS.org, pp.46-52, 2014. ,
DOI : 10.1007/BF01206331
URL : http://ceur-ws.org/Vol-1146/paper8.pdf
Maximum number of distinct and nonequivalent nonstandard squares in a word, Developments in Language Theory ? DLT 2014, pp.215-226, 2014. ,
DOI : 10.1007/978-3-319-09698-8_19
URL : http://arxiv.org/pdf/1604.02238
Parameterized Pattern Matching: Algorithms and Applications, Journal of Computer and System Sciences, vol.52, issue.1, pp.28-42, 1996. ,
DOI : 10.1006/jcss.1996.0003
URL : https://doi.org/10.1006/jcss.1996.0003
Faster Suffix Tree Construction with Missing Suffix Links, SIAM Journal on Computing, vol.33, issue.1, pp.26-42, 2003. ,
DOI : 10.1137/S0097539701424465
URL : http://drona.csa.iisc.ernet.in/~ramesh/psfiles/25.ps.gz
On-line construction of parameterized suffix trees for large alphabets, Information Processing Letters, vol.111, issue.5, pp.201-207, 2011. ,
DOI : 10.1016/j.ipl.2010.11.017
Log-logarithmic worst-case range queries are possible in space ??(N), Information Processing Letters, vol.17, issue.2, pp.81-84, 1983. ,
DOI : 10.1016/0020-0190(83)90075-3
Dynamic weighted ancestors, 18th Annual ACM-SIAM Symposium on Discrete Algorithms ? SODA 2007, SIAM, pp.565-574, 2007. ,
On-line construction of suffix trees, Algorithmica, vol.10, issue.3, pp.249-260, 1995. ,
DOI : 10.1145/321941.321946
URL : http://www.cs.helsinki.fi/u/ukkonen/SuffixT1.ps
Dynamic Perfect Hashing: Upper and Lower Bounds, SIAM Journal on Computing, vol.23, issue.4, pp.738-761, 1994. ,
DOI : 10.1137/S0097539791194094
URL : http://www.uni-paderborn.de/fachbereich/AG/agmadh/WWW/documents/../../PapersPostscript/DynamicPerfHashing_SICOMP.ps
Integer sorting in O(n ? log log n) expected time and linear space, 43rd Symposium on Foundations of Computer Science ? FOCS 2002, pp.135-144, 2002. ,
Deterministic sorting in O(nloglogn) time and linear space, Journal of Algorithms, vol.50, issue.1, pp.96-105, 2004. ,
DOI : 10.1016/j.jalgor.2003.09.001
Color set size problem with application to string matching, Combinatorial Pattern Matching ? CPM 1992, pp.230-243, 1992. ,
Linear Algorithm for Data Compression via String Matching, Journal of the ACM, vol.28, issue.1, pp.16-24, 1981. ,
DOI : 10.1145/322234.322237
Computing the Longest Previous Factor, European Journal of Combinatorics, vol.34, issue.1, pp.15-26, 2013. ,
DOI : 10.1016/j.ejc.2012.07.011
URL : https://hal.archives-ouvertes.fr/hal-01616480
Fast Algorithms for Finding Nearest Common Ancestors, SIAM Journal on Computing, vol.13, issue.2, pp.338-355, 1984. ,
DOI : 10.1137/0213024
The LCA Problem Revisited, Latin American Symposium on Theoretical Informatics ? LATIN 2000, pp.88-94, 2000. ,
DOI : 10.1007/10719839_9
Simple and flexible detection of contiguous repeats using a suffix tree, Theoretical Computer Science, vol.270, issue.1-2, pp.843-856, 2002. ,
DOI : 10.1016/S0304-3975(01)00121-9
URL : https://doi.org/10.1016/s0304-3975(01)00121-9
Linear time algorithms for finding and representing all the tandem repeats in a string, Journal of Computer and System Sciences, vol.69, issue.4, pp.525-546, 2004. ,
DOI : 10.1016/j.jcss.2004.03.004
URL : https://doi.org/10.1016/j.jcss.2004.03.004
An O(n log n) algorithm for finding all repetitions in a string, Journal of Algorithms, vol.5, issue.3, pp.422-432, 1984. ,
DOI : 10.1016/0196-6774(84)90021-X
Wavelet Trees Meet Suffix Trees, 26th Annual ACM- SIAM Symposium on Discrete Algorithms ? SODA 2015, SIAM, pp.572-591, 2015. ,
DOI : 10.1137/1.9781611973730.39
URL : http://arxiv.org/pdf/1408.6182.pdf
Sorted Range Reporting, Algorithm Theory ? SWAT 2012, pp.271-282, 2012. ,
DOI : 10.1007/978-3-642-31155-0_24
Sorted range reporting revisited ,
Counting Inversions, Offline Orthogonal Range Counting, and Related Problems, 21st Annual ACM-SIAM Symposium on Discrete Algorithms ? SODA 2010, SIAM, pp.161-173, 2010. ,
DOI : 10.1137/1.9781611973075.15
URL : http://www.siam.org/proceedings/soda/2010/SODA10_015_chant.pdf
Wavelet Trees Meet Suffix Trees ,
DOI : 10.1137/1.9781611973730.39
URL : http://arxiv.org/pdf/1408.6182.pdf