• Navarro G. (2024). Computing MEMs and Relatives on Repetitive Text Collections. ACM Transactions on Algorithms. 21:1. (1-33). Online publication date: 31-Jan-2025.

    https://doi.org/10.1145/3701561

  • Barish R and Shibuya T. (2024). String editing under pattern constraints. Theoretical Computer Science. 1022:C. Online publication date: 29-Dec-2025.

    https://doi.org/10.1016/j.tcs.2024.114889

  • Mondal K, Ghosh M, Fajriyah R and Roy A. (2024). Introducing suffix forest for mining tri-clusters from time-series data. Innovations in Systems and Software Engineering. 20:4. (765-787). Online publication date: 1-Dec-2024.

    https://doi.org/10.1007/s11334-022-00489-9

  • Amir A, Kondratovsky E and Levy A. (2024). On suffix tree detection. Theoretical Computer Science. 10.1016/j.tcs.2024.114728. 1012. (114728). Online publication date: 1-Oct-2024.

    https://linkinghub.elsevier.com/retrieve/pii/S0304397524003451

  • Guo P, Umboh S, Wirth A and Zobel J. Online Computation of String Net Frequency. String Processing and Information Retrieval. (159-173).

    https://doi.org/10.1007/978-3-031-72200-4_12

  • Chen Y, Gan W, Huang G, Wu Y and Yu P. (2024). Privacy-preserving federated discovery of DNA motifs with differential privacy. Expert Systems with Applications. 10.1016/j.eswa.2024.123799. 249. (123799). Online publication date: 1-Sep-2024.

    https://linkinghub.elsevier.com/retrieve/pii/S0957417424006651

  • He Z, Wang J, Jiang M, Hu L and Zou Q. (2024). Random subsequence forests. Information Sciences: an International Journal. 667:C. Online publication date: 1-May-2024.

    https://doi.org/10.1016/j.ins.2024.120478

  • Chen L, Tsao C, Deng J, Hon W and Sadakane K. (2024). τλ-Index: Locating Rare Patterns in Similar Strings 2024 Data Compression Conference (DCC). 10.1109/DCC58796.2024.00031. 979-8-3503-8587-8. (233-242).

    https://ieeexplore.ieee.org/document/10533709/

  • Li T, Jiang H, Zhu B, Wang L and Zhu D. Flanked Block-Interchange Distance on Strings. IEEE/ACM Transactions on Computational Biology and Bioinformatics. 10.1109/TCBB.2024.3351440. 21:2. (301-311).

    https://ieeexplore.ieee.org/document/10384741/

  • Wang Q and Ying M. (2024). Quantum Algorithm for Lexicographically Minimal String Rotation. Theory of Computing Systems. 68:1. (29-74). Online publication date: 1-Feb-2024.

    https://doi.org/10.1007/s00224-023-10146-8

  • Du Z, Zhang S and Bader D. (2023). Tunnel: Parallel-inducing sort for large string analytics. Future Generation Computer Systems. 10.1016/j.future.2023.08.009. 149. (650-663). Online publication date: 1-Dec-2023.

    https://linkinghub.elsevier.com/retrieve/pii/S0167739X23003096

  • Lee G, Kim J, Choi M, Jang R and Lee R. (2023). Review of Code Similarity and Plagiarism Detection Research Studies. Applied Sciences. 10.3390/app132011358. 13:20. (11358).

    https://www.mdpi.com/2076-3417/13/20/11358

  • Amir A, Kondratovsky E and Levy A. On Suffix Tree Detection. String Processing and Information Retrieval. (14-27).

    https://doi.org/10.1007/978-3-031-43980-3_2

  • Díaz-Domínguez D and Salmela L. Computing All-vs-All MEMs in Grammar-Compressed Text. String Processing and Information Retrieval. (157-170).

    https://doi.org/10.1007/978-3-031-43980-3_13

  • Fujishige Y, Tsujimaru Y, Inenaga S, Bannai H and Takeda M. (2023). Linear-time computation of DAWGs, symmetric indexing structures, and MAWs for integer alphabets. Theoretical Computer Science. 973:C. Online publication date: 21-Sep-2023.

    https://doi.org/10.1016/j.tcs.2023.114093

  • Gilbert J, Hajiaghayi M, Saleh H and Seddighin S. Location-Sensitive String Problems in MPC. Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures. (101-111).

    https://doi.org/10.1145/3558481.3591090

  • Fernandes C and Lintzmayer C. (2022). Leafy spanning arborescences in DAGs. Discrete Applied Mathematics. 323:C. (217-227). Online publication date: 31-Dec-2022.

    https://doi.org/10.1016/j.dam.2021.06.018

  • Ferreira B, de Moura E and Silva A. (2022). Applying burst-tries for error-tolerant prefix search. Information Retrieval. 25:4. (481-518). Online publication date: 1-Dec-2022.

    https://doi.org/10.1007/s10791-022-09416-9

  • Jena S and Das G. (2022). Vertex-edge domination in unit disk graphs. Discrete Applied Mathematics. 319:C. (351-361). Online publication date: 15-Oct-2022.

    https://doi.org/10.1016/j.dam.2021.06.002

  • M.A. S and Antony C. (2022). The complexity of restricted star colouring. Discrete Applied Mathematics. 319:C. (327-350). Online publication date: 15-Oct-2022.

    https://doi.org/10.1016/j.dam.2021.05.015

  • Bhore S, Chakraborty S, Jana S, Mitchell J, Pandit S and Roy S. (2022). The balanced connected subgraph problem. Discrete Applied Mathematics. 319:C. (111-120). Online publication date: 15-Oct-2022.

    https://doi.org/10.1016/j.dam.2020.12.030

  • Du Z, Zhang S and Bader D. Parallel Suffix Sorting for Large String Analytics. Parallel Processing and Applied Mathematics. (71-82).

    https://doi.org/10.1007/978-3-031-30442-2_6

  • Vaiwsri S, Ranbaduge T and Christen P. (2022). Accurate and efficient privacy-preserving string matching. International Journal of Data Science and Analytics. 10.1007/s41060-022-00320-5. 14:2. (191-215). Online publication date: 1-Aug-2022.

    https://link.springer.com/10.1007/s41060-022-00320-5

  • Rabea Z, El-Metwally S, Elmougy S and Zakaria M. (2022). A fast algorithm for constructing suffix arrays for DNA alphabets. Journal of King Saud University - Computer and Information Sciences. 34:7. (4659-4668). Online publication date: 1-Jul-2022.

    https://doi.org/10.1016/j.jksuci.2022.04.015

  • Li Z, Li J and Huo H. (2022). Optimal in-place suffix sorting. Information and Computation. 285:PB. Online publication date: 1-May-2022.

    https://doi.org/10.1016/j.ic.2021.104818

  • Cáceres M and Navarro G. (2022). Faster repetition-aware compressed suffix trees based on Block Trees. Information and Computation. 285:PB. Online publication date: 1-May-2022.

    https://doi.org/10.1016/j.ic.2021.104749

  • Magalhaes A, Monteiro J and Brayner A. (2021). Main Memory Database Recovery. ACM Computing Surveys. 54:2. (1-36). Online publication date: 31-Mar-2022.

    https://doi.org/10.1145/3442197

  • Deldjoo Y, Noia T and Merra F. (2021). A Survey on Adversarial Recommender Systems. ACM Computing Surveys. 54:2. (1-38). Online publication date: 31-Mar-2022.

    https://doi.org/10.1145/3439729

  • Harley K and Cooper R. (2021). Information Integrity. ACM Computing Surveys. 54:2. (1-35). Online publication date: 31-Mar-2022.

    https://doi.org/10.1145/3436817

  • Navarro G. (2021). Indexing Highly Repetitive String Collections, Part I. ACM Computing Surveys. 54:2. (1-31). Online publication date: 31-Mar-2022.

    https://doi.org/10.1145/3434399

  • Ribeiro P, Paredes P, Silva M, Aparicio D and Silva F. (2021). A Survey on Subgraph Counting. ACM Computing Surveys. 54:2. (1-36). Online publication date: 31-Mar-2022.

    https://doi.org/10.1145/3433652

  • Navarro G. (2021). Indexing Highly Repetitive String Collections, Part II. ACM Computing Surveys. 54:2. (1-32). Online publication date: 31-Mar-2022.

    https://doi.org/10.1145/3432999

  • Qasem A, Shirani P, Debbabi M, Wang L, Lebel B and Agba B. (2021). Automatic Vulnerability Detection in Embedded Devices and Firmware. ACM Computing Surveys. 54:2. (1-42). Online publication date: 31-Mar-2022.

    https://doi.org/10.1145/3432893

  • Barish R and Shibuya T. (2022). String Editing Under Pattern Constraints. New Trends in Computer Technologies and Applications. 10.1007/978-981-19-9582-8_2. (13-24).

    https://link.springer.com/10.1007/978-981-19-9582-8_2

  • Li J, Lamastra D, Pabon J, Kelly P, Grabenstein J, Papamichail D, Bhola L, Zughbi B and Klaskala K. (2022). Integrate Generalized Suffix Tree into Dictionary Attack. Information Systems and Technologies. 10.1007/978-3-031-04826-5_20. (204-213).

    https://link.springer.com/10.1007/978-3-031-04826-5_20

  • Bonchi F, García-Soriano D, Miyauchi A and Tsourakakis C. (2021). Finding densest k-connected subgraphs. Discrete Applied Mathematics. 305:C. (34-47). Online publication date: 31-Dec-2022.

    https://doi.org/10.1016/j.dam.2021.08.032

  • Chanchary F, Maheshwari A and Smid M. (2021). Window queries for intersecting objects, maximal points and approximations using coresets. Discrete Applied Mathematics. 305:C. (295-310). Online publication date: 31-Dec-2022.

    https://doi.org/10.1016/j.dam.2021.03.009

  • Korchmaros A. (2021). The structure of 2-colored best match graphs. Discrete Applied Mathematics. 304:C. (397-416). Online publication date: 15-Dec-2021.

    https://doi.org/10.1016/j.dam.2021.08.007

  • Asahiro Y, Eto H, Hanaka T, Lin G, Miyano E and Terabaru I. (2021). Parameterized algorithms for the Happy Set problem. Discrete Applied Mathematics. 304:C. (32-44). Online publication date: 15-Dec-2021.

    https://doi.org/10.1016/j.dam.2021.07.005

  • Kurita K, Wasa K, Arimura H and Uno T. (2021). Efficient enumeration of dominating sets for sparse graphs. Discrete Applied Mathematics. 303:C. (283-295). Online publication date: 15-Nov-2021.

    https://doi.org/10.1016/j.dam.2021.06.004

  • Hermelin D and Manoussakis G. (2021). Efficient enumeration of maximal induced bicliques. Discrete Applied Mathematics. 303:C. (253-261). Online publication date: 15-Nov-2021.

    https://doi.org/10.1016/j.dam.2020.04.034

  • Evagorou G, Ghosh A and Heinis T. HYPO. Proceedings of the 5th ACM SIGSPATIAL International Workshop on Location-based Recommendations, Geosocial Networks and Geoadvertising. (1-10).

    https://doi.org/10.1145/3486183.3491000

  • Koana T and Nichterlein A. (2021). Detecting and enumerating small induced subgraphs in c-closed graphs. Discrete Applied Mathematics. 302:C. (198-207). Online publication date: 30-Oct-2021.

    https://doi.org/10.1016/j.dam.2021.06.019

  • Rangasamy J. (2021). On “Practical and secure outsourcing algorithms for solving quadratic congruences in IoTs” from IEEE IoT journal. Discrete Applied Mathematics. 302:C. (139-146). Online publication date: 30-Oct-2021.

    https://doi.org/10.1016/j.dam.2021.06.013

  • Bailey T and Birol I. (2021). STREME: accurate and versatile sequence motif discovery. Bioinformatics. 10.1093/bioinformatics/btab203. 37:18. (2834-2840). Online publication date: 29-Sep-2021.

    https://academic.oup.com/bioinformatics/article/37/18/2834/6184861

  • Körber M, Glombiewski N and Seeger B. Index-Accelerated Pattern Matching in Event Stores. Proceedings of the 2021 International Conference on Management of Data. (1023-1036).

    https://doi.org/10.1145/3448016.3457245

  • Berger B, Waterman M and Yu Y. Levenshtein Distance, Sequence Comparison and Biological Database Search. IEEE Transactions on Information Theory. 10.1109/TIT.2020.2996543. 67:6. (3287-3294).

    https://ieeexplore.ieee.org/document/9097943/

  • Koponen H, Mhaskar N and Smyth W. (2021). An Overview of String Processing Applications to Data Analytics 2021 Reconciling Data Analytics, Automation, Privacy, and Security: A Big Data Challenge (RDAAPS). 10.1109/RDAAPS48126.2021.9452004. 978-1-7281-6937-8. (1-8).

    https://ieeexplore.ieee.org/document/9452004/

  • AbuHassan A, Alshayeb M and Ghouti L. (2021). Software smell detection techniques. Journal of Software: Evolution and Process. 33:3. Online publication date: 3-Mar-2021.

    https://doi.org/10.1002/smr.2320

  • Chen Y and Nguyen H. (2021). On the string matching with k differences in DNA databases. Proceedings of the VLDB Endowment. 14:6. (903-915). Online publication date: 1-Feb-2021.

    https://doi.org/10.14778/3447689.3447695

  • Wang H, Zang Y, Liang F, Dong Z, Fan H and Yang B. (2021). A Probabilistic Method for Fractured Cultural Relics Automatic Reassembly. Journal on Computing and Cultural Heritage . 14:1. (1-25). Online publication date: 1-Feb-2021.

    https://doi.org/10.1145/3417711

  • Bordalo R, Bottaini C and Candeias A. (2020). A Framework Design for Information Management in Heritage Science Laboratories. Journal on Computing and Cultural Heritage . 14:1. (1-14). Online publication date: 1-Feb-2021.

    https://doi.org/10.1145/3417304

  • Christiansen A, Ettienne M, Kociumaka T, Navarro G and Prezza N. (2020). Optimal-Time Dictionary-Compressed Indexes. ACM Transactions on Algorithms. 17:1. (1-39). Online publication date: 31-Jan-2021.

    https://doi.org/10.1145/3426473

  • Huo H, Long P and Vitter J. Practical High-order Entropy-compressed Text Self-indexing. IEEE Transactions on Knowledge and Data Engineering. 10.1109/TKDE.2021.3114401. (1-1).

    https://ieeexplore.ieee.org/document/9546630/

  • Amir A and Kondratovsky E. (2021). Towards a real time algorithm for parameterized longest common prefix computation. Theoretical Computer Science. 10.1016/j.tcs.2020.11.023. 852. (132-137). Online publication date: 1-Jan-2021.

    https://linkinghub.elsevier.com/retrieve/pii/S0304397520306642

  • Park S, Bataa M, Amir A, Landau G and Park K. (2020). Finding patterns and periods in Cartesian tree matching. Theoretical Computer Science. 10.1016/j.tcs.2020.09.014. 845. (181-197). Online publication date: 1-Dec-2020.

    https://linkinghub.elsevier.com/retrieve/pii/S0304397520305132

  • Bannai H, Gagie T, Hoppenworth G, Puglisi S and Russo L. (2020). More Time-Space Tradeoffs for Finding a Shortest Unique Substring. Algorithms. 10.3390/a13090234. 13:9. (234).

    https://www.mdpi.com/1999-4893/13/9/234

  • Das A and Baruri R. (2020). All Pairs Suffix-Prefix Matches using Enhanced Suffix Array 2020 International Conference on Smart Electronics and Communication (ICOSEC). 10.1109/ICOSEC49089.2020.9215350. 978-1-7281-5461-9. (815-822).

    https://ieeexplore.ieee.org/document/9215350/

  • Iliopoulos C, Kundu R and Pissis S. (2020). Efficient pattern matching in elastic-degenerate strings. Information and Computation. 10.1016/j.ic.2020.104616. (104616). Online publication date: 1-Aug-2020.

    https://linkinghub.elsevier.com/retrieve/pii/S0890540120301048

  • Zou J and Kanoulas E. (2020). Towards Question-based High-recall Information Retrieval. ACM Transactions on Information Systems. 38:3. (1-35). Online publication date: 31-Jul-2020.

    https://doi.org/10.1145/3388640

  • Alpay B, Demetci P, Istrail S and Aguiar D. (2020). Combinatorial and statistical prediction of gene expression from haplotype sequence. Bioinformatics. 10.1093/bioinformatics/btaa318. 36:Supplement_1. (i194-i202). Online publication date: 1-Jul-2020.

    https://academic.oup.com/bioinformatics/article/36/Supplement_1/i194/5870481

  • Prezza N and Rosone G. Faster Online Computation of the Succinct Longest Previous Factor Array. Beyond the Horizon of Computability. (339-352).

    https://doi.org/10.1007/978-3-030-51466-2_31

  • Elsworth S and Güttel S. (2020). ABBA: adaptive Brownian bridge-based symbolic aggregation of time series. Data Mining and Knowledge Discovery. 10.1007/s10618-020-00689-6.

    http://link.springer.com/10.1007/s10618-020-00689-6

  • Chockalingam S, Thankachan S and Aluru S. (2020). Sequential and parallel algorithms for all-pair -mismatch maximal common substrings . Journal of Parallel and Distributed Computing. 10.1016/j.jpdc.2020.05.018. Online publication date: 1-Jun-2020.

    https://linkinghub.elsevier.com/retrieve/pii/S0743731520302975

  • Damiano R, Patti V, Clavel C and Rosso P. (2020). Introduction to the Special Section on Computational Modeling and Understanding of Emotions in Conflictual Social Interactions. ACM Transactions on Internet Technology. 20:2. (1-5). Online publication date: 31-May-2020.

    https://doi.org/10.1145/3392334

  • Tsigkanos C, Garriga M, Baresi L and Ghezzi C. (2020). Cloud Deployment Tradeoffs for the Analysis of Spatially Distributed Internet of Things Systems. ACM Transactions on Internet Technology. 20:2. (1-23). Online publication date: 31-May-2020.

    https://doi.org/10.1145/3381452

  • Jiang X, Lora M and Chattopadhyay S. (2020). An Experimental Analysis of Security Vulnerabilities in Industrial IoT Devices. ACM Transactions on Internet Technology. 20:2. (1-24). Online publication date: 31-May-2020.

    https://doi.org/10.1145/3379542

  • Pal A and Kant K. (2020). Exploiting Proxy Sensing for Efficient Monitoring of Large-Scale Sensor Networks. ACM Transactions on Internet Technology. 20:2. (1-31). Online publication date: 31-May-2020.

    https://doi.org/10.1145/3376919

  • Gobonamang T and Mpoeleng D. (2020). Counter based suffix tree for DNA pattern repeats. Theoretical Computer Science. 814:C. (1-12). Online publication date: 24-Apr-2020.

    https://doi.org/10.1016/j.tcs.2019.12.014

  • Møller N, Bossen C, Pine K, Nielsen T and Neff G. (2020). Who does the work of data?. Interactions. 27:3. (52-55). Online publication date: 17-Apr-2020.

    https://doi.org/10.1145/3386389

  • Taylor J and Sherman S. (2020). Designing a design-a-hack-a-thon. Interactions. 27:3. (56-60). Online publication date: 17-Apr-2020.

    https://doi.org/10.1145/3386387

  • Walker A and Cerny T. (2020). On cloud computing infrastructure for existing code-clone detection algorithms. ACM SIGAPP Applied Computing Review. 20:1. (5-14). Online publication date: 2-Apr-2020.

    https://doi.org/10.1145/3392350.3392351

  • Lee L, Braud T, Lam K, Yau Y and Hui P. (2020). From seen to unseen: Designing keyboard-less interfaces for text entry on the constrained screen real estate of Augmented Reality headsets. Pervasive and Mobile Computing. 10.1016/j.pmcj.2020.101148. 64. (101148). Online publication date: 1-Apr-2020.

    https://linkinghub.elsevier.com/retrieve/pii/S1574119220300365

  • Mendivelso J, Thankachan S and Pinzón Y. (2022). A brief history of parameterized matching problems. Discrete Applied Mathematics. 274:C. (103-115). Online publication date: 15-Mar-2020.

    https://doi.org/10.1016/j.dam.2018.07.017

  • Li R, Ruan S, Bao J, Li Y, Wu Y, Hong L and Zheng Y. Efficient Path Query Processing Over Massive Trajectories on the Cloud. IEEE Transactions on Big Data. 10.1109/TBDATA.2018.2868936. 6:1. (66-79).

    https://ieeexplore.ieee.org/document/8454749/

  • Lachmann A, Clarke D, Torre D, Xie Z and Ma'ayan A. (2020). Interoperable RNA-Seq analysis in the cloud. Biochimica et Biophysica Acta (BBA) - Gene Regulatory Mechanisms. 10.1016/j.bbagrm.2020.194521. (194521). Online publication date: 1-Mar-2020.

    https://linkinghub.elsevier.com/retrieve/pii/S1874939919300501

  • Gagie T, Navarro G and Prezza N. (2020). Fully Functional Suffix Trees and Optimal Text Searching in BWT-Runs Bounded Space. Journal of the ACM. 67:1. (1-54). Online publication date: 29-Feb-2020.

    https://doi.org/10.1145/3375890

  • Ciaccia P, Martinenghi D and Torlone R. (2020). Foundations of Context-aware Preference Propagation. Journal of the ACM. 67:1. (1-43). Online publication date: 29-Feb-2020.

    https://doi.org/10.1145/3375713

  • Munro J, Navarro G and Nekrich Y. (2020). Fast Compressed Self-indexes with Deterministic Linear-Time Construction. Algorithmica. 82:2. (316-337). Online publication date: 1-Feb-2020.

    https://doi.org/10.1007/s00453-019-00637-x

  • Roy P, Banerjee A, Wille R and Bhattacharya B. (2019). Harnessing the Granularity of Micro-Electrode-Dot-Array Architectures for Optimizing Droplet Routing in Biochips. ACM Transactions on Design Automation of Electronic Systems. 25:1. (1-37). Online publication date: 29-Jan-2020.

    https://doi.org/10.1145/3365993

  • Goswami D, Sultana N and Ruheen Bristi W. (2020). Algorithms for String Comparison in DNA Sequences. Proceedings of International Joint Conference on Computational Intelligence. 10.1007/978-981-13-7564-4_29. (327-343).

    https://link.springer.com/10.1007/978-981-13-7564-4_29

  • Soukehal S, Chibane K and Khadir M. (2019). Suffix Tree Construction based Mapreduce 2019 International Conference on Theoretical and Applicative Aspects of Computer Science (ICTAACS). 10.1109/ICTAACS48474.2019.8988123. 978-1-7281-6633-9. (1-6).

    https://ieeexplore.ieee.org/document/8988123/

  • Shibuya T. (2019). Application-Oriented Succinct Data Structures for Big Data. The Review of Socionetwork Strategies. 10.1007/s12626-019-00045-1.

    http://link.springer.com/10.1007/s12626-019-00045-1

  • Cáceres M and Navarro G. Faster Repetition-Aware Compressed Suffix Trees Based on Block Trees. String Processing and Information Retrieval. (434-451).

    https://doi.org/10.1007/978-3-030-32686-9_31

  • Luburić N, Sladić G, Slivka J and Milosavljević B. (2019). A Framework for Teaching Security Design Analysis Using Case Studies and the Hybrid Flipped Classroom. ACM Transactions on Computing Education. 19:3. (1-19). Online publication date: 30-Sep-2019.

    https://doi.org/10.1145/3289238

  • Zhu G, Guo C, Lu L, Huang Z, Yuan C, Gu R and Huang Y. (2019). DGST. Parallel Computing. 87:C. (87-102). Online publication date: 1-Sep-2019.

    https://doi.org/10.1016/j.parco.2019.06.002

  • Cazaux B, Lecroq T and Rivals E. (2019). Linking indexing data structures to de Bruijn graphs. Journal of Computer and System Sciences. 104:C. (165-183). Online publication date: 1-Sep-2019.

    https://doi.org/10.1016/j.jcss.2016.06.008

  • Wang Z, Zhang Y, Tian Z, Ruan Q, Liu T, Wang H, Liu Z, Lin J, Fang B and Shi W. (2019). Automated Vulnerability Discovery and Exploitation in the Internet of Things. Sensors. 10.3390/s19153362. 19:15. (3362).

    https://www.mdpi.com/1424-8220/19/15/3362

  • Sinha S and Weinstein O. Local decodability of the Burrows-Wheeler transform. Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing. (744-755).

    https://doi.org/10.1145/3313276.3316317

  • Zhang Y, Liu T, Wang Z, Ruan Q and Fang B. (2019). AutoDE: Automated Vulnerability Discovery and Exploitation 2019 IEEE Fourth International Conference on Data Science in Cyberspace (DSC). 10.1109/DSC.2019.00016. 978-1-7281-4528-0. (46-53).

    https://ieeexplore.ieee.org/document/8923419/

  • Fujisato N, Nakashima Y, Inenaga S, Bannai H and Takeda M. The Parameterized Position Heap of a Trie. Algorithms and Complexity. (237-248).

    https://doi.org/10.1007/978-3-030-17402-6_20

  • Manoussakis G. (2019). A new decomposition technique for maximal clique enumeration for sparse graphs. Theoretical Computer Science. 770:C. (25-33). Online publication date: 24-May-2019.

    https://doi.org/10.1016/j.tcs.2018.10.014

  • Vineetha V, Biji C and Nair A. (2019). SPARK-MSNA: Efficient algorithm on Apache Spark for aligning multiple similar DNA/RNA sequences with supervised learning. Scientific Reports. 10.1038/s41598-019-42966-5. 9:1.

    https://www.nature.com/articles/s41598-019-42966-5

  • Navarrete-López C, Herrera M, Brentan B, Luvizotto E and Izquierdo J. (2019). Enhanced Water Demand Analysis via Symbolic Approximation within an Epidemiology-Based Forecasting Framework. Water. 10.3390/w11020246. 11:2. (246).

    https://www.mdpi.com/2073-4441/11/2/246

  • Oktaviani D, Bijaksana M and Asror I. (2019). Building a Database of Recurring Text in the Quran and its Translation. Procedia Computer Science. 10.1016/j.procs.2019.08.149. 157. (125-133).

    https://linkinghub.elsevier.com/retrieve/pii/S1877050919310671

  • Ajala O, Alshammary M, Alzamel M, Gao J, Iliopoulos C, Radoszewski J, Rytter W and Watson B. (2019). On the Cyclic Regularities of Strings. Artificial Intelligence Applications and Innovations. 10.1007/978-3-030-19909-8_19. (219-224).

    https://link.springer.com/10.1007/978-3-030-19909-8_19

  • Nita S and Mihailescu M. (2019). A Hybrid Searchable Encryption Scheme for Cloud Computing. Innovative Security Solutions for Information Technology and Communications. 10.1007/978-3-030-12942-2_8. (85-96).

    http://link.springer.com/10.1007/978-3-030-12942-2_8

  • Maier T, Sanders P and Dementiev R. (2019). Concurrent Hash Tables. ACM Transactions on Parallel Computing. 5:4. (1-32). Online publication date: 31-Dec-2019.

    https://doi.org/10.1145/3309206

  • Kang J, Kim Y, Song Y, Lee J, Park S, Shin M, Kim Y, Cho S, Choi J, Hur C and Yi K. (2018). Crellvm: verified credible compilation for LLVM. ACM SIGPLAN Notices. 53:4. (631-645). Online publication date: 2-Dec-2018.

    https://doi.org/10.1145/3296979.3192377

  • Ottoni G. (2018). HHVM JIT: a profile-guided, region-based compiler for PHP and Hack. ACM SIGPLAN Notices. 53:4. (151-165). Online publication date: 2-Dec-2018.

    https://doi.org/10.1145/3296979.3192374

  • Liu N, Xie F and Wu X. (2018). Multi-pattern matching with variable-length wildcards using suffix tree. Pattern Analysis & Applications. 21:4. (1151-1165). Online publication date: 1-Nov-2018.

    /doi/10.5555/3288219.3288244

  • Liu N, Xie F and Wu X. (2018). Multi-pattern matching with variable-length wildcards using suffix tree. Pattern Analysis and Applications. 10.1007/s10044-018-0733-0. 21:4. (1151-1165). Online publication date: 1-Nov-2018.

    http://link.springer.com/10.1007/s10044-018-0733-0

  • Brodnik A and Jekovec M. (2018). Sliding Suffix Tree. Algorithms. 10.3390/a11080118. 11:8. (118).

    https://www.mdpi.com/1999-4893/11/8/118

  • Leontiadis I and Li M. Storage Efficient Substring Searchable Symmetric Encryption. Proceedings of the 6th International Workshop on Security in Cloud Computing. (3-13).

    https://doi.org/10.1145/3201595.3201598

  • Chen Y and Wu Y. (2018). On the string matching with k mismatches. Theoretical Computer Science. 10.1016/j.tcs.2018.02.001. 726. (5-29). Online publication date: 1-May-2018.

    https://linkinghub.elsevier.com/retrieve/pii/S0304397518300781

  • Huo H, Chen X, Zhao Y, Zhu X and Vitter J. (2018). Practical Succinct Text Indexes in External Memory 2018 Data Compression Conference (DCC). 10.1109/DCC.2018.00030. 978-1-5386-4883-4. (217-226).

    https://ieeexplore.ieee.org/document/8416594/

  • Grossi R, Menconi G, Pisanti N, Trani R and Vind S. (2018). Motif trie: An efficient text index for pattern discovery with don't cares. Theoretical Computer Science. 10.1016/j.tcs.2017.04.012. 710. (74-87). Online publication date: 1-Feb-2018.

    https://linkinghub.elsevier.com/retrieve/pii/S0304397517303523

  • Gagie T, Navarro G and Prezza N. Optimal-time text indexing in BWT-runs bounded space. Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms. (1459-1477).

    /doi/10.5555/3174304.3175401

  • Chen Y and Wu Y. (2018). BWT: An Index Structure to Speed-Up Both Exact and Inexact String Matching. Big Data in Engineering Applications. 10.1007/978-981-10-8476-8_12. (221-264).

    http://link.springer.com/10.1007/978-981-10-8476-8_12

  • Chauvin B, Clément J and Gardy D. (2018). Arbres, algorithmes et données. Arbres pour l’Algorithmique. 10.1007/978-3-319-93725-0_3. (61-117).

    http://link.springer.com/10.1007/978-3-319-93725-0_3

  • Thankachan S, Aluru C, Chockalingam S and Aluru S. (2018). Algorithmic Framework for Approximate Matching Under Bounded Edits with Applications to Sequence Analysis. Research in Computational Molecular Biology. 10.1007/978-3-319-89929-9_14. (211-224).

    https://link.springer.com/10.1007/978-3-319-89929-9_14

  • Hu R and Yang Y. (2018). Spam Mail Filtering Method Based on Suffix Tree. Advances in Internetworking, Data & Web Technologies. 10.1007/978-3-319-59463-7_43. (436-447).

    http://link.springer.com/10.1007/978-3-319-59463-7_43

  • Li Z, Li J and Huo H. (2018). Optimal In-Place Suffix Sorting. String Processing and Information Retrieval. 10.1007/978-3-030-00479-8_22. (268-284).

    http://link.springer.com/10.1007/978-3-030-00479-8_22

  • Amir A and Kondratovsky E. (2018). Searching for a Modified Pattern in a Changing Text. String Processing and Information Retrieval. 10.1007/978-3-030-00479-8_20. (241-253).

    http://link.springer.com/10.1007/978-3-030-00479-8_20

  • Alzamel M, Charalampopoulos P, Iliopoulos C, Kociumaka T, Pissis S, Radoszewski J and Straszyński J. (2018). Efficient Computation of Sequence Mappability. String Processing and Information Retrieval. 10.1007/978-3-030-00479-8_2. (12-26).

    http://link.springer.com/10.1007/978-3-030-00479-8_2

  • Kahveci T. (2018). Index Structures for Biological Sequences. Encyclopedia of Database Systems. 10.1007/978-1-4614-8265-9_1434. (1845-1850).

    http://link.springer.com/10.1007/978-1-4614-8265-9_1434

  • Crochemore M and Lecroq T. (2018). Suffix Tree. Encyclopedia of Database Systems. 10.1007/978-1-4614-8265-9_1142. (3839-3843).

    http://link.springer.com/10.1007/978-1-4614-8265-9_1142

  • Tiwari V and Arya A. (2017). Horizontally scalable probabilistic generalized suffix tree (PGST) based route prediction using map data and GPS traces. Journal of Big Data. 10.1186/s40537-017-0085-4. 4:1. Online publication date: 1-Dec-2017.

    http://journalofbigdata.springeropen.com/articles/10.1186/s40537-017-0085-4

  • Esplà-Gomis M, Carrasco R, Sánchez-Cartagena V, Forcada M, Sánchez-Martínez F and Pérez-Ortiz J. (2017). Assisting non-expert speakers of under-resourced languages in assigning stems and inflectional paradigms to new word entries of morphological dictionaries. Language Resources and Evaluation. 51:4. (989-1017). Online publication date: 1-Dec-2017.

    https://doi.org/10.1007/s10579-016-9360-9

  • Ganguly A, Hon W, Shah R and Thankachan S. (2017). Spacetime trade-offs for finding shortest unique substrings and maximal unique matches. Theoretical Computer Science. 700:C. (75-88). Online publication date: 14-Nov-2017.

    https://doi.org/10.1016/j.tcs.2017.08.002

  • Li R, Ruan S, Bao J, Li Y, Wu Y and Zheng Y. Querying Massive Trajectories by Path on the Cloud. Proceedings of the 25th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems. (1-4).

    https://doi.org/10.1145/3139958.3139996

  • Das A, Kundu S and Baruri R. (2017). Structures for generating admissible grammar case of longest repeat first substitution 2017 International Conference on Inventive Computing and Informatics (ICICI). 10.1109/ICICI.2017.8365374. 978-1-5386-4031-9. (362-366).

    https://ieeexplore.ieee.org/document/8365374/

  • Chen Y and Wu Y. (2017). Searching BWT against Pattern Matching Machine to Find Multiple String Matches 2017 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery (CyberC). 10.1109/CyberC.2017.26. 978-1-5386-2209-4. (167-176).

    http://ieeexplore.ieee.org/document/8250354/

  • Narisawa K, Hiratsuka H, Inenaga S, Bannai H and Takeda M. (2017). Efficient Computation of Substring Equivalence Classes with Suffix Arrays. Algorithmica. 79:2. (291-318). Online publication date: 1-Oct-2017.

    https://doi.org/10.1007/s00453-016-0178-z

  • Biswas S, Ku T, Shah R and Thankachan S. (2017). Position-restricted substring searching over small alphabets. Journal of Discrete Algorithms. 10.1016/j.jda.2017.10.001. 46-47. (36-39). Online publication date: 1-Sep-2017.

    https://linkinghub.elsevier.com/retrieve/pii/S1570866717300618

  • Ju C, Li R, Wu Z, Jiang J, Yang Z and Wang W. Fleximer. Proceedings of the 8th ACM International Conference on Bioinformatics, Computational Biology,and Health Informatics. (263-272).

    https://doi.org/10.1145/3107411.3107444

  • References. Shared-Memory Parallelism Can Be Simple, Fast, and Scalable.

    https://doi.org/10.1145/3018787.3018804

  • Conclusion and Future Work. Shared-Memory Parallelism Can Be Simple, Fast, and Scalable.

    https://doi.org/10.1145/3018787.3018803

  • Parallel Wavelet Tree Construction. Shared-Memory Parallelism Can Be Simple, Fast, and Scalable.

    https://doi.org/10.1145/3018787.3018802

  • Parallel Lempel-Ziv Factorization. Shared-Memory Parallelism Can Be Simple, Fast, and Scalable.

    https://doi.org/10.1145/3018787.3018801

  • Parallel Computation of Longest Common Prefixes. Shared-Memory Parallelism Can Be Simple, Fast, and Scalable.

    https://doi.org/10.1145/3018787.3018800

  • Parallel Cartesian Tree and Suffix Tree Construction. Shared-Memory Parallelism Can Be Simple, Fast, and Scalable.

    https://doi.org/10.1145/3018787.3018799

  • Parallel and Cache-Oblivious Triangle Computations. Shared-Memory Parallelism Can Be Simple, Fast, and Scalable.

    https://doi.org/10.1145/3018787.3018798

  • Linear-Work Parallel Graph Connectivity. Shared-Memory Parallelism Can Be Simple, Fast, and Scalable.

    https://doi.org/10.1145/3018787.3018797

  • Ligra+: Adding Compression to Ligra. Shared-Memory Parallelism Can Be Simple, Fast, and Scalable.

    https://doi.org/10.1145/3018787.3018796

  • Ligra: A Lightweight Graph Processing Framework for Shared Memory. Shared-Memory Parallelism Can Be Simple, Fast, and Scalable.

    https://doi.org/10.1145/3018787.3018795

  • Priority Updates: A Contention-Reducing Primitive for Deterministic Programming. Shared-Memory Parallelism Can Be Simple, Fast, and Scalable.

    https://doi.org/10.1145/3018787.3018794

  • A Deterministic Phase-Concurrent Parallel Hash Table. Shared-Memory Parallelism Can Be Simple, Fast, and Scalable.

    https://doi.org/10.1145/3018787.3018793

  • Deterministic Parallelism in Sequential Iterative Algorithms. Shared-Memory Parallelism Can Be Simple, Fast, and Scalable.

    https://doi.org/10.1145/3018787.3018792

  • Internally Deterministic Parallelism: Techniques and Algorithms. Shared-Memory Parallelism Can Be Simple, Fast, and Scalable.

    https://doi.org/10.1145/3018787.3018791

  • Preliminaries and Notation. Shared-Memory Parallelism Can Be Simple, Fast, and Scalable.

    https://doi.org/10.1145/3018787.3018790

  • Introduction. Shared-Memory Parallelism Can Be Simple, Fast, and Scalable.

    https://doi.org/10.1145/3018787.3018789

  • Preface. Shared-Memory Parallelism Can Be Simple, Fast, and Scalable.

    https://doi.org/10.1145/3018787.3018788

  • Kim J, Amir A, Na J, Park K and Sim J. (2017). On Representations of Ternary Order Relations in Numeric Strings. Mathematics in Computer Science. 10.1007/s11786-016-0282-0. 11:2. (127-136). Online publication date: 1-Jun-2017.

    http://link.springer.com/10.1007/s11786-016-0282-0

  • Canovas R and Rivals E. (2017). Full Compressed Affix Tree Representations 2017 Data Compression Conference (DCC). 10.1109/DCC.2017.39. 978-1-5090-6721-3. (102-111).

    http://ieeexplore.ieee.org/document/7921905/

  • CROCHEMORE M, ILIOPOULOS C, LANGIU A and MIGNOSI F. (2015). The longest common substring problem. Mathematical Structures in Computer Science. 10.1017/S0960129515000110. 27:2. (277-295). Online publication date: 1-Feb-2017.

    https://www.cambridge.org/core/product/identifier/S0960129515000110/type/journal_article

  • Ganea G, Verebi I and Marinescu R. (2017). Continuous quality assessment with inCode. Science of Computer Programming. 134:C. (19-36). Online publication date: 1-Feb-2017.

    https://doi.org/10.1016/j.scico.2015.02.007

  • Gawrychowski P and Kociumaka T. Sparse suffix tree construction in optimal time and space. Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms. (425-439).

    /doi/10.5555/3039686.3039713

  • Munro J, Navarro G and Nekrich Y. Space-efficient construction of compressed indexes in deterministic linear time. Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms. (408-424).

    /doi/10.5555/3039686.3039712

  • Franek F, F. Smyth W and Wang X. (2017). The Role of The Prefix Array in Sequence Analysis: A Survey. AIMS Medical Science. 10.3934/medsci.2017.3.261. 4:3. (261-273).

    http://www.aimspress.com/article/10.3934/medsci.2017.3.261

  • Navarro G and Nekrich Y. (2017). Time-Optimal Top-$k$ Document Retrieval. SIAM Journal on Computing. 46:1. (80-113). Online publication date: 1-Jan-2017.

    https://doi.org/10.1137/140998949

  • Kim M, Lee H, Ling S, Tan B and Wang H. Private Compound Wildcard Queries using Fully Homomorphic Encryption. IEEE Transactions on Dependable and Secure Computing. 10.1109/TDSC.2017.2763593. (1-1).

    http://ieeexplore.ieee.org/document/8070319/

  • Feigenblat G, Porat E and Shiftan A. (2017). A Grouping Approach for Succinct Dynamic Dictionary Matching. Algorithmica. 77:1. (134-150). Online publication date: 1-Jan-2017.

    https://doi.org/10.1007/s00453-015-0056-0

  • Weese D, Schulz M and Richard H. (2017). DNA-Seq Error Correction Based on Substring Indices. Algorithms for Next-Generation Sequencing Data. 10.1007/978-3-319-59826-0_7. (147-166).

    http://link.springer.com/10.1007/978-3-319-59826-0_7

  • Weese D and Siragusa E. (2017). Full-Text Indexes for High-Throughput Sequencing. Algorithms for Next-Generation Sequencing Data. 10.1007/978-3-319-59826-0_2. (41-75).

    http://link.springer.com/10.1007/978-3-319-59826-0_2

  • Fiscon G and Weitschek E. (2017). String-Matching and Alignment Algorithms for Finding Motifs in NGS Data. Algorithms for Next-Generation Sequencing Data. 10.1007/978-3-319-59826-0_11. (235-264).

    http://link.springer.com/10.1007/978-3-319-59826-0_11

  • Nsira N, Lecroq T and Elloumi M. (2017). Algorithms for Indexing Highly Similar DNA Sequences. Algorithms for Next-Generation Sequencing Data. 10.1007/978-3-319-59826-0_1. (3-39).

    http://link.springer.com/10.1007/978-3-319-59826-0_1

  • Iliopoulos C, Kundu R and Pissis S. (2017). Efficient Pattern Matching in Elastic-Degenerate Texts. Language and Automata Theory and Applications. 10.1007/978-3-319-53733-7_9. (131-142).

    http://link.springer.com/10.1007/978-3-319-53733-7_9

  • Reddy V, Kinnicutt P and Lee R. (2016). Text Document Clustering: The Application of Cluster Analysis to Textual Document 2016 International Conference on Computational Science and Computational Intelligence (CSCI). 10.1109/CSCI.2016.0222. 978-1-5090-5510-4. (1174-1179).

    http://ieeexplore.ieee.org/document/7881515/

  • Chockalingam S, Thankachan S and Aluru S. A parallel algorithm for finding all pairs k-mismatch maximal common substrings. Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis. (1-11).

    /doi/10.5555/3014904.3014994

  • Navarro G and Pereira A. (2016). Faster Compressed Suffix Trees for Repetitive Collections. ACM Journal of Experimental Algorithmics. 21. (1-38). Online publication date: 4-Nov-2016.

    https://doi.org/10.1145/2851495

  • Chockalingam S, Thankachan S and Aluru S. (2016). A Parallel Algorithm for Finding All Pairs κ-Mismatch Maximal Common Substrings SC16: International Conference for High Performance Computing, Networking, Storage and Analysis. 10.1109/SC.2016.66. 978-1-4673-8815-3. (784-794).

    http://ieeexplore.ieee.org/document/7877145/

  • Nagoudi E, Khorsi A and Cherroun H. (2016). Efficient inverted index with n-gram sampling for string matching in Arabic documents 2016 IEEE/ACS 13th International Conference of Computer Systems and Applications (AICCSA). 10.1109/AICCSA.2016.7945743. 978-1-5090-4320-0. (1-7).

    http://ieeexplore.ieee.org/document/7945743/

  • Ding S, Zhao S, Liao G and Lin T. (2016). WITHDRAWN: The new approach of multiple genome sequence parallel matching based on GPU. Computerized Medical Imaging and Graphics. 10.1016/j.compmedimag.2016.11.001. Online publication date: 1-Nov-2016.

    https://linkinghub.elsevier.com/retrieve/pii/S0895611116300994

  • Denzumi S, Yoshinaka R, Arimura H and Minato S. (2016). Sequence binary decision diagram. Discrete Applied Mathematics. 212:C. (61-80). Online publication date: 30-Oct-2016.

    https://doi.org/10.1016/j.dam.2014.11.022

  • Casey W and Shelmire A. (2016). Signature limits: an entire map of clone features and their discovery in nearly linear time 2016 11th International Conference on Malicious and Unwanted Software (MALWARE). 10.1109/MALWARE.2016.7888740. 978-1-5090-4542-6. (1-10).

    http://ieeexplore.ieee.org/document/7888740/

  • (2016). Texts. Compact Data Structures. 10.1017/CBO9781316588284.012. (395-449).

    https://www.cambridge.org/core/product/identifier/CBO9781316588284A088/type/book_part

  • Pickett B, Karlinsey S, Penrod C, Cormier M, Ebbert M, Shiozawa D, Whipple C and Ridge P. (2016). SA-SSR: a suffix array-based algorithm for exhaustive and efficient SSR discovery in large genetic sequences. Bioinformatics. 10.1093/bioinformatics/btw298. 32:17. (2707-2709). Online publication date: 1-Sep-2016.

    https://academic.oup.com/bioinformatics/article/32/17/2707/2450742

  • Azmi A. (2016). On Identifying Minimal Absent and Unique Words: An Efficient Scheme. Cognitive Computation. 10.1007/s12559-016-9385-9. 8:4. (603-613). Online publication date: 1-Aug-2016.

    https://link.springer.com/10.1007/s12559-016-9385-9

  • Crochemore M, Epifanio C, Grossi R and Mignosi F. (2016). Linear-size suffix tries. Theoretical Computer Science. 638:C. (171-178). Online publication date: 25-Jul-2016.

    https://doi.org/10.1016/j.tcs.2016.04.002

  • Kopelowitz T. (2016). The property suffix tree with dynamic properties. Theoretical Computer Science. 638:C. (44-51). Online publication date: 25-Jul-2016.

    https://doi.org/10.1016/j.tcs.2016.02.033

  • Wan C. (2016). Novel hierarchical feature selection algorithms for predicting genes' aging-related function. AI Matters. 2:3. (23-24). Online publication date: 21-Jun-2016.

    https://doi.org/10.1145/2911172.2911180

  • Koren O and Perel N. (2016). Contextual test. AI Matters. 2:3. (6-13). Online publication date: 21-Jun-2016.

    https://doi.org/10.1145/2911172.2911175

  • Thankachan S, Apostolico A and Aluru S. (2016). A Provably Efficient Algorithm for the k -Mismatch Average Common Substring Problem . Journal of Computational Biology. 10.1089/cmb.2015.0235. 23:6. (472-482). Online publication date: 1-Jun-2016.

    http://www.liebertpub.com/doi/10.1089/cmb.2015.0235

  • Azmi A. (2016). Identification of tandem repeats over large-alphabet inputs. Information Sciences: an International Journal. 345:C. (96-105). Online publication date: 1-Jun-2016.

    https://doi.org/10.1016/j.ins.2016.01.050

  • Apostolico A, Crochemore M, Farach-Colton M, Galil Z and Muthukrishnan S. (2016). 40 years of suffix trees. Communications of the ACM. 59:4. (66-73). Online publication date: 23-Mar-2016.

    https://doi.org/10.1145/2810036

  • Iliopoulos C, Kundu R and Mohamed M. (2016). Efficient Computation of Clustered-Clumps in Degenerate Strings. Artificial Intelligence Applications and Innovations. 10.1007/978-3-319-44944-9_45. (510-519).

    http://link.springer.com/10.1007/978-3-319-44944-9_45

  • Thankachan S, Chockalingam S and Aluru S. (2016). An Efficient Algorithm for Finding All Pairs k-Mismatch Maximal Common Substrings. Bioinformatics Research and Applications. 10.1007/978-3-319-38782-6_1. (3-14).

    http://link.springer.com/10.1007/978-3-319-38782-6_1

  • Apostolico A and Cunial F. (2016). Suffix Trees and Arrays. Encyclopedia of Algorithms. 10.1007/978-1-4939-2864-4_627. (2154-2162).

    http://link.springer.com/10.1007/978-1-4939-2864-4_627

  • Na J, Ferragina P, Giancarlo R and Park K. (2016). Indexed Two-Dimensional String Matching. Encyclopedia of Algorithms. 10.1007/978-1-4939-2864-4_442. (973-977).

    http://link.springer.com/10.1007/978-1-4939-2864-4_442

  • Stoye J. (2016). Suffix Tree Construction. Encyclopedia of Algorithms. 10.1007/978-1-4939-2864-4_414. (2144-2149).

    http://link.springer.com/10.1007/978-1-4939-2864-4_414

  • Lewenstein M. (2016). Parameterized Pattern Matching. Encyclopedia of Algorithms. 10.1007/978-1-4939-2864-4_282. (1525-1530).

    http://link.springer.com/10.1007/978-1-4939-2864-4_282

  • Kahveci T. (2016). Index Structures for Biological Sequences. Encyclopedia of Database Systems. 10.1007/978-1-4899-7993-3_1434-2. (1-6).

    https://link.springer.com/10.1007/978-1-4899-7993-3_1434-2

  • Al-Okaily A. (2015). Error Tree: A Tree Structure for Hamming and Edit Distances and Wildcards Matching. Journal of Computational Biology. 10.1089/cmb.2015.0132. 22:12. (1118-1128). Online publication date: 1-Dec-2015.

    http://www.liebertpub.com/doi/10.1089/cmb.2015.0132

  • Kaes G and Rinderle-Ma S. Mining and Querying Process Change Information Based on Change Trees. Service-Oriented Computing. (269-284).

    https://doi.org/10.1007/978-3-662-48616-0_17

  • Do P and Kim S. A new approach to the edit distance with block swaps using DAWG. Proceedings of the 2015 Conference on research in adaptive and convergent systems. (21-26).

    https://doi.org/10.1145/2811411.2811474

  • Akella A. (2015). ACM SIGCOMM Student Mentoring Column. ACM SIGCOMM Computer Communication Review. 45:5. (43-44). Online publication date: 30-Sep-2015.

    https://doi.org/10.1145/2831347.2831355

  • Shirali-Shahreza S and Ganjali Y. (2015). ReWiFlow. ACM SIGCOMM Computer Communication Review. 45:5. (29-35). Online publication date: 30-Sep-2015.

    https://doi.org/10.1145/2831347.2831352

  • Sarlis D, Papailiou N, Konstantinou I, Smaragdakis G and Koziris N. (2015). Datix. ACM SIGCOMM Computer Communication Review. 45:5. (21-28). Online publication date: 30-Sep-2015.

    https://doi.org/10.1145/2831347.2831351

  • van Rijswijk-Deij R, Sperotto A and Pras A. (2015). Making the Case for Elliptic Curves in DNSSEC. ACM SIGCOMM Computer Communication Review. 45:5. (13-19). Online publication date: 30-Sep-2015.

    https://doi.org/10.1145/2831347.2831350

  • Metwalley H, Traverso S, Mellia M, Miskovic S and Baldi M. (2015). CrowdSurf. ACM SIGCOMM Computer Communication Review. 45:5. (5-12). Online publication date: 30-Sep-2015.

    https://doi.org/10.1145/2831347.2831349

  • Vitale L, Martín Á and Seroussi G. (2015). Space-efficient representation of truncated suffix trees, with applications to Markov order estimation. Theoretical Computer Science. 595:C. (34-45). Online publication date: 30-Aug-2015.

    https://doi.org/10.1016/j.tcs.2015.06.013

  • Biswas S, Patil M, Shah R and Thankachan S. (2015). Succinct indexes for reporting discriminating and generic words. Theoretical Computer Science. 593:C. (165-173). Online publication date: 16-Aug-2015.

    https://doi.org/10.1016/j.tcs.2015.06.007

  • Amir A, Levy A, Porat E and Shalom B. (2015). Dictionary matching with a few gaps. Theoretical Computer Science. 589:C. (34-46). Online publication date: 19-Jul-2015.

    https://doi.org/10.1016/j.tcs.2015.04.011

  • Belazzougui D. (2015). Improved Space-Time Tradeoffs for Approximate Full-Text Indexing with One Edit Error. Algorithmica. 72:3. (791-817). Online publication date: 1-Jul-2015.

    https://doi.org/10.1007/s00453-014-9873-9

  • Hon W, Ku T, Lam T, Shah R, Tam S, Thankachan S and Vitter J. (2015). Compressing Dictionary Matching Index via Sparsification Technique. Algorithmica. 72:2. (515-538). Online publication date: 1-Jun-2015.

    https://doi.org/10.1007/s00453-013-9863-3

  • Cole R, Kopelowitz T and Lewenstein M. (2015). Suffix Trays and Suffix Trists. Algorithmica. 72:2. (450-466). Online publication date: 1-Jun-2015.

    https://doi.org/10.1007/s00453-013-9860-6

  • Banerjee T and Sahni S. (2015). Pubsub: An Efficient Publish/Subscribe System. IEEE Transactions on Computers. 64:4. (1119-1132). Online publication date: 1-Apr-2015.

    https://doi.org/10.1109/TC.2014.2315636

  • González R, Navarro G and Ferrada H. (2015). Locally Compressed Suffix Arrays. ACM Journal of Experimental Algorithmics. 19. (1.1-1.30). Online publication date: 3-Feb-2015.

    https://doi.org/10.1145/2594408

  • Xu Z, Cheng K, Ding Y, Tian Z and Zhao H. (2015). A Multiple Genome Sequence Matching Based on Skipping Tree. International Journal of Machine Learning and Computing. 10.7763/IJMLC.2015.V5.487. 5:1. (78-85).

    http://www.ijmlc.org/index.php?m=content&c=index&a=show&catid=49&id=542

  • Jin Z, Huang Z and Zhang H. (2015). Suffix Tree Constructing Algorithm for Datasets with Discrete Contents. Applied Mechanics and Materials. 10.4028/www.scientific.net/AMM.733.867. 733. (867-870).

    https://www.scientific.net/AMM.733.867

  • Chien Y, Hon W, Shah R, Thankachan S and Vitter J. (2015). Geometric BWT. Algorithmica. 71:2. (258-278). Online publication date: 1-Feb-2015.

    https://doi.org/10.1007/s00453-013-9792-1

  • Huo H, Chen L, Zhao H, Vitter J, Nekrich Y and Yu Q. A data-aware FM-index. Proceedings of the Meeting on Algorithm Engineering & Expermiments. (10-23).

    /doi/10.5555/2789813.2789815

  • Tiwary B. (2015). Next-Generation Sequencing and Assembly of Plant Genomes. PlantOmics: The Omics of Plant Science. 10.1007/978-81-322-2172-2_3. (53-64).

    http://link.springer.com/10.1007/978-81-322-2172-2_3

  • Zhang J, Ma X, Li W and Jin Q. (2015). Social Network Recommendation Based on Hybrid Suffix Tree Clustering. Computer Science and its Applications. 10.1007/978-3-662-45402-2_8. (47-53).

    https://link.springer.com/10.1007/978-3-662-45402-2_8

  • Erciyes K. (2015). String Algorithms. Distributed and Sequential Algorithms for Bioinformatics. 10.1007/978-3-319-24966-7_5. (81-110).

    http://link.springer.com/10.1007/978-3-319-24966-7_5

  • Han A and Nickerson B. (2015). Efficient Combined Text and Spatial Search. Computational Science and Its Applications -- ICCSA 2015. 10.1007/978-3-319-21470-2_52. (713-728).

    http://link.springer.com/10.1007/978-3-319-21470-2_52

  • Fischer J and Gawrychowski P. (2015). Alphabet-Dependent String Searching with Wexponential Search Trees. Combinatorial Pattern Matching. 10.1007/978-3-319-19929-0_14. (160-171).

    https://link.springer.com/10.1007/978-3-319-19929-0_14

  • Jiang T, Li Z, Chen Q, Li K, Wang Z and Pan W. (2015). Towards Order-Preserving SubMatrix Search and Indexing. Database Systems for Advanced Applications. 10.1007/978-3-319-18123-3_19. (309-326).

    https://link.springer.com/10.1007/978-3-319-18123-3_19

  • Aluru S, Apostolico A and Thankachan S. (2015). Efficient Alignment Free Sequence Comparison with Bounded Mismatches. Research in Computational Molecular Biology. 10.1007/978-3-319-16706-0_1. (1-12).

    https://link.springer.com/10.1007/978-3-319-16706-0_1

  • Cazaux B, Lecroq T and Rivals E. (2015). Construction of a de Bruijn Graph for Assembly from a Truncated Suffix Tree. Language and Automata Theory and Applications. 10.1007/978-3-319-15579-1_8. (109-120).

    https://link.springer.com/10.1007/978-3-319-15579-1_8

  • Choi H, Jung Y and Kim S. (2014). An Efficient Suffix Tree Reconstructing Algorithm for Biological Sequence Analysis. Journal of Digital Convergence. 10.14400/JDC.2014.12.12.265. 12:12. (265-275). Online publication date: 28-Dec-2015.

    http://koreascience.or.kr/journal/view.jsp?kj=DJTJBT&py=2014&vnc=v12n12&sp=265

  • (2014). Bibliography. Fundamentals of Database Indexing and Searching. 10.1201/b17767-23. (235-245). Online publication date: 4-Dec-2014.

    http://www.crcnetbase.com/doi/abs/10.1201/b17767-23

  • Satish U, Kondikoppa P, Park S, Patil M and Shah R. (2014). MapReduce based parallel suffix tree construction for human genome 2014 20th IEEE International Conference on Parallel and Distributed Systems (ICPADS). 10.1109/PADSW.2014.7097867. 978-1-4799-7615-7. (664-670).

    http://ieeexplore.ieee.org/document/7097867/

  • Krogh B, Pelekis N, Theodoridis Y and Torp K. Path-based queries on trajectory data. Proceedings of the 22nd ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems. (341-350).

    https://doi.org/10.1145/2666310.2666413

  • Amir A, Apostolico A, Landau G, Levy A, Lewenstein M and Porat E. (2014). Range LCP. Journal of Computer and System Sciences. 10.1016/j.jcss.2014.02.010. 80:7. (1245-1253). Online publication date: 1-Nov-2014.

    https://linkinghub.elsevier.com/retrieve/pii/S0022000014000221

  • Ikeda D and Suzuki E. (2014). Finding peculiar compositions of two frequent strings with background texts. Knowledge and Information Systems. 41:2. (499-530). Online publication date: 1-Nov-2014.

    https://doi.org/10.1007/s10115-013-0688-9

  • Biswas S, Patil M, Shah R and Thankachan S. Succinct Indexes for Reporting Discriminating and Generic Words. Proceedings of the 21st International Symposium on String Processing and Information Retrieval - Volume 8799. (89-100).

    https://doi.org/10.1007/978-3-319-11918-2_9

  • Shun J and Blelloch G. (2014). A simple parallel cartesian tree algorithm and its application to parallel suffix tree construction. ACM Transactions on Parallel Computing. 1:1. (1-20). Online publication date: 3-Oct-2014.

    https://doi.org/10.1145/2661653

  • Xylogiannopoulos K, Karampelas P and Alhajj R. (2014). Analyzing very large time series using suffix arrays. Applied Intelligence. 41:3. (941-955). Online publication date: 1-Oct-2014.

    https://doi.org/10.1007/s10489-014-0553-x

  • Falah T, Ghnimi M and Elloumi M. A Consensus Algorithm for Simple Motifs Finding. Proceedings of the 2014 International Semiconductor Laser Conference. (33-37).

    https://doi.org/10.1109/DEXA.2014.24

  • Cazaux B and Rivals E. (2014). Reverse engineering of compact suffix trees and links. Journal of Discrete Algorithms. 28:C. (9-22). Online publication date: 1-Sep-2014.

    https://doi.org/10.1016/j.jda.2014.07.002

  • Gudmundsson J and Wolle T. (2014). Football analysis using spatio-temporal tools. Computers, Environment and Urban Systems. 10.1016/j.compenvurbsys.2013.09.004. 47. (16-27). Online publication date: 1-Sep-2014.

    https://linkinghub.elsevier.com/retrieve/pii/S0198971513000847

  • Belazzougui D and Navarro G. (2014). Alphabet-Independent Compressed Text Indexing. ACM Transactions on Algorithms. 10:4. (1-19). Online publication date: 1-Aug-2014.

    https://doi.org/10.1145/2635816

  • Li Y and Ji Z. (2014). A local alignment of DNA based on parallelized MUMmer algorithm 2014 10th International Conference on Natural Computation (ICNC). 10.1109/ICNC.2014.6975869. 978-1-4799-5151-2. (401-406).

    http://ieeexplore.ieee.org/document/6975869/

  • Koschke R. (2014). Large-scale inter-system clone detection using suffix trees and hashing. Journal of Software: Evolution and Process. 26:8. (747-769). Online publication date: 1-Aug-2014.

    https://doi.org/10.1002/smr.1592

  • Kouris I, Makris C, Theodoridis E and Tsakalidis A. (2014). Indexing and Compressing Text. Encyclopedia of Information Science and Technology, Third Edition. 10.4018/978-1-4666-5888-2.ch173. (1800-1808).

    https://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/978-1-4666-5888-2.ch173

  • Cook J, Etesami O, Miller R and Trevisan L. (2014). On the One-Way Function Candidate Proposed by Goldreich. ACM Transactions on Computation Theory. 6:3. (1-35). Online publication date: 1-Jul-2014.

    https://doi.org/10.1145/2633602

  • Brakerski Z, Gentry C and Vaikuntanathan V. (2014). (Leveled) Fully Homomorphic Encryption without Bootstrapping. ACM Transactions on Computation Theory. 6:3. (1-36). Online publication date: 1-Jul-2014.

    https://doi.org/10.1145/2633600

  • Valiant P. (2014). Evolvability of Real Functions. ACM Transactions on Computation Theory. 6:3. (1-19). Online publication date: 1-Jul-2014.

    https://doi.org/10.1145/2633598

  • Kanade V and Steinke T. (2014). Learning Hurdles for Sleeping Experts. ACM Transactions on Computation Theory. 6:3. (1-16). Online publication date: 1-Jul-2014.

    https://doi.org/10.1145/2505983

  • Larsson N, Fuglsang K and Karlsson K. Efficient Representation for Online Suffix Tree Construction. Proceedings of the 13th International Symposium on Experimental Algorithms - Volume 8504. (400-411).

    https://doi.org/10.1007/978-3-319-07959-2_34

  • Baron G, Drot-Delange B, Grandbastien M and Tort F. (2014). Computer Science Education in French Secondary Schools. ACM Transactions on Computing Education. 14:2. (1-27). Online publication date: 1-Jun-2014.

    https://doi.org/10.1145/2602486

  • Crochemore M, Langiu A and Rahman M. (2014). Indexing a sequence for mapping reads with a single mismatch. Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences. 10.1098/rsta.2013.0167. 372:2016. (20130167). Online publication date: 28-May-2014.

    https://royalsocietypublishing.org/doi/10.1098/rsta.2013.0167

  • Smyth W. (2014). Large-scale detection of repetitions. Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences. 10.1098/rsta.2013.0138. 372:2016. (20130138). Online publication date: 28-May-2014.

    https://royalsocietypublishing.org/doi/10.1098/rsta.2013.0138

  • Weiss M. (2014). Data Structures. Computing Handbook, Third Edition. 10.1201/b16812-6. (1-20). Online publication date: 14-May-2014.

    http://www.crcnetbase.com/doi/abs/10.1201/b16812-6

  • Ni B, Wong M, Lam C and Leung K. (2014). Applying Agrep to r-NSA to solve multiple sequences approximate matching. International Journal of Data Mining and Bioinformatics. 9:4. (358-385). Online publication date: 1-May-2014.

    /doi/10.5555/2631188.2631190

  • Comin M and Antonello M. (2014). Fast entropic profiler. IEEE/ACM Transactions on Computational Biology and Bioinformatics. 11:3. (500-509). Online publication date: 1-May-2014.

    https://doi.org/10.1109/TCBB.2013.2297924

  • Amir A, Butman A and Porat E. (2014). On the relationship between histogram indexing and block-mass indexing. Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences. 10.1098/rsta.2013.0132. 372:2016. (20130132-20130132). Online publication date: 21-Apr-2014.

    http://rsta.royalsocietypublishing.org/cgi/doi/10.1098/rsta.2013.0132

  • Aguiar D, Morrow E and Istrail S. Tractatus. Proceedings of the 18th Annual International Conference on Research in Computational Molecular Biology - Volume 8394. (1-17).

    https://doi.org/10.1007/978-3-319-05269-4_1

  • Hon W, Shah R, Thankachan S and Vitter J. (2014). Space-Efficient Frameworks for Top-k String Retrieval. Journal of the ACM. 61:2. (1-36). Online publication date: 1-Apr-2014.

    https://doi.org/10.1145/2590774

  • Navarro G. (2014). Spaces, Trees, and Colors. ACM Computing Surveys. 46:4. (1-47). Online publication date: 1-Apr-2014.

    https://doi.org/10.1145/2535933

  • Rebenich N, Speidel U, Neville S and Gulliver T. (2014). FLOTT—A Fast, Low Memory T-TransformAlgorithm for Measuring String Complexity. IEEE Transactions on Computers. 63:4. (917-926). Online publication date: 1-Apr-2014.

    https://doi.org/10.1109/TC.2013.29

  • Comin M and Farreras M. (2014). Parallel Continuous Flow: A Parallel Suffix Tree Construction Tool for Whole Genomes. Journal of Computational Biology. 10.1089/cmb.2012.0256. 21:4. (330-344). Online publication date: 1-Apr-2014.

    http://www.liebertpub.com/doi/10.1089/cmb.2012.0256

  • Moritz R, Bernt M and Middendorf M. (2014). Local Similarity Search to Find Gene Indicators in Mitochondrial Genomes. Biology. 10.3390/biology3010220. 3:1. (220-242).

    https://www.mdpi.com/2079-7737/3/1/220

  • Huo H, Chen L, Vitter J and Nekrich Y. (2014). A Practical Implementation of Compressed Suffix Arrays with Applications to Self-Indexing 2014 Data Compression Conference (DCC). 10.1109/DCC.2014.49. 978-1-4799-3882-7. (292-301).

    http://ieeexplore.ieee.org/document/6824437/

  • Navarro G. (2014). Wavelet trees for all. Journal of Discrete Algorithms. 10.1016/j.jda.2013.07.004. 25. (2-20). Online publication date: 1-Mar-2014.

    https://linkinghub.elsevier.com/retrieve/pii/S1570866713000610

  • Tamura K, Watanuki Y, Kitakami H and Takahashi Y. (2014). Multiple Buffering for Parallel Approximate Sequence Matching using Disk-based Suffix Tree on Multi-core CPU. GSTF Journal on Computing (JoC). 10.7603/s40601-013-0022-0. 3:3.

    https://link.springer.com/10.7603/s40601-013-0022-0

  • Lin E. (2014). Research on Multi-Attribute Sequence Query Processing Techniques over Data Streams. Applied Mechanics and Materials. 10.4028/www.scientific.net/AMM.513-517.575. 513-517. (575-578).

    https://www.scientific.net/AMM.513-517.575

  • Gawrychowski P, Jeż A and Jeż Ł. (2014). Validating the Knuth-Morris-Pratt Failure Function, Fast and Online. Theory of Computing Systems. 54:2. (337-372). Online publication date: 1-Feb-2014.

    https://doi.org/10.1007/s00224-013-9522-8

  • Amir A, Franceschini G, Grossi R, Kopelowitz T, Lewenstein M and Lewenstein N. (2014). Managing Unbounded-Length Keys in Comparison-Driven Data Structures with Applications to Online Indexing. SIAM Journal on Computing. 10.1137/110836377. 43:4. (1396-1416). Online publication date: 1-Jan-2014.

    http://epubs.siam.org/doi/10.1137/110836377

  • Kaur R and Singh M. A Survey on Zero-Day Polymorphic Worm Detection Techniques. IEEE Communications Surveys & Tutorials. 10.1109/SURV.2014.022714.00160. 16:3. (1520-1549).

    http://ieeexplore.ieee.org/document/6766917/

  • I T, Inenaga S, Bannai H and Takeda M. (2014). Inferring strings from suffix trees and links on a binary alphabet. Discrete Applied Mathematics. 163. (316-325). Online publication date: 1-Jan-2014.

    https://doi.org/10.1016/j.dam.2013.02.033

  • Apostolico A and Cunial F. (2014). Suffix Trees and Arrays. Encyclopedia of Algorithms. 10.1007/978-3-642-27848-8_627-1. (1-10).

    https://link.springer.com/10.1007/978-3-642-27848-8_627-1

  • Na J, Ferragina P, Giancarlo R and Park K. (2014). Indexed Two-Dimensional String Matching. Encyclopedia of Algorithms. 10.1007/978-3-642-27848-8_442-2. (1-6).

    https://link.springer.com/10.1007/978-3-642-27848-8_442-2

  • Stoye J. (2014). Suffix Tree Construction. Encyclopedia of Algorithms. 10.1007/978-3-642-27848-8_414-2. (1-6).

    https://link.springer.com/10.1007/978-3-642-27848-8_414-2

  • Lewenstein M. (2014). Parameterized Pattern Matching. Encyclopedia of Algorithms. 10.1007/978-3-642-27848-8_282-2. (1-6).

    https://link.springer.com/10.1007/978-3-642-27848-8_282-2

  • Larsson N. (2014). Most Recent Match Queries in On-Line Suffix Trees. Combinatorial Pattern Matching. 10.1007/978-3-319-07566-2_26. (252-261).

    http://link.springer.com/10.1007/978-3-319-07566-2_26

  • Amir A, Levy A, Porat E and Shalom B. (2014). Dictionary Matching with One Gap. Combinatorial Pattern Matching. 10.1007/978-3-319-07566-2_2. (11-20).

    http://link.springer.com/10.1007/978-3-319-07566-2_2

  • Feigenblat G, Porat E and Shiftan A. (2014). An Improved Query Time for Succinct Dynamic Dictionary Matching. Combinatorial Pattern Matching. 10.1007/978-3-319-07566-2_13. (120-129).

    http://link.springer.com/10.1007/978-3-319-07566-2_13

  • Vezzi F, Lancia G and Policriti A. (2013). Algorithms and Data Structures for Next‐Generation Sequences. Biological Knowledge Discovery Handbook. 10.1002/9781118617151.ch10. (223-250). Online publication date: 16-Dec-2013.

    https://onlinelibrary.wiley.com/doi/10.1002/9781118617151.ch10

  • Huo L, Hu L and Jiang Y. (2013). Research on Multivariate Stream Line Inter-Relevant Successive Trees. Advanced Materials Research. 10.4028/www.scientific.net/AMR.846-847.1011. 846-847. (1011-1018).

    https://www.scientific.net/AMR.846-847.1011

  • Novosád T, Snáel V, Abraham A and Yang J. (2013). Discovering 3D Protein Structures for Optimal Structure Alignment. Algorithmic and Artificial Intelligence Methods for Protein Bioinformatics. 10.1002/9781118567869.ch14. (281-298). Online publication date: 28-Oct-2013.

    https://onlinelibrary.wiley.com/doi/10.1002/9781118567869.ch14

  • Biswas S, Ku T, Shah R and Thankachan S. Position-Restricted Substring Searching over Small Alphabets. Proceedings of the 20th International Symposium on String Processing and Information Retrieval - Volume 8214. (29-36).

    https://doi.org/10.1007/978-3-319-02432-5_7

  • Chilowicz M, Duris í and Roussel G. (2013). Viewing functions as token sequences to highlight similarities in source code. Science of Computer Programming. 78:10. (1871-1891). Online publication date: 1-Oct-2013.

    https://doi.org/10.1016/j.scico.2012.11.008

  • Park Y. (2013). Efficient techniques on retrieving bio-information for active U-healthcare. Personal and Ubiquitous Computing. 17:7. (1349-1356). Online publication date: 1-Oct-2013.

    https://doi.org/10.1007/s00779-012-0569-3

  • Comin M and Farreras M. Efficient parallel construction of suffix trees for genomes larger than main memory. Proceedings of the 20th European MPI Users' Group Meeting. (211-216).

    https://doi.org/10.1145/2488551.2488579

  • Mansour E, El-Roby A, Kalnis P, Ahmadia A and Aboulnaga A. (2013). RACE. Proceedings of the VLDB Endowment. 6:10. (865-876). Online publication date: 26-Aug-2013.

    https://doi.org/10.14778/2536206.2536214

  • Deo M and Keely S. (2013). Parallel suffix array and least common prefix for the GPU. ACM SIGPLAN Notices. 48:8. (197-206). Online publication date: 23-Aug-2013.

    https://doi.org/10.1145/2517327.2442536

  • Li J and Ma D. (2013). Suffix Tree Based Incremental Web Services Clustering Method. Journal of Networks. 10.4304/jnw.8.7.1566-1573. 8:7.

    http://ojs.academypublisher.com/index.php/jnw/article/view/10486

  • Vitale L, Martin A and Seroussi G. (2013). Space-efficient representation of truncated suffix trees, with applications to Markov order estimation 2013 IEEE International Symposium on Information Theory (ISIT). 10.1109/ISIT.2013.6620561. 978-1-4799-0446-4. (1924-1928).

    http://ieeexplore.ieee.org/document/6620561/

  • Mishra T and Sahni S. (2013). PUBSUB: An efficient publish/subscribe system 2013 IEEE Symposium on Computers and Communications (ISCC). 10.1109/ISCC.2013.6755014. 978-1-4799-3755-4. (000606-000611).

    http://ieeexplore.ieee.org/document/6755014/

  • Leibovich L, Paz I, Yakhini Z and Mandel-Gutfreund Y. (2013). DRIMust: a web server for discovering rank imbalanced motifs using suffix trees. Nucleic Acids Research. 10.1093/nar/gkt407. 41:W1. (W174-W179). Online publication date: 1-Jul-2013.

    http://academic.oup.com/nar/article/41/W1/W174/1102165/DRIMust-a-web-server-for-discovering-rank

  • Comin M and Antonello M. Fast computation of entropic profiles for the detection of conservation in genomes. Proceedings of the 8th IAPR international conference on Pattern Recognition in Bioinformatics. (277-288).

    https://doi.org/10.1007/978-3-642-39159-0_25

  • Jain R, Mohania M and Prabhakar S. Efficient subsequence search in databases. Proceedings of the 14th international conference on Web-Age Information Management. (440-452).

    https://doi.org/10.1007/978-3-642-38562-9_45

  • Dheenadayalan K, Muralidhara V and Katru J. (2013). Common substring in multiple sequences using hash based technique 2013 International Conference on Technology, Informatics, Management, Engineering & Environment (TIME-E). 10.1109/TIME-E.2013.6611980. 978-1-4673-5732-6. (140-145).

    http://ieeexplore.ieee.org/document/6611980/

  • Abeliuk A, Cánovas R and Navarro G. (2013). Practical Compressed Suffix Trees. Algorithms. 10.3390/a6020319. 6:2. (319-351).

    https://www.mdpi.com/1999-4893/6/2/319

  • de Alfaro L and Shavlovsky M. Attributing authorship of revisioned content. Proceedings of the 22nd international conference on World Wide Web. (343-354).

    https://doi.org/10.1145/2488388.2488419

  • Chen Y, Hong J, Cui W, Zaneveld J, Wang W, Gibbs R, Xiao Y, Chen R and Tang H. (2013). CGAP-Align: A High Performance DNA Short Read Alignment Tool. PLoS ONE. 10.1371/journal.pone.0061033. 8:4. (e61033).

    http://dx.plos.org/10.1371/journal.pone.0061033

  • Shun J and Zhao F. Practical Parallel Lempel-Ziv Factorization. Proceedings of the 2013 Data Compression Conference. (123-132).

    https://doi.org/10.1109/DCC.2013.20

  • Hon W, Ku T, Shah R, Thankachan S and Vitter J. (2013). Faster compressed dictionary matching. Theoretical Computer Science. 475. (113-119). Online publication date: 1-Mar-2013.

    https://doi.org/10.1016/j.tcs.2012.10.050

  • Hon W, Ku T, Shah R, Thankachan S and Vitter J. (2013). Compressed text indexing with wildcards. Journal of Discrete Algorithms. 19. (23-29). Online publication date: 1-Mar-2013.

    https://doi.org/10.1016/j.jda.2012.12.003

  • Deo M and Keely S. Parallel suffix array and least common prefix for the GPU. Proceedings of the 18th ACM SIGPLAN symposium on Principles and practice of parallel programming. (197-206).

    https://doi.org/10.1145/2442516.2442536

  • Chen C, Cook D and Crandall A. (2013). The user side of sustainability. Pervasive and Mobile Computing. 9:1. (161-175). Online publication date: 1-Feb-2013.

    https://doi.org/10.1016/j.pmcj.2012.10.004

  • Göde N and Koschke R. (2010). Studying clone evolution using incremental clone detection. Journal of Software: Evolution and Process. 10.1002/smr.520. 25:2. (165-192). Online publication date: 1-Feb-2013.

    https://onlinelibrary.wiley.com/doi/10.1002/smr.520

  • Lin E. (2013). Research on Sequence Query Processing Techniques over Data Streams. Applied Mechanics and Materials. 10.4028/www.scientific.net/AMM.284-287.3507. 284-287. (3507-3511).

    https://www.scientific.net/AMM.284-287.3507

  • Crochemore M, Ilie L, Iliopoulos C, Kubica M, Rytter W and Waleń T. (2013). Computing the Longest Previous Factor. European Journal of Combinatorics. 34:1. (15-26). Online publication date: 1-Jan-2013.

    https://doi.org/10.1016/j.ejc.2012.07.011

  • Smyth W. (2013). Computing regularities in strings. European Journal of Combinatorics. 34:1. (3-14). Online publication date: 1-Jan-2013.

    https://doi.org/10.1016/j.ejc.2012.07.010

  • Lewenstein M. (2013). Orthogonal Range Searching for Text Indexing. Space-Efficient Data Structures, Streams, and Algorithms. 10.1007/978-3-642-40273-9_18. (267-302).

    http://link.springer.com/10.1007/978-3-642-40273-9_18

  • Hon W, Ku T, Shah R and Thankachan S. (2013). Space-Efficient Construction Algorithm for the Circular Suffix Tree. Combinatorial Pattern Matching. 10.1007/978-3-642-38905-4_15. (142-152).

    http://link.springer.com/10.1007/978-3-642-38905-4_15

  • Salmon R, Ribeiro C and Amarala S. (2013). Fact Based Search Engine: News Fact Finder Utilizing Naive Bayes Classification. Quality Issues in the Management of Web Information. 10.1007/978-3-642-37688-7_6. (121-143).

    https://link.springer.com/10.1007/978-3-642-37688-7_6

  • Blanchet-Sadri F and Lazarow J. (2013). Suffix Trees for Partial Words and the Longest Common Compatible Prefix Problem. Language and Automata Theory and Applications. 10.1007/978-3-642-37064-9_16. (165-176).

    http://link.springer.com/10.1007/978-3-642-37064-9_16

  • Zhu D. (2013). Use Fuzzy SVM Mining Customers’ Opinion Trends from Their Feedbacks. Proceedings of the International Conference on Information Engineering and Applications (IEA) 2012. 10.1007/978-1-4471-4856-2_72. (601-607).

    https://link.springer.com/10.1007/978-1-4471-4856-2_72

  • Xylogiannopoulos K, Karampelas P and Alhajj R. Minimization of Suffix Array's Storage Capacity for Periodicity Detection in Time Series. Proceedings of the 2012 IEEE 24th International Conference on Tools with Artificial Intelligence - Volume 01. (307-313).

    https://doi.org/10.1109/ICTAI.2012.49

  • Al-Hafeedh A, Crochemore M, Ilie L, Kopylova E, Smyth W, Tischler G and Yusufu M. (2012). A comparison of index-based lempel-Ziv LZ77 factorization algorithms. ACM Computing Surveys. 45:1. (1-17). Online publication date: 1-Nov-2012.

    https://doi.org/10.1145/2379776.2379781

  • Kim D. (2012). The Compressed Instruction Set Architecture for the OpenRISC Processor. Journal of the Korea Society of Computer and Information. 10.9708/jksci/2012.17.10.011. 17:10. (11-23). Online publication date: 31-Oct-2012.

    http://koreascience.or.kr/journal/view.jsp?kj=CPTSCQ&py=2012&vnc=v17n10&sp=11

  • Xu Z, Qin J and Yan F. An XML data query method based on structure-encoded. Proceedings of the 2012 international conference on Web Information Systems and Mining. (706-713).

    https://doi.org/10.1007/978-3-642-33469-6_87

  • Abeliuk A and Navarro G. Compressed suffix trees for repetitive texts. Proceedings of the 19th international conference on String Processing and Information Retrieval. (30-41).

    https://doi.org/10.1007/978-3-642-34109-0_5

  • Bannai H, Inenaga S and Takeda M. Efficient LZ78 factorization of grammar compressed text. Proceedings of the 19th international conference on String Processing and Information Retrieval. (86-98).

    https://doi.org/10.1007/978-3-642-34109-0_10

  • Wu C, Kalyanaraman A and Cannon W. (2012). pGraph. IEEE Transactions on Parallel and Distributed Systems. 23:10. (1923-1933). Online publication date: 1-Oct-2012.

    https://doi.org/10.1109/TPDS.2012.19

  • Breslauer D and Italiano G. (2012). On suffix extensions in suffix trees. Theoretical Computer Science. 457. (27-34). Online publication date: 1-Oct-2012.

    https://doi.org/10.1016/j.tcs.2012.07.018

  • Wong R, Shi F and Lam N. Full-text search on multi-byte encoded documents. Proceedings of the 2012 ACM symposium on Document engineering. (227-236).

    https://doi.org/10.1145/2361354.2361404

  • Xylogiannopoulos K, Karampelas P and Alhajj R. (2012). Periodicity data mining in time series using Suffix Arrays 2012 6th IEEE International Conference Intelligent Systems (IS). 10.1109/IS.2012.6335132. 978-1-4673-2278-2. (172-181).

    http://ieeexplore.ieee.org/document/6335132/

  • Wiggins G. (2012). The Mind’s Chorus: Creativity Before Consciousness. Cognitive Computation. 10.1007/s12559-012-9151-6. 4:3. (306-319). Online publication date: 1-Sep-2012.

    http://link.springer.com/10.1007/s12559-012-9151-6

  • Liu Y, Wu X, Hu X, Gao J and Wang C. Pattern matching with wildcards based on multiple suffix trees. Proceedings of the 2012 IEEE International Conference on Granular Computing (GrC-2012). (320-325).

    https://doi.org/10.1109/GrC.2012.6468626

  • Vyverman M, De Baets B, Fack V and Dawyndt P. (2012). Prospects and limitations of full-text index structures in genome analysis. Nucleic Acids Research. 10.1093/nar/gks408. 40:15. (6993-7015). Online publication date: 1-Aug-2012.

    https://academic.oup.com/nar/article-lookup/doi/10.1093/nar/gks408

  • Navarro G. Wavelet trees for all. Proceedings of the 23rd Annual conference on Combinatorial Pattern Matching. (2-26).

    https://doi.org/10.1007/978-3-642-31265-6_2

  • Hon W, Shah R and Thankachan S. Towards an optimal space-and-query-time index for top-k document retrieval. Proceedings of the 23rd Annual conference on Combinatorial Pattern Matching. (173-184).

    https://doi.org/10.1007/978-3-642-31265-6_14

  • Felicioli C and Marangoni R. (2012). BpMatch. IEEE/ACM Transactions on Computational Biology and Bioinformatics. 9:4. (1120-1127). Online publication date: 1-Jul-2012.

    https://doi.org/10.1109/TCBB.2012.30

  • Leibovich L and Yakhini Z. (2012). Efficient motif search in ranked lists and applications to variable gap motifs. Nucleic Acids Research. 10.1093/nar/gks206. 40:13. (5832-5847). Online publication date: 1-Jul-2012.

    https://academic.oup.com/nar/article/40/13/5832/1008930

  • Carbone M, Honda K and Yoshida N. (2012). Structured Communication-Centered Programming for Web Services. ACM Transactions on Programming Languages and Systems. 34:2. (1-78). Online publication date: 1-Jun-2012.

    https://doi.org/10.1145/2220365.2220367

  • Bodden E, Lam P and Hendren L. (2012). Partially Evaluating Finite-State Runtime Monitors Ahead of Time. ACM Transactions on Programming Languages and Systems. 34:2. (1-52). Online publication date: 1-Jun-2012.

    https://doi.org/10.1145/2220365.2220366

  • Gray P. (2012). The other?. ACM SIGMIS Database: the DATABASE for Advances in Information Systems. 43:2. (26-32). Online publication date: 8-May-2012.

    https://doi.org/10.1145/2212757.2212763

  • Lin J, Adjeroh D and Jiang B. (2012). Probabilistic suffix array. Bioinformatics. 28:10. (1314-1323). Online publication date: 1-May-2012.

    https://doi.org/10.1093/bioinformatics/bts121

  • Yuan-Chun X, Yuan T, Yi-Lai Z and De-Xian G. (2012). An algorithm to find the largest adjacent repeated pattern based on Suffix Tree 2012 2nd International Conference on Consumer Electronics, Communications and Networks (CECNet). 10.1109/CECNet.2012.6201906. 978-1-4577-1415-3. (2353-2356).

    http://ieeexplore.ieee.org/document/6201906/

  • Senft M and Dvořák T. (2012). On-line suffix tree construction with reduced branching. Journal of Discrete Algorithms. 12. (48-60). Online publication date: 1-Apr-2012.

    https://doi.org/10.1016/j.jda.2012.01.001

  • Koschke R. Large-Scale Inter-System Clone Detection Using Suffix Trees. Proceedings of the 2012 16th European Conference on Software Maintenance and Reengineering. (309-318).

    https://doi.org/10.1109/CSMR.2012.37

  • Wu C. (2012). WSDL term tokenization methods for IR-style Web services discovery. Science of Computer Programming. 77:3. (355-374). Online publication date: 1-Mar-2012.

    https://doi.org/10.1016/j.scico.2011.08.001

  • Jansson J, Sadakane K and Sung W. (2012). Ultra-succinct representation of ordered trees with applications. Journal of Computer and System Sciences. 78:2. (619-631). Online publication date: 1-Mar-2012.

    https://doi.org/10.1016/j.jcss.2011.09.002

  • Rashid M, Karim M, Jeong B and Choi H. (2012). Efficient Mining of Interesting Patterns in Large Biological Sequences. Genomics & Informatics. 10.5808/GI.2012.10.1.44. 10:1. (44).

    http://genominfo.org/journal/view.php?doi=10.5808/GI.2012.10.1.44

  • Federico M, Leoncini M, Montangero M and Valente P. (2012). Direct vs 2-stage approaches to structured motif finding. Algorithms for Molecular Biology. 10.1186/1748-7188-7-20. 7:1. (20).

    http://almob.biomedcentral.com/articles/10.1186/1748-7188-7-20

  • (2012). Bibliography. Heuristic Search. 10.1016/B978-0-12-372512-7.00020-1. (793-823).

    https://linkinghub.elsevier.com/retrieve/pii/B9780123725127000201

  • Skiena S. (2012). Data Structures. The Algorithm Design Manual. 10.1007/978-1-84800-070-4_12. (366-392).

    http://link.springer.com/10.1007/978-1-84800-070-4_12

  • Xylogiannopoulos K, Karampelas P and Alhajj R. (2012). Pattern Detection and Analysis in Financial Time Series Using Suffix Arrays. Financial Decision Making Using Computational Intelligence. 10.1007/978-1-4614-3773-4_5. (129-157).

    https://link.springer.com/10.1007/978-1-4614-3773-4_5

  • Barsky M, Stege U and Thomo A. (2011). Full-Text (Substring) Indexes in External Memory. Synthesis Lectures on Data Management. 10.2200/S00396ED1V01Y201111DTM022. 3:7. (1-92). Online publication date: 18-Dec-2011.

    http://www.morganclaypool.com/doi/abs/10.2200/S00396ED1V01Y201111DTM022

  • Worawitphinyo P, Gao X and Jabeen S. Improving suffix tree clustering with new ranking and similarity measures. Proceedings of the 7th international conference on Advanced Data Mining and Applications - Volume Part II. (55-68).

    https://doi.org/10.1007/978-3-642-25856-5_5

  • Amir A, Apostolico A, Landau G, Levy A, Lewenstein M and Porat E. Range LCP. Proceedings of the 22nd international conference on Algorithms and Computation. (683-692).

    https://doi.org/10.1007/978-3-642-25591-5_70

  • Kudinov P. (2011). Extracting statistics indicators from tables of basic structure. Pattern Recognition and Image Analysis. 21:4. (630-636). Online publication date: 1-Dec-2011.

    https://doi.org/10.1134/S1054661811040110

  • Menon G, Katdare S, Phatak S and Khengare R. Adaptive Pattern Matching Grammar Generation for Use in Deep Packet Inspection. Proceedings of the 2011 UKSim 5th European Symposium on Computer Modeling and Simulation. (119-122).

    https://doi.org/10.1109/EMS.2011.74

  • Riaz T, Shehzad W, Viari A, Pompanon F, Taberlet P and Coissac E. (2011). ecoPrimers: inference of new DNA barcode markers from whole genome sequence analysis. Nucleic Acids Research. 10.1093/nar/gkr732. 39:21. (e145-e145). Online publication date: 1-Nov-2011.

    https://academic.oup.com/nar/article/39/21/e145/1105558

  • Breslauer D and Italiano G. On suffix extensions in suffix trees. Proceedings of the 18th international conference on String processing and information retrieval. (301-312).

    /doi/10.5555/2051073.2051103

  • Hon W, Ku T, Shah R, Thankachan S and Vitter J. Compressed text indexing with wildcards. Proceedings of the 18th international conference on String processing and information retrieval. (267-277).

    /doi/10.5555/2051073.2051099

  • Breslauer D and Italiano G. Near real-time suffix tree construction via the fringe marked ancestor problem. Proceedings of the 18th international conference on String processing and information retrieval. (156-167).

    /doi/10.5555/2051073.2051089

  • Lewenstein M. Indexing with gaps. Proceedings of the 18th international conference on String processing and information retrieval. (135-143).

    /doi/10.5555/2051073.2051087

  • Kopelowitz T, Lewenstein M and Porat E. Persistency in suffix trees with applications to string interval problems. Proceedings of the 18th international conference on String processing and information retrieval. (67-80).

    /doi/10.5555/2051073.2051081

  • Bazrafshan S, Koschke R and Gode N. Approximate Code Search in Program Histories. Proceedings of the 2011 18th Working Conference on Reverse Engineering. (109-118).

    https://doi.org/10.1109/WCRE.2011.22

  • De Agostino S. (2011). Lempel–Ziv Data Compression on Parallel and Distributed Systems. Algorithms. 10.3390/a4030183. 4:3. (183-199).

    https://www.mdpi.com/1999-4893/4/3/183

  • Mansour E, Allam A, Skiadopoulos S and Kalnis P. (2011). ERA. Proceedings of the VLDB Endowment. 5:1. (49-60). Online publication date: 1-Sep-2011.

    https://doi.org/10.14778/2047485.2047490

  • Wang H, Zhu J, Tang S and Fan X. (2011). A new unsupervised approach to word segmentation. Computational Linguistics. 37:3. (421-454). Online publication date: 1-Sep-2011.

    https://doi.org/10.1162/COLI_a_00058

  • Russo L, Navarro G and Oliveira A. (2011). Fully compressed suffix trees. ACM Transactions on Algorithms. 7:4. (1-34). Online publication date: 1-Sep-2011.

    https://doi.org/10.1145/2000807.2000821

  • Slaninová K, Martinovič J, Novosád T, Dráždilová P, Vojáček L and Snášel V. Web Site Community Analysis Based on Suffix Tree and Clustering Algorithm. Proceedings of the 2011 IEEE/WIC/ACM International Conferences on Web Intelligence and Intelligent Agent Technology - Volume 03. (110-113).

    https://doi.org/10.1109/WI-IAT.2011.85

  • Snowsill T, Fyson N, De Bie T and Cristianini N. Refining causality. Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining. (466-474).

    https://doi.org/10.1145/2020408.2020483

  • Maaradji A, Hacid H, Skraba R and Vakali A. Social Web Mashups Full Completion via Frequent Sequence Mining. Proceedings of the 2011 IEEE World Congress on Services. (9-16).

    https://doi.org/10.1109/SERVICES.2011.98

  • Goldstein I and Lewenstein M. Quick greedy computation for minimum common string partitions. Proceedings of the 22nd annual conference on Combinatorial pattern matching. (273-284).

    /doi/10.5555/2018243.2018269

  • Uemura T and Arimura H. Sparse and truncated suffix trees on variable-length codes. Proceedings of the 22nd annual conference on Combinatorial pattern matching. (246-260).

    /doi/10.5555/2018243.2018267

  • De Agostino S. Lempel-Ziv Data Compression on Parallel and Distributed Systems. Proceedings of the 2011 First International Conference on Data Compression, Communications and Processing. (193-202).

    https://doi.org/10.1109/CCP.2011.11

  • Yuan D, Xie Y, Panigrahy R, Yang J, Verbowski C and Kumar A. Context-based online configuration-error detection. Proceedings of the 2011 USENIX conference on USENIX annual technical conference. (28-28).

    /doi/10.5555/2002181.2002209

  • Huang G, Zhang Y, He J and Ding Z. Efficiently retrieving longest common route patterns of moving objects by summarizing turning regions. Proceedings of the 15th Pacific-Asia conference on Advances in knowledge discovery and data mining - Volume Part I. (375-386).

    /doi/10.5555/2017863.2017899

  • Chen H, Liu J, Furuse K, Yu J and Ohbo N. (2011). Indexing expensive functions for efficient multi-dimensional similarity search. Knowledge and Information Systems. 27:2. (165-192). Online publication date: 1-May-2011.

    /doi/10.5555/3225632.3225761

  • Boytsov L. (2011). Indexing methods for approximate dictionary searching. ACM Journal of Experimental Algorithmics. 16. (1.1-1.91). Online publication date: 1-May-2011.

    https://doi.org/10.1145/1963190.1963191

  • Zhang B and Huang Z. (2011). A new parallel suffix tree construction algorithm 2011 IEEE 3rd International Conference on Communication Software and Networks (ICCSN). 10.1109/ICCSN.2011.6014022. 978-1-61284-485-5. (143-147).

    http://ieeexplore.ieee.org/document/6014022/

  • Barsky M, Stege U and Thomo A. (2011). Suffix trees for inputs larger than main memory. Information Systems. 36:3. (644-654). Online publication date: 1-May-2011.

    https://doi.org/10.1016/j.is.2010.11.001

  • Chen H, Liu J, Furuse K, Yu J and Ohbo N. (2010). Indexing expensive functions for efficient multi-dimensional similarity search. Knowledge and Information Systems. 10.1007/s10115-010-0303-2. 27:2. (165-192). Online publication date: 1-May-2011.

    http://link.springer.com/10.1007/s10115-010-0303-2

  • Hon W, Ku T, Shah R, Thankachan S and Vitter J. Compressed Dictionary Matching with One Error. Proceedings of the 2011 Data Compression Conference. (113-122).

    https://doi.org/10.1109/DCC.2011.18

  • Chi Wang , Hao Wang , Zhao Xie and Jun Gao . (2011). Exact String Matching with Variable Length of Don't Cares based on Suffix Tree 2011 International Conference on Information Science and Technology (ICIST). 10.1109/ICIST.2011.5765221. 978-1-4244-9440-8. (109-113).

    http://ieeexplore.ieee.org/document/5765221/

  • Zeng D, Wei D, Chau M and Wang F. (2011). Domain-specific Chinese word segmentation using suffix tree and mutual information. Information Systems Frontiers. 13:1. (115-125). Online publication date: 1-Mar-2011.

    https://doi.org/10.1007/s10796-010-9278-5

  • Kim D, Na J, Sim J and Park K. (2011). Linear-Time Construction of Two-Dimensional Suffix Trees. Algorithmica. 59:2. (269-297). Online publication date: 1-Feb-2011.

    /doi/10.5555/3118734.3118823

  • Christodoulakis M and Iliopoulos C. (2011). Recent Advances in Weighted DNA Sequences. Algorithms in Computational Molecular Biology. 10.1002/9780470892107.ch8. (143-169). Online publication date: 18-Jan-2011.

    https://onlinelibrary.wiley.com/doi/10.1002/9780470892107.ch8

  • Makris C and Theodoridis E. (2011). String Data Structures for Computational Molecular Biology. Algorithms in Computational Molecular Biology. 10.1002/9780470892107.ch1. (1-25). Online publication date: 18-Jan-2011.

    https://onlinelibrary.wiley.com/doi/10.1002/9780470892107.ch1

  • Zerin S and Jeong B. (2011). A Fast Contiguous Sequential Pattern Mining Technique in DNA Data Sequences Using Position Information. IETE Technical Review. 10.4103/0256-4602.90761. 28:6. (511).

    http://tr.ietejournals.org/text.asp?2011/28/6/511/90761

  • Baranova A, Bode J, Manyam G and Emelianenko M. (2011). An efficient algorithm for systematic analysis of nucleotide strings suitable for siRNA design. BMC Research Notes. 10.1186/1756-0500-4-168. 4:1. (168).

    http://bmcresnotes.biomedcentral.com/articles/10.1186/1756-0500-4-168

  • Apostolico A, Pizzi C and Ukkonen E. (2011). Efficient algorithms for the discovery of gapped factors. Algorithms for Molecular Biology. 10.1186/1748-7188-6-5. 6:1. (5).

    http://almob.biomedcentral.com/articles/10.1186/1748-7188-6-5

  • Liu H, Niu Z, Ma Z and Shao W. (2011). Suffix tree-based approach to detecting duplications in sequence diagrams. IET Software. 10.1049/iet-sen.2009.0029. 5:4. (385).

    https://digital-library.theiet.org/content/journals/10.1049/iet-sen.2009.0029

  • Kopelowitz T, Lewenstein M and Porat E. (2011). Persistency in Suffix Trees with Applications to String Interval Problems. String Processing and Information Retrieval. 10.1007/978-3-642-24583-1_8. (67-80).

    http://link.springer.com/10.1007/978-3-642-24583-1_8

  • Breslauer D and Italiano G. (2011). On Suffix Extensions in Suffix Trees. String Processing and Information Retrieval. 10.1007/978-3-642-24583-1_30. (301-312).

    http://link.springer.com/10.1007/978-3-642-24583-1_30

  • Hon W, Ku T, Shah R, Thankachan S and Vitter J. (2011). Compressed Text Indexing with Wildcards. String Processing and Information Retrieval. 10.1007/978-3-642-24583-1_26. (267-277).

    http://link.springer.com/10.1007/978-3-642-24583-1_26

  • Breslauer D and Italiano G. (2011). Near Real-Time Suffix Tree Construction via the Fringe Marked Ancestor Problem. String Processing and Information Retrieval. 10.1007/978-3-642-24583-1_16. (156-167).

    http://link.springer.com/10.1007/978-3-642-24583-1_16

  • Lewenstein M. (2011). Indexing with Gaps. String Processing and Information Retrieval. 10.1007/978-3-642-24583-1_14. (135-143).

    http://link.springer.com/10.1007/978-3-642-24583-1_14

  • Sacomoto G and do Lago A. (2011). A New Algorithm for Sparse Suffix Trees. Advances in Bioinformatics and Computational Biology. 10.1007/978-3-642-22825-4_5. (34-41).

    http://link.springer.com/10.1007/978-3-642-22825-4_5

  • Novosád T, Martinovič J, Scherer P, Snášel V, Šebesta R and Klement P. (2011). Mobile Phone Positioning in GSM Networks Based on Information Retrieval Methods and Data Structures. Digital Information Processing and Communications. 10.1007/978-3-642-22410-2_31. (349-363).

    http://link.springer.com/10.1007/978-3-642-22410-2_31

  • Goldstein I and Lewenstein M. (2011). Quick Greedy Computation for Minimum Common String Partitions. Combinatorial Pattern Matching. 10.1007/978-3-642-21458-5_24. (273-284).

    http://link.springer.com/10.1007/978-3-642-21458-5_24

  • Uemura T and Arimura H. (2011). Sparse and Truncated Suffix Trees on Variable-Length Codes. Combinatorial Pattern Matching. 10.1007/978-3-642-21458-5_22. (246-260).

    http://link.springer.com/10.1007/978-3-642-21458-5_22

  • Huang G, Zhang Y, He J and Ding Z. (2011). Efficiently Retrieving Longest Common Route Patterns of Moving Objects By Summarizing Turning Regions. Advances in Knowledge Discovery and Data Mining. 10.1007/978-3-642-20841-6_31. (375-386).

    http://link.springer.com/10.1007/978-3-642-20841-6_31

  • Gong S and Xiang T. (2011). Towards Modelling Behaviour. Visual Analysis of Behaviour. 10.1007/978-0-85729-670-2_3. (39-65).

    http://link.springer.com/10.1007/978-0-85729-670-2_3

  • Russell D, Way S, Benson A and Sayood K. (2010). A grammar-based distance metric enables fast and accurate clustering of large sets of 16S sequences. BMC Bioinformatics. 10.1186/1471-2105-11-601. 11:1. Online publication date: 1-Dec-2010.

    https://bmcbioinformatics.biomedcentral.com/articles/10.1186/1471-2105-11-601

  • Ghoting A and Makarychev K. (2010). I/O efficient algorithms for serial and parallel suffix tree construction. ACM Transactions on Database Systems. 35:4. (1-37). Online publication date: 1-Nov-2010.

    https://doi.org/10.1145/1862919.1862922

  • Novosád T, Snášel V, Abraham A and Yang J. (2010). Searching protein 3-D structures for optimal structure alignment using intelligent algorithms and data structures. IEEE Transactions on Information Technology in Biomedicine. 14:6. (1378-1386). Online publication date: 1-Nov-2010.

    https://doi.org/10.1109/TITB.2010.2079939

  • Hon W, Ku T, Shah R, Thankachan S and Vitter J. Faster compressed dictionary matching. Proceedings of the 17th international conference on String processing and information retrieval. (191-200).

    /doi/10.5555/1928328.1928352

  • Ma F and Deogun J. (2010). Multiple genome alignment based on longest path in directed acyclic graphs. International Journal of Bioinformatics Research and Applications. 6:4. (366-383). Online publication date: 1-Oct-2010.

    https://doi.org/10.1504/IJBRA.2010.036000

  • Wang M, Wu Y, Tsai M and Tang C. (2010). Sequential pattern discovery for Intrusion Detection System 2010 10th International Symposium on Communications and Information Technologies (ISCIT). 10.1109/ISCIT.2010.5664887. 978-1-4244-7007-5. (470-474).

    http://ieeexplore.ieee.org/document/5664887/

  • Askitis N and Sinha R. (2010). Engineering scalable, cache and space efficient tries for strings. The VLDB Journal — The International Journal on Very Large Data Bases. 19:5. (633-660). Online publication date: 1-Oct-2010.

    https://doi.org/10.1007/s00778-010-0183-9

  • Chan H, Lam T, Sung W, Tam S and Wong S. (2010). Compressed Indexes for Approximate String Matching. Algorithmica. 58:2. (263-281). Online publication date: 1-Oct-2010.

    https://doi.org/10.1007/s00453-008-9263-2

  • Barsky M, Stege U and Thomo A. (2010). A survey of practical algorithms for suffix tree construction in external memory. Software: Practice and Experience. 10.1002/spe.960. 40:11. (965-988). Online publication date: 1-Oct-2010.

    https://onlinelibrary.wiley.com/doi/10.1002/spe.960

  • Mah J, Poo D and Cai S. (2010). UASMAs (universal automated SNP mapping algorithms). Proceedings of the VLDB Endowment. 3:1-2. (1406-1413). Online publication date: 1-Sep-2010.

    https://doi.org/10.14778/1920841.1921013

  • Lin K, Zhang J, Zhai Y and Xu B. (2010). The design and implementation of service process reconfiguration with end-to-end QoS constraints in SOA. Service Oriented Computing and Applications. 4:3. (157-168). Online publication date: 1-Sep-2010.

    https://doi.org/10.1007/s11761-010-0063-6

  • Xu Q, Subhlok J and Hammen N. Efficient Discovery of Loop Nests in Execution Traces. Proceedings of the 2010 IEEE International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems. (193-202).

    https://doi.org/10.1109/MASCOTS.2010.28

  • Breland A, Schlauch K, Nicolescu M and Harris F. An annotated k-deep prefix tree for (1-k)-mer based sequence comparisons. Proceedings of the First ACM International Conference on Bioinformatics and Computational Biology. (79-85).

    https://doi.org/10.1145/1854776.1854792

  • Crochemore M, Kubica M, Waleń T, Iliopoulos C and Rahman M. (2010). Finding Patterns In Given Intervals. Fundamenta Informaticae. 101:3. (173-186). Online publication date: 1-Aug-2010.

    /doi/10.5555/1883466.1883468

  • Ribeiro C, Salmon R, Amarala S and Hamada C. (2010). Sentence level fact based search engine: News Fact Finder Integration (2010 IRI). 10.1109/IRI.2010.5558906. 978-1-4244-8097-5. (368-373).

    http://ieeexplore.ieee.org/document/5558906/

  • Hon W, Shah R and Vitter J. Compression, indexing, and retrieval for massive string data. Proceedings of the 21st annual conference on Combinatorial pattern matching. (260-274).

    /doi/10.5555/1875737.1875761

  • Kopelowitz T. The property suffix tree with dynamic properties. Proceedings of the 21st annual conference on Combinatorial pattern matching. (63-75).

    /doi/10.5555/1875737.1875744

  • Xu Z. A minimal periods algorithm with applications. Proceedings of the 21st annual conference on Combinatorial pattern matching. (51-62).

    /doi/10.5555/1875737.1875743

  • Gawrychowski P, Jeż A and Jeż Ł. Validating the knuth-morris-pratt failure function, fast and online. Proceedings of the 5th international conference on Computer Science: theory and Applications. (132-143).

    https://doi.org/10.1007/978-3-642-13182-0_13

  • Snowsill T, Nicart F, Stefani M, De Bie T and Cristianini N. (2010). Finding surprising patterns in textual data streams 2010 2nd International Workshop on Cognitive Information Processing (CIP). 10.1109/CIP.2010.5604085. 978-1-4244-6459-3. (405-410).

    http://ieeexplore.ieee.org/document/5604085/

  • Salson M, Lecroq T, Léonard M and Mouchard L. (2010). Dynamic extended suffix arrays. Journal of Discrete Algorithms. 8:2. (241-257). Online publication date: 1-Jun-2010.

    https://doi.org/10.1016/j.jda.2009.02.007

  • Cinque L, De Agostino S and Lombardi L. (2010). Scalability and Communication in Parallel Low-Complexity Lossless Compression. Mathematics in Computer Science. 10.1007/s11786-010-0034-5. 3:4. (391-406). Online publication date: 1-Jun-2010.

    http://link.springer.com/10.1007/s11786-010-0034-5

  • Cánovas R and Navarro G. Practical compressed suffix trees. Proceedings of the 9th international conference on Experimental Algorithms. (94-105).

    https://doi.org/10.1007/978-3-642-13193-6_9

  • Chiu S, Hon W, Shah R and Vitter J. I/O-Efficient Compressed Text Indexes. Proceedings of the 2010 Data Compression Conference. (426-434).

    https://doi.org/10.1109/DCC.2010.45

  • Tsirogiannis D and Koudas N. Suffix tree construction algorithms on modern hardware. Proceedings of the 13th International Conference on Extending Database Technology. (263-274).

    https://doi.org/10.1145/1739041.1739075

  • DAI D, XIONG Y and ZHU Y. (2010). Efficient Algorithm for Sequence Similarity Search Based on Reference Indexing. Journal of Software. 10.3724/SP.J.1001.2010.03610. 21:4. (718-731). Online publication date: 11-Mar-2010.

    http://pub.chinasciencejournal.com/article/getArticleRedirect.action?doiCode=10.3724/SP.J.1001.2010.03610

  • LIU X and PENG Z. (2010). Time and Space Efficiencies Analysis of Full-Text Index Techniques. Journal of Software. 10.3724/SP.J.1001.2009.03500. 20:7. (1768-1784). Online publication date: 10-Mar-2010.

    http://pub.chinasciencejournal.com/article/getArticleRedirect.action?doiCode=10.3724/SP.J.1001.2009.03500

  • Shibuya T. (2010). Geometric suffix tree. Journal of the ACM. 57:3. (1-17). Online publication date: 1-Mar-2010.

    https://doi.org/10.1145/1706591.1706595

  • Askitis N and Zobel J. (2011). Redesigning the string hash table, burst trie, and BST to exploit cache. ACM Journal of Experimental Algorithmics. 15. (1.1-1.61). Online publication date: 1-Mar-2010.

    https://doi.org/10.1145/1671970.1921704

  • Crochemore M and Hancart C. Pattern matching in strings. Algorithms and theory of computation handbook. (13-13).

    /doi/10.5555/1882757.1882770

  • Brown C and Thompson S. Clone detection and elimination for Haskell. Proceedings of the 2010 ACM SIGPLAN workshop on Partial evaluation and program manipulation. (111-120).

    https://doi.org/10.1145/1706356.1706378

  • Sicilia M. (2010). How should transversal competence be introduced In computing education?. ACM SIGCSE Bulletin. 41:4. (95-98). Online publication date: 18-Jan-2010.

    https://doi.org/10.1145/1709424.1709455

  • Chen D, Guibas L, Hershberger J and Sun J. Road network reconstruction for organizing paths. Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete algorithms. (1309-1320).

    /doi/10.5555/1873601.1873706

  • Mäkinen V, Välimäki N, Laaksonen A and Katainen R. Unified view of backward backtracking in short read mapping. Algorithms and Applications. (182-195).

    /doi/10.5555/2167962.2167975

  • Landau G, Tsur D and Weimann O. Indexing a dictionary for subset matching queries. Algorithms and Applications. (158-169).

    /doi/10.5555/2167962.2167973

  • Fredriksson K. From nondeterministic suffix automaton to lazy suffix tree. Algorithms and Applications. (114-129).

    /doi/10.5555/2167962.2167970

  • Besenbacher S, Schwikowski B and Stoye J. Indexing and searching a mass spectrometry database. Algorithms and Applications. (62-76).

    /doi/10.5555/2167962.2167966

  • Yoshida M, Nakagawa H and Terada A. (2010). Dynamic Synonym Candidates Extraction for Searching Documents in a Corpus. Transactions of the Japanese Society for Artificial Intelligence. 10.1527/tjsai.25.122. 25. (122-132).

    http://joi.jlc.jst.go.jp/JST.JSTAGE/tjsai/25.122?from=CrossRef

  • Madeira S, Teixeira M, Sa-Correia I and Oliveira A. (2010). Identification of Regulatory Modules in Time Series Gene Expression Data Using a Linear Time Biclustering Algorithm. IEEE/ACM Transactions on Computational Biology and Bioinformatics. 7:1. (153-165). Online publication date: 1-Jan-2010.

    https://doi.org/10.1109/TCBB.2008.34

  • Drews F, Lichtenberg J and Welch L. (2010). Scalable parallel word search in multicore/multiprocessor systems. The Journal of Supercomputing. 51:1. (58-75). Online publication date: 1-Jan-2010.

    https://doi.org/10.1007/s11227-009-0308-3

  • Yu C, Wang B and Kuo C. (2010). Efficient Indexes for the Positional Pattern Matching Problem and Two Related Problems over Small Alphabets. Algorithms and Computation. 10.1007/978-3-642-17514-5_2. (13-24).

    http://link.springer.com/10.1007/978-3-642-17514-5_2

  • Hon W, Ku T, Shah R, Thankachan S and Vitter J. (2010). Faster Compressed Dictionary Matching. String Processing and Information Retrieval. 10.1007/978-3-642-16321-0_19. (191-200).

    http://link.springer.com/10.1007/978-3-642-16321-0_19

  • Kopelowitz T. (2010). The Property Suffix Tree with Dynamic Properties. Combinatorial Pattern Matching. 10.1007/978-3-642-13509-5_7. (63-75).

    http://link.springer.com/10.1007/978-3-642-13509-5_7

  • Xu Z. (2010). A Minimal Periods Algorithm with Applications. Combinatorial Pattern Matching. 10.1007/978-3-642-13509-5_6. (51-62).

    http://link.springer.com/10.1007/978-3-642-13509-5_6

  • Hon W, Shah R and Vitter J. (2010). Compression, Indexing, and Retrieval for Massive String Data. Combinatorial Pattern Matching. 10.1007/978-3-642-13509-5_24. (260-274).

    http://link.springer.com/10.1007/978-3-642-13509-5_24

  • Besenbacher S, Schwikowski B and Stoye J. (2010). Indexing and Searching a Mass Spectrometry Database. Algorithms and Applications. 10.1007/978-3-642-12476-1_4. (62-76).

    http://link.springer.com/10.1007/978-3-642-12476-1_4

  • Mäkinen V, Välimäki N, Laaksonen A and Katainen R. (2010). Unified View of Backward Backtracking in Short Read Mapping. Algorithms and Applications. 10.1007/978-3-642-12476-1_13. (182-195).

    http://link.springer.com/10.1007/978-3-642-12476-1_13

  • Landau G, Tsur D and Weimann O. (2010). Indexing a Dictionary for Subset Matching Queries. Algorithms and Applications. 10.1007/978-3-642-12476-1_11. (158-169).

    http://link.springer.com/10.1007/978-3-642-12476-1_11

  • Chimani M and Klein K. (2010). Algorithm Engineering: Concepts and Practice. Experimental Methods for the Analysis of Optimization Algorithms. 10.1007/978-3-642-02538-9_6. (131-158).

    https://link.springer.com/10.1007/978-3-642-02538-9_6

  • Kale A, Bharambe U and SashiKumar M. A New Suffix Tree Similarity Measure and Labeling for Web Search Results Clustering. Proceedings of the 2009 Second International Conference on Emerging Trends in Engineering & Technology. (856-861).

    https://doi.org/10.1109/ICETET.2009.13

  • Hon W, Lam T, Shah R, Tam S and Vitter J. Succinct Index for Dynamic Dictionary Matching. Proceedings of the 20th International Symposium on Algorithms and Computation. (1034-1043).

    https://doi.org/10.1007/978-3-642-10631-6_104

  • Novosád T, Snášel V, Abraham A and Yang J. YAPS. Proceedings of the 2009 International Conference of Soft Computing and Pattern Recognition. (497-504).

    https://doi.org/10.1109/SoCPaR.2009.101

  • Pinho A, Ferreira P, Garcia S and Rodrigues J. (2009). On finding minimal absent words. BMC Bioinformatics. 10.1186/1471-2105-10-137. 10:1. Online publication date: 1-Dec-2009.

    https://bmcbioinformatics.biomedcentral.com/articles/10.1186/1471-2105-10-137

  • Deineko V and Tiskin A. (2010). Fast minimum-weight double-tree shortcutting for metric TSP. ACM Journal of Experimental Algorithmics. 14. (4.6-4.16). Online publication date: 1-Dec-2009.

    https://doi.org/10.1145/1498698.1594232

  • Tarjan R and Werneck R. (2010). Dynamic trees in practice. ACM Journal of Experimental Algorithmics. 14. (4.5-4.23). Online publication date: 1-Dec-2009.

    https://doi.org/10.1145/1498698.1594231

  • Putze F, Sanders P and Singler J. (2010). Cache-, hash-, and space-efficient bloom filters. ACM Journal of Experimental Algorithmics. 14. (4.4-4.18). Online publication date: 1-Dec-2009.

    https://doi.org/10.1145/1498698.1594230

  • Välimäki N, Mäkinen V, Gerlach W and Dixit K. (2010). Engineering a compressed suffix tree implementation. ACM Journal of Experimental Algorithmics. 14. (4.2-4.23). Online publication date: 1-Dec-2009.

    https://doi.org/10.1145/1498698.1594228

  • LIN J, JIANG Y and ADJEROH D. (2009). THE VIRTUAL SUFFIX TREE. International Journal of Foundations of Computer Science. 10.1142/S0129054109007066. 20:06. (1109-1133). Online publication date: 1-Dec-2009.

    http://www.worldscientific.com/doi/abs/10.1142/S0129054109007066

  • GALLÉ M, PETERLONGO P and COSTE F. (2009). IN-PLACE UPDATE OF SUFFIX ARRAY WHILE RECODING WORDS. International Journal of Foundations of Computer Science. 10.1142/S0129054109007029. 20:06. (1025-1045). Online publication date: 1-Dec-2009.

    http://www.worldscientific.com/doi/abs/10.1142/S0129054109007029

  • Novosad T, Snasel V, Abraham A and Yang J. (2009). Prosima: Protein similarity algorithm 2009 World Congress on Nature & Biologically Inspired Computing (NaBIC 2009). 10.1109/NABIC.2009.5393605. 978-1-4244-5053-4. (84-91).

    http://ieeexplore.ieee.org/document/5393605/

  • Ghoting A and Makarychev K. Indexing genomic sequences on the IBM Blue Gene. Proceedings of the Conference on High Performance Computing Networking, Storage and Analysis. (1-11).

    https://doi.org/10.1145/1654059.1654122

  • Tomohiro I, Deguchi S, Bannai H, Inenaga S and Takeda M. Lightweight Parameterized Suffix Array Construction. Combinatorial Algorithms. (312-323).

    https://doi.org/10.1007/978-3-642-10217-2_31

  • Wang R, Wang X, Li Z, Tang H, Reiter M and Dong Z. Privacy-preserving genomic computation through program specialization. Proceedings of the 16th ACM conference on Computer and communications security. (338-347).

    https://doi.org/10.1145/1653662.1653703

  • Barsky M, Stege U, Thomo A and Upton C. Suffix trees for very large genomic sequences. Proceedings of the 18th ACM conference on Information and knowledge management. (1417-1420).

    https://doi.org/10.1145/1645953.1646134

  • Tang N, Sidirourgos L and Boncz P. Space-economical partial gram indices for exact substring matching. Proceedings of the 18th ACM conference on Information and knowledge management. (285-294).

    https://doi.org/10.1145/1645953.1645992

  • Haque M, Kalyanaraman A, Dhingra A, Abu-Lail N and Graybeal K. DNAjig. Proceedings of the 2009 IEEE International Conference on Bioinformatics and Biomedicine. (379-383).

    https://doi.org/10.1109/BIBM.2009.71

  • Hon W, Shah R and Vitter J. Space-Efficient Framework for Top-k String Retrieval Problems. Proceedings of the 2009 50th Annual IEEE Symposium on Foundations of Computer Science. (713-722).

    https://doi.org/10.1109/FOCS.2009.19

  • Polański A, Pokrzywa R and Kimmel M. A Survey of Text Processing Tools for the Automatic Analysis of Molecular Sequences. Aspects of Natural Language Processing. (359-378).

    https://doi.org/10.1007/978-3-642-04735-0_15

  • Federico M and Pisanti N. (2009). Suffix tree characterization of maximal motifs in biological sequences. Theoretical Computer Science. 410:43. (4391-4401). Online publication date: 1-Oct-2009.

    https://doi.org/10.1016/j.tcs.2009.07.020

  • Ping Wang , Abowd G and Rehg J. (2009). Quasi-periodic event analysis for social game retrieval 2009 IEEE 12th International Conference on Computer Vision (ICCV). 10.1109/ICCV.2009.5459151. 978-1-4244-4420-5. (112-119).

    http://ieeexplore.ieee.org/document/5459151/

  • Song G, Cui B, Zheng B, Xie K and Yang D. (2009). Accelerating sequence searching: dimensionality reduction method. Knowledge and Information Systems. 20:3. (301-322). Online publication date: 31-Aug-2009.

    https://doi.org/10.1007/s10115-008-0180-0

  • Hon W, Shah R, Thankachan S and Vitter J. On Entropy-Compressed Text Indexing in External Memory. Proceedings of the 16th International Symposium on String Processing and Information Retrieval. (75-89).

    https://doi.org/10.1007/978-3-642-03784-9_8

  • Lee T, Na J and Park K. On-Line Construction of Parameterized Suffix Trees. Proceedings of the 16th International Symposium on String Processing and Information Retrieval. (31-38).

    https://doi.org/10.1007/978-3-642-03784-9_4

  • Hon W, Shah R and Wu S. Efficient Index for Retrieving Top-k Most Frequent Documents. Proceedings of the 16th International Symposium on String Processing and Information Retrieval. (182-193).

    https://doi.org/10.1007/978-3-642-03784-9_18

  • Martens S. Quantitative analysis of treebanks using frequent subtree mining methods. Proceedings of the 2009 Workshop on Graph-based Methods for Natural Language Processing. (84-92).

    /doi/10.5555/1708124.1708140

  • Smyth W and Yusufu M. (2009). Computing regularities in strings 2009 2nd IEEE International Conference on Computer Science and Information Technology. 10.1109/ICCSIT.2009.5234544. 978-1-4244-4519-6. (298-302).

    http://ieeexplore.ieee.org/document/5234544/

  • Lee I, Iliopoulos C and Ohn S. Transformation of Suffix Arrays into Suffix Trees on the MPI Environment. Proceedings of the 11th International Conference on Rough Sets, Fuzzy Sets, Data Mining and Granular Computing. (248-255).

    https://doi.org/10.1007/978-3-540-72530-5_29

  • Lo Y, Lee C and Wang C. (2009). Scalable multi-feature index structure for music databases. Information Sciences: an International Journal. 179:15. (2662-2675). Online publication date: 1-Jul-2009.

    https://doi.org/10.1016/j.ins.2009.03.019

  • Ghoting A and Makarychev K. Serial and parallel methods for i/o efficient suffix tree construction. Proceedings of the 2009 ACM SIGMOD International Conference on Management of data. (827-840).

    https://doi.org/10.1145/1559845.1559931

  • Wang L, Chng E and Li H. Efficient sparse self-similarity matrix construction for repeating sequence detection. Proceedings of the 2009 IEEE international conference on Multimedia and Expo. (458-461).

    /doi/10.5555/1698924.1699037

  • Chiu S, Chiu S and Huang J. On Mining Repeating Pattern with Gap Constraint. Proceedings of the 2009 11th IEEE International Conference on High Performance Computing and Communications. (557-562).

    https://doi.org/10.1109/HPCC.2009.65

  • Monostori K, Zaslavsky A and Vajk I. Suffix Vector. Proceedings of the 12th International Symposium on Algorithms and Computation. (707-718).

    https://doi.org/10.1007/3-540-45678-3_60

  • Grossi R. Text Indexing, Suffix Sorting, and Data Compression. Proceedings of the 20th Annual Symposium on Combinatorial Pattern Matching - Volume 5577. (39-40).

    /doi/10.5555/3127091.3127095

  • Keller O, Kopelowitz T, Landau S and Lewenstein M. Generalized Substring Compression. Proceedings of the 20th Annual Symposium on Combinatorial Pattern Matching - Volume 5577. (26-38).

    /doi/10.5555/3127091.3127094

  • Wang L, Chng E and Li H. (2009). Efficient sparse self-similarity matrix construction for repeating sequence detection 2009 IEEE International Conference on Multimedia and Expo (ICME). 10.1109/ICME.2009.5202533. 978-1-4244-4290-4. (458-461).

    http://ieeexplore.ieee.org/document/5202533/

  • Knopke I and Jürgensen F. (2009). A System for Identifying Common Melodic Phrases in the Masses of Palestrina. Journal of New Music Research. 10.1080/09298210903288329. 38:2. (171-181). Online publication date: 1-Jun-2009.

    http://www.tandfonline.com/doi/abs/10.1080/09298210903288329

  • Apostolico A and Satta G. (2009). Discovering subword associations in strings in time linear in the output size. Journal of Discrete Algorithms. 7:2. (227-238). Online publication date: 1-Jun-2009.

    https://doi.org/10.1016/j.jda.2007.02.003

  • Roy C, Cordy J and Koschke R. (2009). Comparison and evaluation of code clone detection techniques and tools. Science of Computer Programming. 74:7. (470-495). Online publication date: 1-May-2009.

    https://doi.org/10.1016/j.scico.2009.02.007

  • Wu Z, Na J, Kim M and Kim D. (2009). Improving Lookup Time Complexity of Compressed Suffix Arrays using Multi-ary Wavelet Tree. Journal of Computing Science and Engineering. 10.5626/JCSE.2009.3.1.001. 3:1. (1-4). Online publication date: 31-Mar-2009.

    http://koreascience.or.kr/journal/view.jsp?kj=E1EIKI&py=2009&vnc=v3n1&sp=1

  • König A, Church K and Markov M. A Data Structure for Sponsored Search. Proceedings of the 2009 IEEE International Conference on Data Engineering. (90-101).

    https://doi.org/10.1109/ICDE.2009.37

  • Göde N and Koschke R. Incremental Clone Detection. Proceedings of the 2009 European Conference on Software Maintenance and Reengineering. (219-228).

    https://doi.org/10.1109/CSMR.2009.20

  • Schaeckeler S and Shang W. Procedural Abstraction with Reverse Prefix Trees. Proceedings of the 7th annual IEEE/ACM International Symposium on Code Generation and Optimization. (243-253).

    https://doi.org/10.1109/CGO.2009.25

  • Haque W, Aravind A and Reddy B. Pairwise sequence alignment algorithms. Proceedings of the 2009 conference on Information Science, Technology and Applications. (96-103).

    https://doi.org/10.1145/1551950.1551980

  • Moffat A, Puglisi S and Sinha R. Reducing Space Requirements for Disk Resident Suffix Arrays. Proceedings of the 14th International Conference on Database Systems for Advanced Applications. (730-744).

    https://doi.org/10.1007/978-3-642-00887-0_63

  • Amir A, Butman A, Lewenstein M and Porat E. (2009). Real Two Dimensional Scaled Matching. Algorithmica. 53:3. (314-336). Online publication date: 1-Mar-2009.

    /doi/10.5555/3118778.3119187

  • Cho Y and Lee S. (2009). Document Clustering with Relational Graph Of Common Phrase and Suffix Tree Document Model. The Journal of the Korea Contents Association. 10.5392/JKCA.2009.9.2.142. 9:2. (142-151). Online publication date: 28-Feb-2009.

    http://koreascience.or.kr/journal/view.jsp?kj=CCTHCV&py=2009&vnc=v9n2&sp=142

  • Park J and Kang H. (2009). Efficient Processing Technique for Unavailable Data in Hardware Implementation of Motion Estimator with Parallel Processing Architecture. The Journal of the Korea Contents Association. 10.5392/JKCA.2009.9.2.001. 9:2. (1-9). Online publication date: 28-Feb-2009.

    http://koreascience.or.kr/journal/view.jsp?kj=CCTHCV&py=2009&vnc=v9n2&sp=1

  • Lo Y and Tsai L. Real-valued feature indexing for music databases. Proceedings of the 3rd International Conference on Ubiquitous Information Management and Communication. (550-556).

    https://doi.org/10.1145/1516241.1516337

  • Hon W, Sadakane K and Sung W. (2009). Breaking a Time-and-Space Barrier in Constructing Full-Text Indices. SIAM Journal on Computing. 38:6. (2162-2178). Online publication date: 1-Feb-2009.

    https://doi.org/10.1137/070685373

  • Golynski A. Cell probe lower bounds for succinct data structures. Proceedings of the twentieth annual ACM-SIAM symposium on Discrete algorithms. (625-634).

    /doi/10.5555/1496770.1496839

  • Kouris I, Makris C, Theodoridis E and Tsakalidis A. Indexing Textual Information. Encyclopedia of Information Science and Technology, Second Edition. 10.4018/978-1-60566-026-4.ch302. (1917-1922).

    http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/978-1-60566-026-4.ch302

  • Rusu R, Bandouch J, Meier F, Essa I and Beetz M. (2012). Human Action Recognition Using Global Point Feature Histograms and Action Shapes. Advanced Robotics. 10.1163/016918609X12518783330243. 23:14. (1873-1908). Online publication date: 1-Jan-2009.

    https://www.tandfonline.com/doi/full/10.1163/016918609X12518783330243

  • Askitis N and Zobel J. (2009). B-tries for disk-based string management. The VLDB Journal — The International Journal on Very Large Data Bases. 18:1. (157-179). Online publication date: 1-Jan-2009.

    https://doi.org/10.1007/s00778-008-0094-1

  • Ferreira A, Oliveira A and Figueiredo M. (2009). On the Suitability of Suffix Arrays for Lempel-Ziv Data Compression. e-Business and Telecommunications. 10.1007/978-3-642-05197-5_19. (267-280).

    http://link.springer.com/10.1007/978-3-642-05197-5_19

  • Ikeda D and Suzuki E. (2009). Mining Peculiar Compositions of Frequent Substrings from Sparse Text Data Using Background Texts. Machine Learning and Knowledge Discovery in Databases. 10.1007/978-3-642-04180-8_56. (596-611).

    http://link.springer.com/10.1007/978-3-642-04180-8_56

  • Grossi R. (2009). Text Indexing, Suffix Sorting, and Data Compression: Common Problems and Techniques. Combinatorial Pattern Matching. 10.1007/978-3-642-02441-2_4. (39-40).

    http://link.springer.com/10.1007/978-3-642-02441-2_4

  • Keller O, Kopelowitz T, Landau S and Lewenstein M. (2009). Generalized Substring Compression. Combinatorial Pattern Matching. 10.1007/978-3-642-02441-2_3. (26-38).

    http://link.springer.com/10.1007/978-3-642-02441-2_3

  • Kahveci T. (2009). Index Structures for Biological Sequences. Encyclopedia of Database Systems. 10.1007/978-0-387-39940-9_1434. (1428-1432).

    http://link.springer.com/10.1007/978-0-387-39940-9_1434

  • Abouelhoda M and Dawood A. (2008). Fine Tuning the Enhanced Suffix Array 2008 Cairo International Biomedical Engineering Conference (CIBEC). 10.1109/CIBEC.2008.4786047. 978-1-4244-2694-2. (1-4).

    http://ieeexplore.ieee.org/document/4786047/

  • Falke R, Frenzel P and Koschke R. (2008). Empirical evaluation of clone detection using syntax suffix trees. Empirical Software Engineering. 13:6. (601-643). Online publication date: 1-Dec-2008.

    https://doi.org/10.1007/s10664-008-9073-9

  • Wu C and Kalyanaraman A. An efficient parallel approach for identifying protein families in large-scale metagenomic data sets. Proceedings of the 2008 ACM/IEEE conference on Supercomputing. (1-10).

    /doi/10.5555/1413370.1413406

  • Kim D, Kim M and Park H. (2008). Linearized Suffix Tree. Algorithmica. 52:3. (350-377). Online publication date: 1-Nov-2008.

    /doi/10.5555/3118790.3119281

  • Wu C and Kalyanaraman A. (2008). An efficient parallel approach for identifying protein families in large-scale metagenomic data sets 2008 SC - International Conference for High Performance Computing, Networking, Storage and Analysis. 10.1109/SC.2008.5214891. 978-1-4244-2834-2. (1-10).

    http://ieeexplore.ieee.org/document/5214891/

  • Crochemore M, Iliopoulos C and Rahman M. (2008). Optimal prefix and suffix queries on texts. Information Processing Letters. 108:5. (320-325). Online publication date: 1-Nov-2008.

    https://doi.org/10.1016/j.ipl.2008.05.027

  • Kim D, Kim M and Park H. (2007). Linearized Suffix Tree: an Efficient Index Data Structure with the Capabilities of Suffix Trees and Suffix Arrays. Algorithmica. 10.1007/s00453-007-9061-2. 52:3. (350-377). Online publication date: 1-Nov-2008.

    http://link.springer.com/10.1007/s00453-007-9061-2

  • Roh K, Crochemore M, Iliopoulos C and Park K. (2008). External Memory Algorithms for String Problems. Fundamenta Informaticae. 84:1. (17-32). Online publication date: 1-Sep-2008.

    /doi/10.5555/1402623.1402626

  • Koschke R. (2008). Frontiers of software clone management 2008 Frontiers of Software Maintenance (FoSM). 10.1109/FOSM.2008.4659255. 978-1-4244-2654-6. (119-128).

    http://ieeexplore.ieee.org/document/4659255/

  • Moro M, Vagena Z and Tsotras V. (2008). XML Structural Summaries. Proceedings of the VLDB Endowment. 1:2. (1524-1525). Online publication date: 1-Aug-2008.

    https://doi.org/10.14778/1454159.1454221

  • Yun Chan Cho and Jae Wook Jeon . (2008). In-place reconstructible delta compression using alleviated greedy matching algorithm 2008 6th IEEE International Conference on Industrial Informatics (INDIN). 10.1109/INDIN.2008.4618359. 978-1-4244-2170-1. (1596-1601).

    http://ieeexplore.ieee.org/document/4618359/

  • Hajirasouliha I, Hormozdiari F, Sahinalp S and Birol I. (2008). Optimal pooling for genome re-sequencing with ultra-high-throughput short-read technologies. Bioinformatics. 24:13. (i32-i40). Online publication date: 1-Jul-2008.

    https://doi.org/10.1093/bioinformatics/btn173

  • Kolak O and Schilit B. Generating links by mining quotations. Proceedings of the nineteenth ACM conference on Hypertext and hypermedia. (117-126).

    https://doi.org/10.1145/1379092.1379117

  • Zeng D, Wei D, Chau M and Wang F. Chinese Word Segmentation for Terrorism-Related Contents. Proceedings of the IEEE ISI 2008 PAISI, PACCF, and SOCO international workshops on Intelligence and Security Informatics. (1-13).

    https://doi.org/10.1007/978-3-540-69304-8_1

  • Sinha R, Puglisi S, Moffat A and Turpin A. Improving suffix array locality for fast pattern matching on disk. Proceedings of the 2008 ACM SIGMOD international conference on Management of data. (661-672).

    https://doi.org/10.1145/1376616.1376683

  • Rieck K and Laskov P. (2008). Linear-Time Computation of Similarity Measures for Sequential Data. The Journal of Machine Learning Research. 9. (23-48). Online publication date: 1-Jun-2008.

    /doi/10.5555/1390681.1390683

  • Bing Ni , Wong M and Leung K. (2008). N-SAMSAM : A simple and faster algorithm for solving approximate matching in DNA sequences 2008 IEEE Congress on Evolutionary Computation (CEC). 10.1109/CEC.2008.4631146. 978-1-4244-1822-0. (2592-2598).

    http://ieeexplore.ieee.org/document/4631146/

  • Jiau H and Chang C. (2008). A Dual Ternary Indexing Approach for Music Retrieval System. Journal of Advanced Computational Intelligence and Intelligent Informatics. 10.20965/jaciii.2008.p0227. 12:3. (227-233). Online publication date: 20-May-2008.

    https://www.fujipress.jp/jaciii/jc/jacii001200030227

  • Kang T and Yoo J. (2008). Mining Maximal Frequent Contiguous Sequences in Biological Data Sequences. The KIPS Transactions:PartD. 10.3745/KIPSTD.2008.15-D.2.155. 15D:2. (155-162). Online publication date: 30-Apr-2008.

    http://koreascience.or.kr/journal/view.jsp?kj=JBCRGX&py=2008&vnc=v15Dn2&sp=155

  • Pizzi C and Ukkonen E. (2008). Fast profile matching algorithms – A survey. Theoretical Computer Science. 395:2-3. (137-157). Online publication date: 20-Apr-2008.

    https://doi.org/10.1016/j.tcs.2008.01.015

  • Amir A, Chencinski E, Iliopoulos C, Kopelowitz T and Zhang H. (2008). Property matching and weighted matching. Theoretical Computer Science. 395:2-3. (298-310). Online publication date: 20-Apr-2008.

    https://doi.org/10.1016/j.tcs.2008.01.006

  • Ziv J. On Finite Memory Universal Data Compression and Classification of Individual Sequences. IEEE Transactions on Information Theory. 10.1109/TIT.2008.917666. 54:4. (1626-1636).

    http://ieeexplore.ieee.org/document/4475395/

  • Lo Y, Lee W and Chang L. (2008). True suffix tree approach for discovering non-trivial repeating patterns in a music object. Multimedia Tools and Applications. 37:2. (169-187). Online publication date: 1-Apr-2008.

    https://doi.org/10.1007/s11042-007-0138-3

  • Eltabakh M, Hon W, Shah R, Aref W and Vitter J. The SBC-tree. Proceedings of the 11th international conference on Extending database technology: Advances in database technology. (523-534).

    https://doi.org/10.1145/1353343.1353407

  • Cui B, Jagadish H, Ooi B and Tan K. Compacting music signatures for efficient music retrieval. Proceedings of the 11th international conference on Extending database technology: Advances in database technology. (229-240).

    https://doi.org/10.1145/1353343.1353374

  • Wang M, Wu Y and Tsai M. Exploiting Frequent Episodes in Weighted Suffix Tree to Improve Intrusion Detection System. Proceedings of the 22nd International Conference on Advanced Information Networking and Applications - Workshops. (1246-1252).

    https://doi.org/10.1109/WAINA.2008.144

  • Hon W, Lam T, Shah R, Tam S and Vitter J. Compressed Index for Dictionary Matching. Proceedings of the Data Compression Conference. (23-32).

    https://doi.org/10.1109/DCC.2008.62

  • Lam T, Sung W, Tam S, Wong C and Yiu S. (2008). Compressed indexing and local alignment of DNA. Bioinformatics. 24:6. (791-797). Online publication date: 1-Mar-2008.

    https://doi.org/10.1093/bioinformatics/btn032

  • Iliopoulos C and Rahman M. Indexing circular patterns. Proceedings of the 2nd international conference on Algorithms and computation. (46-57).

    /doi/10.5555/1787651.1787658

  • Schulz M, Bauer S and Robinson P. (2008). The generalised k-Truncated Suffix Tree for time-and space-efficient searches in multiple DNA or protein sequences. International Journal of Bioinformatics Research and Applications. 4:1. (81-95). Online publication date: 1-Feb-2008.

    https://doi.org/10.1504/IJBRA.2008.017165

  • HIGA Y, BANNAI H, INENAGA S and TAKEDA M. (2008). REACHABILITY ON SUFFIX TREE GRAPHS. International Journal of Foundations of Computer Science. 10.1142/S0129054108005590. 19:01. (147-162). Online publication date: 1-Feb-2008.

    http://www.worldscientific.com/doi/abs/10.1142/S0129054108005590

  • PETERLONGO P, ALLALI J and SAGOT M. (2008). INDEXING GAPPED-FACTORS USING A TREE. International Journal of Foundations of Computer Science. 10.1142/S0129054108005541. 19:01. (71-87). Online publication date: 1-Feb-2008.

    http://www.worldscientific.com/doi/abs/10.1142/S0129054108005541

  • Zhuge H and Feng L. (2008). Distributed Suffix Tree Overlay for Peer-to-Peer Search. IEEE Transactions on Knowledge and Data Engineering. 20:2. (276-285). Online publication date: 1-Feb-2008.

    https://doi.org/10.1109/TKDE.2007.190688

  • Amir A and Nor I. Real-time indexing over fixed finite alphabets. Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms. (1086-1095).

    /doi/10.5555/1347082.1347201

  • Roh K, Crochemore M, Iliopoulos C and Park K. (2008). External Memory Algorithms for String Problems. Fundamenta Informaticae. 84:1. (17-32). Online publication date: 1-Jan-2008.

    /doi/10.5555/2365293.2365296

  • Grimsmo N. Faster path indexes for search in XML data. Proceedings of the nineteenth conference on Australasian database - Volume 75. (127-135).

    /doi/10.5555/1378307.1378330

  • Vitter J. (2008). Algorithms and data structures for external memory. Foundations and Trends® in Theoretical Computer Science. 2:4. (305-474). Online publication date: 1-Jan-2008.

    https://doi.org/10.1561/0400000014

  • Li Y, Chung S and Holt J. (2008). Text document clustering based on frequent word meaning sequences. Data & Knowledge Engineering. 64:1. (381-404). Online publication date: 1-Jan-2008.

    https://doi.org/10.1016/j.datak.2007.08.001

  • Puglisi S and Turpin A. (2008). Space-Time Tradeoffs for Longest-Common-Prefix Array Computation. Algorithms and Computation. 10.1007/978-3-540-92182-0_14. (124-135).

    http://link.springer.com/10.1007/978-3-540-92182-0_14

  • Ozcan G and Alpkocak A. (2008). Online Suffix Tree Construction for Streaming Sequences. Advances in Computer Science and Engineering. 10.1007/978-3-540-89985-3_9. (69-81).

    http://link.springer.com/10.1007/978-3-540-89985-3_9

  • Iliopoulos C and Rahman M. Indexing Circular Patterns. WALCOM: Algorithms and Computation. 10.1007/978-3-540-77891-2_5. (46-57).

    http://link.springer.com/10.1007/978-3-540-77891-2_5

  • Federico M and Pisanti N. Suffix Tree Characterization of Maximal Motifs in Biological Sequences. Bioinformatics Research and Development. 10.1007/978-3-540-70600-7_35. (456-465).

    http://link.springer.com/10.1007/978-3-540-70600-7_35

  • Gao F and Zaki M. (2008). Indexing Protein Structures Using Suffix Trees. Protein Structure Prediction. 10.1007/978-1-59745-574-9_6. (147-169).

    http://link.springer.com/10.1007/978-1-59745-574-9_6

  • Na J, Ferragina P, Giancarlo R and Park K. (2008). Two-Dimensional Pattern Indexing. Encyclopedia of Algorithms. 10.1007/978-0-387-30162-4_442. (979-982).

    https://link.springer.com/10.1007/978-0-387-30162-4_442

  • Stoye J. (2008). Suffix Tree Construction in RAM. Encyclopedia of Algorithms. 10.1007/978-0-387-30162-4_414. (925-928).

    https://link.springer.com/10.1007/978-0-387-30162-4_414

  • Lewenstein M. (2008). Parameterized Matching. Encyclopedia of Algorithms. 10.1007/978-0-387-30162-4_282. (635-638).

    https://link.springer.com/10.1007/978-0-387-30162-4_282

  • Crochemore M, Gabriele A, Mignosi F and Pesaresi M. On the Longest Common Factor Problem. Fifth Ifip International Conference On Theoretical Computer Science – Tcs 2008. 10.1007/978-0-387-09680-3_10. (143-155).

    http://link.springer.com/10.1007/978-0-387-09680-3_10

  • Lam T, Sung W, Tam S and Yiu S. Space efficient indexes for string matching with don't cares. Proceedings of the 18th international conference on Algorithms and computation. (846-857).

    /doi/10.5555/1781574.1781668

  • Strothmann D. (2007). The affix array data structure and its applications to RNA secondary structure analysis. Theoretical Computer Science. 389:1-2. (278-294). Online publication date: 10-Dec-2007.

    https://doi.org/10.1016/j.tcs.2007.09.029

  • Giancarlo R, Siragusa A, Siragusa E and Utro F. (2007). A basic analysis toolkit for biological sequences. Algorithms for Molecular Biology. 10.1186/1748-7188-2-10. 2:1. Online publication date: 1-Dec-2007.

    https://almob.biomedcentral.com/articles/10.1186/1748-7188-2-10

  • Schones D, Smith A and Zhang M. (2007). Statistical significance of cis-regulatory modules. BMC Bioinformatics. 10.1186/1471-2105-8-19. 8:1. Online publication date: 1-Dec-2007.

    https://bmcbioinformatics.biomedcentral.com/articles/10.1186/1471-2105-8-19

  • Maaí M and Nowak J. (2007). Text indexing with errors. Journal of Discrete Algorithms. 5:4. (662-681). Online publication date: 1-Dec-2007.

    https://doi.org/10.1016/j.jda.2006.11.001

  • Gupta V. (2007). A Keyword Searching Algorithm For Search Engines 2007 Innovations in Information Technologies (IIT). 10.1109/IIT.2007.4430467. 978-1-4244-1840-4. (203-207).

    http://ieeexplore.ieee.org/document/4430467/

  • Ota T and Morita H. (2007). On the Construction of an Antidictionary with Linear Complexity Using the Suffix Tree. IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences. E90-A:11. (2533-2539). Online publication date: 1-Nov-2007.

    https://doi.org/10.1093/ietfec/e90-a.11.2533

  • Shibuya T. Prefix-shuffled geometric suffix tree. Proceedings of the 14th international conference on String processing and information retrieval. (300-309).

    /doi/10.5555/1778666.1778693

  • Martinovic J, Novosad T and Snasel V. (2007). Vector model improvement using suffix trees 2007 2nd International Conference on Digital Information Management. 10.1109/ICDIM.2007.4444220. 978-1-4244-1475-8. (180-187).

    http://ieeexplore.ieee.org/document/4444220/

  • Hamid R, Maddi S, Bobick A and Essa I. (2007). Structure from Statistics - Unsupervised Activity Analysis using Suffix Trees 2007 IEEE 11th International Conference on Computer Vision. 10.1109/ICCV.2007.4408894. 978-1-4244-1630-1. (1-8).

    http://ieeexplore.ieee.org/document/4408894/

  • Huo H and Stojkovic V. (2007). A Suffix Tree Construction Algorithm for DNA Sequences 2007 IEEE 7th International Symposium on BioInformatics and BioEngineering. 10.1109/BIBE.2007.4375711. 1-4244-1509-8. (1178-1182).

    http://ieeexplore.ieee.org/document/4375711/

  • Kang T, Yoo J and Kim H. (2007). Mining Frequent Contiguous Sequence Patterns in Biological Sequences 2007 IEEE 7th International Symposium on BioInformatics and BioEngineering. 10.1109/BIBE.2007.4375640. 1-4244-1509-8. (723-728).

    http://ieeexplore.ieee.org/document/4375640/

  • Blanchet-Sadri F and Wetzler N. (2007). Partial words and the critical factorization theorem revisited. Theoretical Computer Science. 385:1-3. (179-192). Online publication date: 1-Oct-2007.

    https://doi.org/10.1016/j.tcs.2007.06.012

  • Nandi A and Jagadish H. Effective phrase prediction. Proceedings of the 33rd international conference on Very large data bases. (219-230).

    /doi/10.5555/1325851.1325879

  • Basit H and Jarzabek S. Efficient token based clone detection with flexible tokenization. Proceedings of the the 6th joint meeting of the European software engineering conference and the ACM SIGSOFT symposium on The foundations of software engineering. (513-516).

    https://doi.org/10.1145/1287624.1287698

  • Stephenson B. An efficient algorithm for identifying the most contributory substring. Proceedings of the 9th international conference on Data Warehousing and Knowledge Discovery. (272-282).

    /doi/10.5555/2391952.2391985

  • Basit H, Puglisi S, Smyth W, Turpin A and Jarzabek S. Efficient token based clone detection with flexible tokenization. The 6th Joint Meeting on European software engineering conference and the ACM SIGSOFT symposium on the foundations of software engineering: companion papers. (513-516).

    https://doi.org/10.1145/1295014.1295029

  • Bellon S, Koschke R, Antoniol G, Krinke J and Merlo E. (2007). Comparison and Evaluation of Clone Detection Tools. IEEE Transactions on Software Engineering. 33:9. (577-591). Online publication date: 1-Sep-2007.

    https://doi.org/10.1109/TSE.2007.70725

  • Baker B. (2007). Finding Clones with Dup. IEEE Transactions on Software Engineering. 33:9. (608-621). Online publication date: 1-Sep-2007.

    https://doi.org/10.1109/TSE.2007.70720

  • Liu J, Ma B and Zhang K. (2007). An algorithm for searching RNA motifs in genomic sequences. Biomolecular Engineering. 10.1016/j.bioeng.2007.02.005. 24:3. (343-350). Online publication date: 1-Sep-2007.

    http://linkinghub.elsevier.com/retrieve/pii/S1389034407000263

  • Crochemore M, Iliopoulos C and Rahman M. Finding patterns in given intervals. Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science. (645-656).

    /doi/10.5555/2392236.2392314

  • Keller O, Kopelowitz T and Lewenstein M. Range non-overlapping indexing and successive list indexing. Proceedings of the 10th international conference on Algorithms and Data Structures. (625-636).

    /doi/10.5555/2394893.2394967

  • Lam T, Sung W, Tam S, Wong C and Yiu S. An experimental study of compressed indexing and local alignments of DNA. Proceedings of the 1st international conference on Combinatorial optimization and applications. (242-254).

    /doi/10.5555/1779837.1779866

  • Kim D, Na J, Sim J and Park K. A simple construction of two-dimensional suffix trees in linear time. Proceedings of the 18th annual conference on Combinatorial Pattern Matching. (352-364).

    /doi/10.5555/2394373.2394419

  • Narisawa K, Inenaga S, Bannai H and Takeda M. Efficient computation of substring equivalence classes with suffix arrays. Proceedings of the 18th annual conference on Combinatorial Pattern Matching. (340-351).

    /doi/10.5555/2394373.2394418

  • Chen G, Puglisi S and Smyth W. Fast and practical algorithms for computing all the runs in a string. Proceedings of the 18th annual conference on Combinatorial Pattern Matching. (307-315).

    /doi/10.5555/2394373.2394414

  • Hon W, Lam T, Shah R, Tam S and Vitter J. Cache-oblivious index for approximate string matching. Proceedings of the 18th annual conference on Combinatorial Pattern Matching. (40-51).

    /doi/10.5555/2394373.2394383

  • Kent C, Lewenstein M and Sheinwald D. On demand string sorting over unbounded alphabets. Proceedings of the 18th annual conference on Combinatorial Pattern Matching. (16-27).

    /doi/10.5555/2394373.2394380

  • Sciortino M and Zamboni L. Suffix automata and standard sturmian words. Proceedings of the 11th international conference on Developments in language theory. (382-398).

    /doi/10.5555/1770310.1770348

  • VILLAR N, GILLEADE K, RAMDUNYELLIS D and GELLERSEN H. (2007). The VoodooIO gaming kit. Computers in Entertainment. 5:3. (7). Online publication date: 1-Jul-2007.

    https://doi.org/10.1145/1316511.1316518

  • Chen L and Hu B. (2007). An Implementation of Web Based Query by Humming System Multimedia and Expo, 2007 IEEE International Conference on. 10.1109/ICME.2007.4284938. 1-4244-1016-9. (1467-1470).

    http://ieeexplore.ieee.org/document/4284938/

  • Lo Y and Wang C. (2007). Hybrid Multi-Feature Indexing for Music Data Retrieval 6th IEEE/ACIS International Conference on Computer and Information Science (ICIS 2007). 10.1109/ICIS.2007.109. 0-7695-2841-4. (543-548).

    http://ieeexplore.ieee.org/document/4276438/

  • Angelov S, Harb B, Kannan S, Khanna S and Kim J. (2007). Efficient Enumeration of Phylogenetically Informative Substrings. Journal of Computational Biology. 10.1089/cmb.2007.R011. 14:6. (701-723). Online publication date: 1-Jul-2007.

    http://www.liebertpub.com/doi/10.1089/cmb.2007.R011

  • Franceschini G and Muthukrishnan S. Optimal suffix selection. Proceedings of the thirty-ninth annual ACM symposium on Theory of computing. (328-337).

    https://doi.org/10.1145/1250790.1250840

  • Phoophakdee B and Zaki M. Genome-scale disk-based suffix tree indexing. Proceedings of the 2007 ACM SIGMOD international conference on Management of data. (833-844).

    https://doi.org/10.1145/1247480.1247572

  • Seo D, Yoo J and Cho K. An Efficient XML Index Structure with Bottom-Up Query Processing. Proceedings of the 7th international conference on Computational Science, Part III: ICCS 2007. (813-820).

    https://doi.org/10.1007/978-3-540-72588-6_131

  • Cambouropoulos E, Crochemore M, Iliopoulos C, Mohamed M and Sagot M. (2007). All maximal-pairs in step-leap representation of melodic sequence. Information Sciences: an International Journal. 177:9. (1954-1962). Online publication date: 1-May-2007.

    /doi/10.5555/1225944.1226019

  • Chan H, Hon W, Lam T and Sadakane K. (2007). Compressed indexes for dynamic text collections. ACM Transactions on Algorithms. 3:2. (21-es). Online publication date: 1-May-2007.

    https://doi.org/10.1145/1240233.1240244

  • Ferragina P, Manzini G, Mäkinen V and Navarro G. (2007). Compressed representations of sequences and full-text indexes. ACM Transactions on Algorithms. 3:2. (20-es). Online publication date: 1-May-2007.

    https://doi.org/10.1145/1240233.1240243

  • Amir A, Landau G, Lewenstein M and Sokol D. (2007). Dynamic text and static pattern matching. ACM Transactions on Algorithms. 3:2. (19-es). Online publication date: 1-May-2007.

    https://doi.org/10.1145/1240233.1240242

  • Kauers M. (2007). An algorithm for deciding zero equivalence of nested polynomially recurrent sequences. ACM Transactions on Algorithms. 3:2. (18-es). Online publication date: 1-May-2007.

    https://doi.org/10.1145/1240233.1240241

  • Chern H, Fuchs M and Hwang H. (2007). Phase changes in random point quadtrees. ACM Transactions on Algorithms. 3:2. (12-es). Online publication date: 1-May-2007.

    https://doi.org/10.1145/1240233.1240235

  • Cambouropoulos E, Crochemore M, Iliopoulos C, Mohamed M and Sagot M. (2007). All maximal-pairs in step–leap representation of melodic sequence. Information Sciences. 10.1016/j.ins.2006.11.012. 177:9. (1954-1962). Online publication date: 1-May-2007.

    http://linkinghub.elsevier.com/retrieve/pii/S0020025506003525

  • Abulaish M and Dey L. (2007). Biological relation extraction and query answering from MEDLINE abstracts using ontology-based text mining. Data & Knowledge Engineering. 61:2. (228-262). Online publication date: 1-May-2007.

    https://doi.org/10.1016/j.datak.2006.06.007

  • Navarro G and Mäkinen V. (2007). Compressed full-text indexes. ACM Computing Surveys. 39:1. (2-es). Online publication date: 12-Apr-2007.

    https://doi.org/10.1145/1216370.1216372

  • Wang W, Peng D, Wang H and Sharif H. (2007). Image Component Transmissions in Wireless Sensor Network 2007 IEEE Sarnoff Symposium. 10.1109/SARNOF.2007.4567351. 978-1-4244-2483-2. (1-5).

    http://ieeexplore.ieee.org/document/4567351/

  • Wang J, Kesidis G and Miller D. (2007). New directions in covert malware modeling which exploit white-listing 2007 IEEE Sarnoff Symposium. 10.1109/SARNOF.2007.4567340. 978-1-4244-2483-2. (1-7).

    http://ieeexplore.ieee.org/document/4567340/

  • Halachev M, Shiri N and Thamildurai A. Efficient and scalable indexing techniques for biological sequence data. Proceedings of the 1st international conference on Bioinformatics research and development. (464-479).

    /doi/10.5555/1762370.1762417

  • Maaß M. (2007). Computing suffix links for suffix trees and arrays. Information Processing Letters. 10.1016/j.ipl.2005.12.012. 101:6. (250-254). Online publication date: 1-Mar-2007.

    http://linkinghub.elsevier.com/retrieve/pii/S0020019006003085

  • Askitis N and Sinha R. HAT-trie. Proceedings of the thirtieth Australasian conference on Computer science - Volume 62. (97-105).

    /doi/10.5555/1273749.1273761

  • Rahman M and Iliopoulos C. Indexing Factors with Gaps. Proceedings of the 33rd conference on Current Trends in Theory and Practice of Computer Science. (465-474).

    https://doi.org/10.1007/978-3-540-69507-3_40

  • Lämmel R. (2007). Scrap your boilerplate with XPath-like combinators. ACM SIGPLAN Notices. 42:1. (137-142). Online publication date: 17-Jan-2007.

    https://doi.org/10.1145/1190215.1190240

  • Pitts A and Shinwell M. (2007). Generative unbinding of names. ACM SIGPLAN Notices. 42:1. (85-95). Online publication date: 17-Jan-2007.

    https://doi.org/10.1145/1190215.1190232

  • Siskind J and Pearlmutter B. (2007). First-class nonstandard interpretations by opening closures. ACM SIGPLAN Notices. 42:1. (71-76). Online publication date: 17-Jan-2007.

    https://doi.org/10.1145/1190215.1190230

  • Jansson J, Sadakane K and Sung W. Ultra-succinct representation of ordered trees. Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms. (575-584).

    /doi/10.5555/1283383.1283445

  • Wang X and Johnson T. (2007). DISCOVERY OF INTERMINGLED EVENT PATTERNS IN DISCRETE MONITORING DATA. IFAC Proceedings Volumes. 10.3182/20070613-3-FR-4909.00012. 40:6. (55-60).

    http://linkinghub.elsevier.com/retrieve/pii/S1474667015310958

  • Lam T, Sung W, Tam S and Yiu S. Space Efficient Indexes for String Matching with Don’t Cares. Algorithms and Computation. 10.1007/978-3-540-77120-3_73. (846-857).

    http://link.springer.com/10.1007/978-3-540-77120-3_73

  • Shibuya T. Prefix-Shuffled Geometric Suffix Tree. String Processing and Information Retrieval. 10.1007/978-3-540-75530-2_27. (300-309).

    http://link.springer.com/10.1007/978-3-540-75530-2_27

  • Stephenson B. An Efficient Algorithm for Identifying the Most Contributory Substring. Data Warehousing and Knowledge Discovery. 10.1007/978-3-540-74553-2_25. (272-282).

    http://link.springer.com/10.1007/978-3-540-74553-2_25

  • Crochemore M, Iliopoulos C and Rahman M. Finding Patterns in Given Intervals. Mathematical Foundations of Computer Science 2007. 10.1007/978-3-540-74456-6_57. (645-656).

    http://link.springer.com/10.1007/978-3-540-74456-6_57

  • Keller O, Kopelowitz T and Lewenstein M. Range Non-overlapping Indexing and Successive List Indexing. Algorithms and Data Structures. 10.1007/978-3-540-73951-7_54. (625-636).

    http://link.springer.com/10.1007/978-3-540-73951-7_54

  • Lam T, Sung W, Tam S, Wong C and Yiu S. An Experimental Study of Compressed Indexing and Local Alignments of DNA. Combinatorial Optimization and Applications. 10.1007/978-3-540-73556-4_27. (242-254).

    http://link.springer.com/10.1007/978-3-540-73556-4_27

  • Hon W, Lam T, Shah R, Tam S and Vitter J. Cache-Oblivious Index for Approximate String Matching. Combinatorial Pattern Matching. 10.1007/978-3-540-73437-6_7. (40-51).

    http://link.springer.com/10.1007/978-3-540-73437-6_7

  • Kent C, Lewenstein M and Sheinwald D. On Demand String Sorting over Unbounded Alphabets. Combinatorial Pattern Matching. 10.1007/978-3-540-73437-6_5. (16-27).

    http://link.springer.com/10.1007/978-3-540-73437-6_5

  • Kim D, Na J, Sim J and Park K. A Simple Construction of Two-Dimensional Suffix Trees in Linear Time. Combinatorial Pattern Matching. 10.1007/978-3-540-73437-6_35. (352-364).

    http://link.springer.com/10.1007/978-3-540-73437-6_35

  • Narisawa K, Inenaga S, Bannai H and Takeda M. Efficient Computation of Substring Equivalence Classes with Suffix Arrays. Combinatorial Pattern Matching. 10.1007/978-3-540-73437-6_34. (340-351).

    http://link.springer.com/10.1007/978-3-540-73437-6_34

  • Chen G, Puglisi S and Smyth W. Fast and Practical Algorithms for Computing All the Runs in a String. Combinatorial Pattern Matching. 10.1007/978-3-540-73437-6_31. (307-315).

    http://link.springer.com/10.1007/978-3-540-73437-6_31

  • Sciortino M and Zamboni L. Suffix Automata and Standard Sturmian Words. Developments in Language Theory. 10.1007/978-3-540-73208-2_36. (382-398).

    http://link.springer.com/10.1007/978-3-540-73208-2_36

  • String Algorithms. Algorithmic Aspects of Bioinformatics. 10.1007/978-3-540-71913-7_4. (37-79).

    http://link.springer.com/10.1007/978-3-540-71913-7_4

  • Halachev M, Shiri N and Thamildurai A. Efficient and Scalable Indexing Techniques for Biological Sequence Data. Bioinformatics Research and Development. 10.1007/978-3-540-71233-6_36. (464-479).

    http://link.springer.com/10.1007/978-3-540-71233-6_36

  • Liu H, Ma Z, Zhang L and Shao W. Detecting Duplications in Sequence Diagrams Based on Suffix Trees. Proceedings of the XIII Asia Pacific Software Engineering Conference. (269-276).

    https://doi.org/10.1109/APSEC.2006.32

  • Ota T and Morita H. (2006). On the Construction of an Antidictionary of a Binary String with Linear Complexity 2006 IEEE International Symposium on Information Theory. 10.1109/ISIT.2006.262007. 1-4244-0505-X. (2343-2347).

    http://ieeexplore.ieee.org/document/4036389/

  • Chang C and Jiau H. (2006). An Efficient Numeric Indexing Technique for Music Retrieval System 2006 IEEE International Conference on Multimedia and Expo. 10.1109/ICME.2006.262947. 1-4244-0366-7. (1981-1984).

    http://ieeexplore.ieee.org/document/4037016/

  • Kärkkäinen J, Sanders P and Burkhardt S. (2006). Linear work suffix array construction. Journal of the ACM. 53:6. (918-936). Online publication date: 1-Nov-2006.

    https://doi.org/10.1145/1217856.1217858

  • Vel O. (2006). Learning Semi-Structured Document Categorization Using Bounded-Length Spectrum Sub-Sequence Kernels. Data Mining and Knowledge Discovery. 13:3. (309-334). Online publication date: 1-Nov-2006.

    https://doi.org/10.1007/s10618-005-0037-z

  • Lonardi S, Lin J, Keogh E and Chiu B. (2006). Efficient Discovery of Unusual Patterns in Time Series. New Generation Computing. 25:1. (61-93). Online publication date: 1-Nov-2006.

    https://doi.org/10.1007/s00354-006-0004-2

  • Koschke R, Falke R and Frenzel P. Clone Detection Using Abstract Syntax Suffix Trees. Proceedings of the 13th Working Conference on Reverse Engineering. (253-262).

    https://doi.org/10.1109/WCRE.2006.18

  • Coelho L and Oliveira A. Dotted suffix trees a structure for approximate text indexing. Proceedings of the 13th international conference on String Processing and Information Retrieval. (329-336).

    https://doi.org/10.1007/11880561_27

  • Puglisi S, Smyth W and Turpin A. Inverted files versus suffix arrays for locating patterns in primary memory. Proceedings of the 13th international conference on String Processing and Information Retrieval. (122-133).

    https://doi.org/10.1007/11880561_11

  • Foschini L, Grossi R, Gupta A and Vitter J. (2006). When indexing equals compression. ACM Transactions on Algorithms. 2:4. (611-639). Online publication date: 1-Oct-2006.

    https://doi.org/10.1145/1198513.1198521

  • Han S, Lee S, Hwang K and Kim Y. (2006). Gene Sequences Clustering and Identifying Functional Domain Using a Suffix Tree Algorithm 2006 SICE-ICASE International Joint Conference. 10.1109/SICE.2006.314699. 89-950038-4-7. (4672-4675).

    http://ieeexplore.ieee.org/document/4108503/

  • Wang J, Hamadeh l, Kesidis G and Miller D. Polymorphic worm detection and defense. Proceedings of the 2006 SIGCOMM workshop on Large-scale attack defense. (169-176).

    https://doi.org/10.1145/1162666.1162676

  • ElTabakh M, Aref W, Ouzzani M and Ali M. Discovering consensus patterns in biological databases. Proceedings of the First international conference on Data Mining and Bioinformatics. (170-184).

    https://doi.org/10.1007/11960669_15

  • Chan H, Lam T, Sung W, Tam S and Wong S. Compressed indexes for approximate string matching. Proceedings of the 14th conference on Annual European Symposium - Volume 14. (208-219).

    https://doi.org/10.1007/11841036_21

  • Venkateswaran J, Lachwani D, Kahveci T and Jermaine C. Reference-based indexing of sequence databases. Proceedings of the 32nd international conference on Very large data bases. (906-917).

    /doi/10.5555/1182635.1164205

  • König A and Brill E. Reducing the human overhead in text categorization. Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining. (598-603).

    https://doi.org/10.1145/1150402.1150474

  • Iliopoulos C, Makris C, Panagis Y, Perdikuri K, Theodoridis E and Tsakalidis A. (2006). The Weighted Suffix Tree: An Efficient Data Structure for Handling Molecular Weighted Sequences and its Applications. Fundamenta Informaticae. 71:2,3. (259-277). Online publication date: 1-Aug-2006.

    /doi/10.5555/2369356.2369363

  • Iliopoulos C, Makris C, Panagis Y, Perdikuri K, Theodoridis E and Tsakalidis A. (2006). The Weighted Suffix Tree: An Efficient Data Structure for Handling Molecular Weighted Sequences and its Applications. Fundamenta Informaticae. 71:2,3. (259-277). Online publication date: 1-Aug-2006.

    /doi/10.5555/1227505.1227512

  • AKUTSU T. (2006). ALGORITHMS FOR POINT SET MATCHING WITH k-DIFFERENCES. International Journal of Foundations of Computer Science. 10.1142/S0129054106004170. 17:04. (903-917). Online publication date: 1-Aug-2006.

    http://www.worldscientific.com/doi/abs/10.1142/S0129054106004170

  • Wu L. (2006). Suffix Tree Based WEB Information Search System and Optimal Index Algorithms 2006 International Conference on Machine Learning and Cybernetics. 10.1109/ICMLC.2006.259157. 1-4244-0061-9. (4450-4454).

    http://ieeexplore.ieee.org/document/4028855/

  • Decker H, Munoz-Escoi F and Armendariz-Inigo J. Toward Reconciling Availability, Consistency and Integrity in Replicated Information Systems. Proceedings of the International Multi-Conference on Computing in the Global Information Technology.

    https://doi.org/10.1109/ICCGI.2006.47

  • Cole R, Kopelowitz T and Lewenstein M. Suffix trays and suffix trists. Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I. (358-369).

    https://doi.org/10.1007/11786986_32

  • Shibuya T. Geometric suffix tree. Proceedings of the 17th Annual conference on Combinatorial Pattern Matching. (84-93).

    https://doi.org/10.1007/11780441_9

  • Ko P and Aluru S. Obtaining provably good performance from suffix trees in secondary storage. Proceedings of the 17th Annual conference on Combinatorial Pattern Matching. (72-83).

    https://doi.org/10.1007/11780441_8

  • Inenaga S and Takeda M. On-Line linear-time construction of word suffix trees. Proceedings of the 17th Annual conference on Combinatorial Pattern Matching. (60-71).

    https://doi.org/10.1007/11780441_7

  • Chan H, Lam T, Sung W, Tam S and Wong S. A linear size index for approximate pattern matching. Proceedings of the 17th Annual conference on Combinatorial Pattern Matching. (49-59).

    https://doi.org/10.1007/11780441_6

  • Christodoulakis M, Iliopoulos C, Mouchard L, Perdikuri K, Tsakalidis A and Tsichlas K. (2006). Computation of Repetitions and Regularities of Biologically Weighted Sequences. Journal of Computational Biology. 10.1089/cmb.2006.13.1214. 13:6. (1214-1231). Online publication date: 1-Jul-2006.

    http://www.liebertpub.com/doi/10.1089/cmb.2006.13.1214

  • Han S, Lee S, Kim K, Choi C, Kim Y and Hwang K. (2006). CLAGen: A tool for clustering and annotating gene sequences using a suffix tree algorithm. Biosystems. 10.1016/j.biosystems.2005.11.001. 84:3. (175-182). Online publication date: 1-Jun-2006.

    http://linkinghub.elsevier.com/retrieve/pii/S0303264705001899

  • Moro M, Vagena Z and Tsotras V. Evaluating structural summaries as access methods for XML. Proceedings of the 15th international conference on World Wide Web. (1079-1080).

    https://doi.org/10.1145/1135777.1136024

  • Tata S, Friedman J and Swaroop A. Declarative Querying for Biological Sequences. Proceedings of the 22nd International Conference on Data Engineering.

    https://doi.org/10.1109/ICDE.2006.47

  • Angelov S, Harb B, Kannan S, Khanna S and Kim J. Efficient enumeration of phylogenetically informative substrings. Proceedings of the 10th annual international conference on Research in Computational Molecular Biology. (248-264).

    https://doi.org/10.1007/11732990_22

  • Fogla P and Lee W. (2006). q-Gram Matching Using Tree Models. IEEE Transactions on Knowledge and Data Engineering. 18:4. (433-447). Online publication date: 1-Apr-2006.

    /doi/10.5555/1128596.1128757

  • Anderson E and Garza J. (2005). The Power of Single-Nucleotide Polymorphisms for Large-Scale Parentage Inference. Genetics. 10.1534/genetics.105.048074. 172:4. (2567-2582). Online publication date: 1-Apr-2006.

    http://www.genetics.org/lookup/doi/10.1534/genetics.105.048074

  • Lin C and Chen A. (2006). Indexing and matching multiple-attribute strings for efficient multimedia query processing. IEEE Transactions on Multimedia. 8:2. (408-411). Online publication date: 1-Apr-2006.

    https://doi.org/10.1109/TMM.2005.864350

  • Fogla P and Lee W. q-gram matching using tree models. IEEE Transactions on Knowledge and Data Engineering. 10.1109/TKDE.2006.1599383. 18:4. (433-447).

    http://ieeexplore.ieee.org/document/1599383/

  • Carvalho A, Freitas A, Oliveira A and Sagot M. (2006). An Efficient Algorithm for the Identification of Structured Motifs in DNA Promoter Sequences. IEEE/ACM Transactions on Computational Biology and Bioinformatics. 3:2. (126-140). Online publication date: 1-Apr-2006.

    https://doi.org/10.1109/TCBB.2006.16

  • Dori S and Landau G. (2006). Construction of Aho Corasick automaton in linear time for integer alphabets. Information Processing Letters. 10.1016/j.ipl.2005.11.019. 98:2. (66-72). Online publication date: 1-Apr-2006.

    http://linkinghub.elsevier.com/retrieve/pii/S0020019005003406

  • Senft M. Compressed by the Suffix Tree. Proceedings of the Data Compression Conference. (183-192).

    https://doi.org/10.1109/DCC.2006.11

  • Navarro G and Chávez E. (2006). A metric index for approximate string matching. Theoretical Computer Science. 352:1. (266-279). Online publication date: 7-Mar-2006.

    https://doi.org/10.1016/j.tcs.2005.11.037

  • Huynh T, Hon W, Lam T and Sung W. (2006). Approximate string matching using compressed suffix arrays. Theoretical Computer Science. 352:1. (240-249). Online publication date: 7-Mar-2006.

    https://doi.org/10.1016/j.tcs.2005.11.022

  • Maaß M. (2006). Matching statistics: efficient computation and a new practical algorithm for the multiple common substring problem. Software—Practice & Experience. 36:3. (305-331). Online publication date: 1-Mar-2006.

    /doi/10.5555/1122568.1122572

  • Fan K, Puglisi S, Smyth W and Turpin A. (2006). A New Periodicity Lemma. SIAM Journal on Discrete Mathematics. 20:3. (656-668). Online publication date: 1-Mar-2006.

    https://doi.org/10.1137/050630180

  • Maaß M. (2005). Matching statistics: efficient computation and a new practical algorithm for the multiple common substring problem. Software: Practice and Experience. 10.1002/spe.698. 36:3. (305-331). Online publication date: 1-Mar-2006.

    https://onlinelibrary.wiley.com/doi/10.1002/spe.698

  • Batu T, Ergun F and Sahinalp C. Oblivious string embeddings and edit distance approximations. Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm. (792-801).

    /doi/10.5555/1109557.1109644

  • Xue Q, Pramanik S, Qian G and Zhu Q. THE HYBRID DIGITAL TREE. Enterprise Information Systems VII. 10.1007/978-1-4020-5347-4_5. (45-51).

    http://link.springer.com/10.1007/978-1-4020-5347-4_5

  • Aluru S. Bioinformatics. Handbook of Nature-Inspired and Innovative Computing. 10.1007/0-387-27705-6_21. (657-695).

    http://link.springer.com/10.1007/0-387-27705-6_21

  • Bedathur S and Haritsa J. Search-Optimized suffix-tree storage for biological applications. Proceedings of the 12th international conference on High Performance Computing. (29-39).

    https://doi.org/10.1007/11602569_8

  • Nicolas J, Durand P, Ranchy G, Tempel S and Valin A. (2005). Suffix-tree analyser (STAN). Bioinformatics. 21:24. (4408-4410). Online publication date: 15-Dec-2005.

    https://doi.org/10.1093/bioinformatics/bti710

  • AMIR A. (2005). THEORETICAL ISSUES OF SEARCHING AERIAL PHOTOGRAPHS: A BIRD'S EYE VIEW. International Journal of Foundations of Computer Science. 10.1142/S0129054105003662. 16:06. (1075-1097). Online publication date: 1-Dec-2005.

    http://www.worldscientific.com/doi/abs/10.1142/S0129054105003662

  • Amir A, Kopelowitz T, Lewenstein M and Lewenstein N. Towards real-time suffix tree construction. Proceedings of the 12th international conference on String Processing and Information Retrieval. (67-78).

    https://doi.org/10.1007/11575832_9

  • Lee I and Ardila Y. Linear time algorithm for the generalised longest common repeat problem. Proceedings of the 12th international conference on String Processing and Information Retrieval. (191-201).

    https://doi.org/10.1007/11575832_21

  • Shapira D and Storer J. (2005). In Place Differential File Compression. The Computer Journal. 48:6. (677-691). Online publication date: 1-Nov-2005.

    https://doi.org/10.1093/comjnl/bxh128

  • Halachev M, Shiri N and Thamildurai A. Exact match search in sequence data using suffix trees. Proceedings of the 14th ACM international conference on Information and knowledge management. (123-130).

    https://doi.org/10.1145/1099554.1099579

  • Andrzejewski W, Morzy T and Morzy M. Indexing of sequences of sets for efficient exact and similar subsequence matching. Proceedings of the 20th international conference on Computer and Information Sciences. (864-873).

    https://doi.org/10.1007/11569596_88

  • Mantaci S, Restivo A, Rosone G and Sciortino M. A new combinatorial approach to sequence comparison. Proceedings of the 9th Italian conference on Theoretical Computer Science. (348-359).

    https://doi.org/10.1007/11560586_28

  • Leaver-Fay A, Kuhlman B and Snoeyink J. Rotamer-pair energy calculations using a trie data structure. Proceedings of the 5th International conference on Algorithms in Bioinformatics. (389-400).

    https://doi.org/10.1007/11557067_32

  • (2005). A Study on Clustering and Identifying Gene Sequences using Suffix Tree Clustering Method and BLAST. Journal of Control, Automation and Systems Engineering. 10.5302/J.ICROS.2005.11.10.851. 11:10. (851-856). Online publication date: 1-Oct-2005.

    http://koreascience.or.kr/journal/view.jsp?kj=JOJDCV&py=2005&vnc=v11n10&sp=851

  • Liu N, Wu Y and Chen A. (2005). Efficient kNN search in polyphonic music databases using a lower bounding mechanism. Multimedia Systems. 10:6. (513-528). Online publication date: 1-Oct-2005.

    https://doi.org/10.1007/s00530-005-0179-2

  • Salah M, Denton T, Mancoridis S, Shokoufandeh A and Vokolos F. Scenariographer. Proceedings of the 21st IEEE International Conference on Software Maintenance. (155-164).

    https://doi.org/10.1109/ICSM.2005.78

  • Wu Y, Breternitz M, Hum H, Peri R and Pickett J. Enhanced code density of embedded CISC processors with echo technology. Proceedings of the 3rd IEEE/ACM/IFIP international conference on Hardware/software codesign and system synthesis. (160-165).

    https://doi.org/10.1145/1084834.1084878

  • Tian Y, Tata S, Hankins R and Patel J. (2005). Practical methods for constructing suffix trees. The VLDB Journal — The International Journal on Very Large Data Bases. 14:3. (281-299). Online publication date: 1-Sep-2005.

    https://doi.org/10.1007/s00778-005-0154-8

  • Sim J. Time and space efficient search for small alphabets with suffix arrays. Proceedings of the Second international conference on Fuzzy Systems and Knowledge Discovery - Volume Part I. (1102-1107).

    https://doi.org/10.1007/11539506_136

  • Wang H, Pei J and Yu P. Pattern-based similarity search for microarray data. Proceedings of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining. (814-819).

    https://doi.org/10.1145/1081870.1081978

  • Na J, Giancarlo R and Park K. On2 log n Time On-Line Construction of Two-Dimensional Suffix Trees. Proceedings of the 11th Annual International Conference on Computing and Combinatorics - Volume 3595. (273-282).

    /doi/10.5555/2958119.2958215

  • Gao F and Zaki M. PSIST. Proceedings of the 2005 IEEE Computational Systems Bioinformatics Conference. (212-222).

    https://doi.org/10.1109/CSB.2005.46

  • Grossi R and Vitter J. (2005). Compressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String Matching. SIAM Journal on Computing. 35:2. (378-407). Online publication date: 1-Aug-2005.

    https://doi.org/10.1137/S0097539702402354

  • Popovici E, Marteau P and Ménier G. Information retrieval of sequential data in heterogeneous XML databases. Proceedings of the Third international conference on Adaptive Multimedia Retrieval: user, context, and feedback. (236-250).

    https://doi.org/10.1007/11670834_19

  • Batu T and Sahinalp S. Locally consistent parsing and applications to approximate string comparisons. Proceedings of the 9th international conference on Developments in Language Theory. (22-35).

    https://doi.org/10.1007/11505877_3

  • Ferragina P, Giancarlo R, Manzini G and Sciortino M. (2005). Boosting textual compression in optimal linear time. Journal of the ACM. 52:4. (688-713). Online publication date: 1-Jul-2005.

    https://doi.org/10.1145/1082036.1082043

  • Ferragina P and Manzini G. (2005). Indexing compressed text. Journal of the ACM. 52:4. (552-581). Online publication date: 1-Jul-2005.

    https://doi.org/10.1145/1082036.1082039

  • Lippert R, Zhao X, Florea L, Mobarry C and Istrail S. (2005). Finding Anchors for Genomic Sequence Comparison. Journal of Computational Biology. 10.1089/cmb.2005.12.762. 12:6. (762-776). Online publication date: 1-Jul-2005.

    http://www.liebertpub.com/doi/10.1089/cmb.2005.12.762

  • Amir A, Lipsky O, Porat E and Umanski J. Approximate matching in the L1 metric. Proceedings of the 16th annual conference on Combinatorial Pattern Matching. (91-103).

    https://doi.org/10.1007/11496656_9

  • Kim D and Park H. A new compressed suffix tree supporting fast search and its construction algorithm using optimal working space. Proceedings of the 16th annual conference on Combinatorial Pattern Matching. (33-44).

    https://doi.org/10.1007/11496656_4

  • Maaß M and Nowak J. Text indexing with errors. Proceedings of the 16th annual conference on Combinatorial Pattern Matching. (21-32).

    https://doi.org/10.1007/11496656_3

  • Fan K, Smyth W and Simpson R. A new periodicity lemma. Proceedings of the 16th annual conference on Combinatorial Pattern Matching. (257-265).

    https://doi.org/10.1007/11496656_22

  • Dori S and Landau G. Construction of aho corasick automaton in linear time for integer alphabets. Proceedings of the 16th annual conference on Combinatorial Pattern Matching. (168-177).

    https://doi.org/10.1007/11496656_15

  • Kim D, Sim J, Park H and Park K. (2005). Constructing suffix arrays in linear time. Journal of Discrete Algorithms. 10.1016/j.jda.2004.08.019. 3:2-4. (126-142). Online publication date: 1-Jun-2005.

    http://linkinghub.elsevier.com/retrieve/pii/S1570866704000486

  • Clifford R. (2005). Distributed suffix trees. Journal of Discrete Algorithms. 10.1016/j.jda.2004.08.004. 3:2-4. (176-197). Online publication date: 1-Jun-2005.

    http://linkinghub.elsevier.com/retrieve/pii/S1570866704000516

  • Ko P and Aluru S. (2005). Space efficient linear time construction of suffix arrays. Journal of Discrete Algorithms. 10.1016/j.jda.2004.08.002. 3:2-4. (143-156). Online publication date: 1-Jun-2005.

    http://linkinghub.elsevier.com/retrieve/pii/S1570866704000498

  • Lippert R. (2005). Space-Efficient Whole Genome Comparisons with Burrows–Wheeler Transforms. Journal of Computational Biology. 10.1089/cmb.2005.12.407. 12:4. (407-415). Online publication date: 1-May-2005.

    http://www.liebertpub.com/doi/10.1089/cmb.2005.12.407

  • Han S, Lee S, Hou B, Park S, Kim Y and Hwang K. (2005). A gene clustering method with masking cross-matching fragments using modified suffix tree clustering method. Korean Journal of Chemical Engineering. 10.1007/BF02719409. 22:3. (345-352). Online publication date: 1-May-2005.

    http://link.springer.com/10.1007/BF02719409

  • Wang H and Meng X. On the Sequencing of Tree Structures for XML Indexing. Proceedings of the 21st International Conference on Data Engineering. (372-383).

    https://doi.org/10.1109/ICDE.2005.98

  • Cole R and Hariharan R. (2005). Dynamic LCA Queries on Trees. SIAM Journal on Computing. 34:4. (894-923). Online publication date: 1-Apr-2005.

    https://doi.org/10.1137/S0097539700370539

  • Baron D and Bresler Y. (2005). Antisequential Suffix Sorting for BWT-Based Data Compression. IEEE Transactions on Computers. 54:4. (385-397). Online publication date: 1-Apr-2005.

    https://doi.org/10.1109/TC.2005.56

  • Cheng S, Lin C, Chen H and Heh J. (2005). Learning and diagnosis of individual and class conceptual perspectives. Computers & Education. 44:3. (257-283). Online publication date: 1-Apr-2005.

    https://doi.org/10.1016/j.compedu.2004.02.005

  • Bae J and Lee S. Estimating the number of substring matches in long string databases. Proceedings of the 7th Asia-Pacific web conference on Web Technologies Research and Development. (145-156).

    https://doi.org/10.1007/978-3-540-31849-1_15

  • Mäkinen V and Navarro G. (2005). Succinct suffix arrays based on run-length encoding. Nordic Journal of Computing. 12:1. (40-66). Online publication date: 1-Mar-2005.

    /doi/10.5555/1195881.1195885

  • Campagna D, Romualdi C, Vitulo N, Del Favero M, Lexa M, Cannata N and Valle G. (2004). RAP: a new computer program for de novo identification of repeated sequences in whole genomes. Bioinformatics. 10.1093/bioinformatics/bti039. 21:5. (582-588). Online publication date: 1-Mar-2005.

    https://academic.oup.com/bioinformatics/article/21/5/582/219976

  • Inenaga S, Hoshino H, Shinohara A, Takeda M, Arikawa S, Mauri G and Pavesi G. (2005). On-line construction of compact directed acyclic word graphs. Discrete Applied Mathematics. 10.1016/j.dam.2004.04.012. 146:2. (156-179). Online publication date: 1-Mar-2005.

    http://linkinghub.elsevier.com/retrieve/pii/S0166218X04003464

  • Blanchet-Sadri F and Duncan S. (2005). Partial words and the critical factorization theorem. Journal of Combinatorial Theory Series A. 109:2. (221-245). Online publication date: 1-Feb-2005.

    https://doi.org/10.1016/j.jcta.2004.09.002

  • Chan H, Hon W, Lam T and Sadakane K. Dynamic dictionary matching and compressed suffix trees. Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms. (13-22).

    /doi/10.5555/1070432.1070436

  • Senft M. Suffix tree based data compression. Proceedings of the 31st international conference on Theory and Practice of Computer Science. (350-359).

    https://doi.org/10.1007/978-3-540-30577-4_38

  • Cheung C, Yu J and Lu H. (2005). Constructing Suffix Tree for Gigabyte Sequences with Megabyte Memory. IEEE Transactions on Knowledge and Data Engineering. 17:1. (90-105). Online publication date: 1-Jan-2005.

    https://doi.org/10.1109/TKDE.2005.3

  • Kruengkrai C, Srichaivattana P, Sornlertlamvanich V and Isahara H. Language identification based on string kernels IEEE International Symposium on Communications and Information Technology, 2005. ISCIT 2005.. 10.1109/ISCIT.2005.1567018. 0-7803-9538-7. (896-899).

    http://ieeexplore.ieee.org/document/1567018/

  • Guangyue Hu and Shiyi Shen . (2005). A Fast Algorithm Aligning Multiple Microbial Genomic Sequences 2005 IEEE Engineering in Medicine and Biology 27th Annual Conference. 10.1109/IEMBS.2005.1616388. 0-7803-8741-4. (240-243).

    http://ieeexplore.ieee.org/document/1616388/

  • Na J, Giancarlo R and Park K. (2005). O(n 2 log n) Time On-Line Construction of Two-Dimensional Suffix Trees. Computing and Combinatorics. 10.1007/11533719_29. (273-282).

    http://link.springer.com/10.1007/11533719_29

  • Mäkinen V, Navarro G and Sadakane K. Advantages of Backward Searching — Efficient Secondary Memory and Distributed Implementation of Compressed Suffix Arrays. Algorithms and Computation. (681-692).

    https://doi.org/10.1007/978-3-540-30551-4_59

  • Mattiussi C, Waibel M and Floreano D. (2004). Measures of Diversity for Populations and Distances Between Individuals with Highly Reorganizable Genomes. Evolutionary Computation. 12:4. (495-515). Online publication date: 1-Dec-2004.

    https://doi.org/10.1162/1063656043138923

  • Gusfield D and Stoye J. (2004). Linear time algorithms for finding and representing all the tandem repeats in a string. Journal of Computer and System Sciences. 69:4. (525-546). Online publication date: 1-Dec-2004.

    https://doi.org/10.1016/j.jcss.2004.03.004

  • Miyamoto S, Inenaga S, Takeda M and Shinohara A. (2004). Ternary directed acyclic word graphs. Theoretical Computer Science. 328:1-2. (97-111). Online publication date: 29-Nov-2004.

    https://doi.org/10.1016/j.tcs.2004.07.008

  • Hore B, Hacigumus H, Iyer B and Mehrotra S. Indexing text data under space constraints. Proceedings of the thirteenth ACM international conference on Information and knowledge management. (198-207).

    https://doi.org/10.1145/1031171.1031212

  • Janson S, Lonardi S and Szpankowski W. (2004). On average sequence complexity. Theoretical Computer Science. 326:1-3. (213-227). Online publication date: 20-Oct-2004.

    https://doi.org/10.1016/j.tcs.2004.06.023

  • Tata S, Hankins R and Patel J. Practical suffix tree construction. Proceedings of the Thirtieth international conference on Very large data bases - Volume 30. (36-47).

    /doi/10.5555/1316689.1316695

  • Cai H, Kulkarni S and Verdu S. (2006). Universal entropy estimation via block sorting. IEEE Transactions on Information Theory. 50:7. (1551-1561). Online publication date: 1-Jul-2004.

    https://doi.org/10.1109/TIT.2004.830771

  • Martin A, Seroussi G and Weinberger M. (2006). Linear time universal coding and time reversal of tree sources via FSM closure. IEEE Transactions on Information Theory. 50:7. (1442-1468). Online publication date: 1-Jul-2004.

    https://doi.org/10.1109/TIT.2004.830763

  • Wang B, Lin J and Ku S. (2004). Efficient algorithms for the scaled indexing problem. Journal of Algorithms. 52:1. (82-100). Online publication date: 1-Jul-2004.

    https://doi.org/10.1016/j.jalgor.2004.03.006

  • Cole R, Gottlieb L and Lewenstein M. Dictionary matching and indexing with errors and don't cares. Proceedings of the thirty-sixth annual ACM symposium on Theory of computing. (91-100).

    https://doi.org/10.1145/1007352.1007374

  • Baron D and Bresler Y. (2004). An O(N) semipredictive universal encoder via the BWT. IEEE Transactions on Information Theory. 50:5. (928-937). Online publication date: 1-May-2004.

    https://doi.org/10.1109/TIT.2004.826664

  • Song A, Zhao M, Liang Z, Dong Y and Luo J. (2004). Discovering user profiles for Web personalized recommendation. Journal of Computer Science and Technology. 19:3. (320-328). Online publication date: 1-May-2004.

    https://doi.org/10.1007/BF02944902

  • Bedathur S and Haritsa J. Engineering a Fast Online Persistent Suffix Tree Construction. Proceedings of the 20th International Conference on Data Engineering.

    /doi/10.5555/977401.978137

  • Lippert R, Zhao X, Florea L, Mobarry C and Istrail S. Finding anchors for genomic sequence comparison. Proceedings of the eighth annual international conference on Research in computational molecular biology. (233-241).

    https://doi.org/10.1145/974614.974645

  • Carvalho A, Oliveira A, Freitas A and Sagot M. A parallel algorithm for the extraction of structured motifs. Proceedings of the 2004 ACM symposium on Applied computing. (147-153).

    https://doi.org/10.1145/967900.967932

  • Inenaga S, Shinohara A, Takeda M and Arikawa S. (2004). Compact directed acyclic word graphs for a sliding window. Journal of Discrete Algorithms. 2:1. (33-51). Online publication date: 1-Mar-2004.

    https://doi.org/10.1016/S1570-8667(03)00064-9

  • Amir A, Lewenstein M and Porat E. (2004). Faster algorithms for string matching with k mismatches. Journal of Algorithms. 50:2. (257-275). Online publication date: 1-Feb-2004.

    https://doi.org/10.1016/S0196-6774(03)00097-X

  • Ferragina P and Manzini G. Compression boosting in optimal linear time using the Burrows-Wheeler Transform. Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms. (655-663).

    /doi/10.5555/982792.982892

  • Grossi R, Gupta A and Vitter J. When indexing equals compression. Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms. (636-645).

    /doi/10.5555/982792.982888

  • Brown A. Constructing chromosome scale suffix trees. Proceedings of the second conference on Asia-Pacific bioinformatics - Volume 29. (105-112).

    /doi/10.5555/976520.976535

  • Kurtz S, Phillippy A, Delcher A, Smoot M, Shumway M, Antonescu C and Salzberg S. (2004). . Genome Biology. 10.1186/gb-2004-5-2-r12. 5:2. (R12).

    http://genomebiology.biomedcentral.com/articles/10.1186/gb-2004-5-2-r12

  • Kreibich C and Crowcroft J. (2004). Honeycomb. ACM SIGCOMM Computer Communication Review. 34:1. (51-56). Online publication date: 1-Jan-2004.

    https://doi.org/10.1145/972374.972384

  • Cole R and Hariharan R. (2004). Faster Suffix Tree Construction with Missing Suffix Links. SIAM Journal on Computing. 33:1. (26-42). Online publication date: 1-Jan-2004.

    https://doi.org/10.1137/S0097539701424465

  • Jiong Yang , Wei Wang and Yu P. BASS: approximate search on large string databases Proceedings. 16th International Conference on Scientific and Statistical Database Management, 2004.. 10.1109/SSDM.2004.1311210. 0-7695-2146-0. (181-190).

    http://ieeexplore.ieee.org/document/1311210/

  • Haixun Wang , Fang Chu , Wei Fan , Yu P and Jian Pei . A fast algorithm for subspace clustering by pattern similarity Proceedings. 16th International Conference on Scientific and Statistical Database Management, 2004.. 10.1109/SSDM.2004.1311193. 0-7695-2146-0. (51-60).

    http://ieeexplore.ieee.org/document/1311193/

  • Yu-lung Lo and Wen-lin Li . Linear time for discovering non-trivial repeating patterns in music databases 2004 IEEE International Conference on Multimedia and Expo (ICME). 10.1109/ICME.2004.1394183. 0-7803-8603-5. (293-296).

    http://ieeexplore.ieee.org/document/1394183/

  • Bedathur S and Haritsa J. Engineering a fast online persistent suffix tree construction Proceedings. 20th International Conference on Data Engineering. 10.1109/ICDE.2004.1320040. 0-7695-2065-0. (720-731).

    http://ieeexplore.ieee.org/document/1320040/

  • Wing-Kai Hon , Tak-Wah Lam , Sadakane K, Wing-Kin Sung and Siu-Ming Yiu . Compressed index for dynamic text Data Compression Conference, 2004. DCC 2004. 10.1109/DCC.2004.1281455. 0-7695-2082-0. (102-111).

    http://ieeexplore.ieee.org/document/1281455/

  • Binh Dao Vo and Kiem-Phong Vo . Using column dependency to compress tables Data Compression Conference, 2004. DCC 2004. 10.1109/DCC.2004.1281454. 0-7695-2082-0. (92-101).

    http://ieeexplore.ieee.org/document/1281454/

  • Shapira D and Storer J. In-place differential file compression of non-aligned files with applications to file distribution, backups, and string similarity Data Compression Conference, 2004. DCC 2004. 10.1109/DCC.2004.1281453. 0-7695-2082-0. (82-91).

    http://ieeexplore.ieee.org/document/1281453/

  • Pop M. (2004). Shotgun Sequence Assembly. . 10.1016/S0065-2458(03)60006-9. (193-248).

    http://linkinghub.elsevier.com/retrieve/pii/S0065245803600069

  • Tata S, Hankins R and Patel J. (2004). Practical Suffix Tree Construction. Proceedings 2004 VLDB Conference. 10.1016/B978-012088469-8.50007-3. (36-47).

    http://linkinghub.elsevier.com/retrieve/pii/B9780120884698500073

  • Apostolico A, Gong F and Lonardi S. (2004). Verbumculus and the discovery of unusual words. Journal of Computer Science and Technology. 19:1. (22-41). Online publication date: 1-Jan-2004.

    https://doi.org/10.1007/BF02944783

  • Pauws S. (2004). Cubyhum: Algorithms for Query by Humming. Algorithms in Ambient Intelligence. 10.1007/978-94-017-0703-9_4. (71-87).

    http://link.springer.com/10.1007/978-94-017-0703-9_4

  • Inenaga S, Kivioja T and Mäkinen V. (2004). Finding Missing Patterns. Algorithms in Bioinformatics. 10.1007/978-3-540-30219-3_39. (463-474).

    http://link.springer.com/10.1007/978-3-540-30219-3_39

  • Angelov S, Harb B, Kannan S, Khanna S, Kim J and Wang L. (2004). Genome Identification and Classification by Short Oligo Arrays. Algorithms in Bioinformatics. 10.1007/978-3-540-30219-3_34. (400-411).

    http://link.springer.com/10.1007/978-3-540-30219-3_34

  • Apostolico A, Pizzi C and Satta G. (2004). Optimal Discovery of Subword Associations in Strings. Discovery Science. 10.1007/978-3-540-30214-8_21. (270-277).

    http://link.springer.com/10.1007/978-3-540-30214-8_21

  • Crochemore M, Giancarlo R and Sagot M. (2004). Longest Motifs with a Functionally Equivalent Central Block. String Processing and Information Retrieval. 10.1007/978-3-540-30213-1_42. (298-309).

    http://link.springer.com/10.1007/978-3-540-30213-1_42

  • Iliopoulos C, Perdikuri K, Theodoridis E, Tsakalidis A and Tsichlas K. (2004). Motif Extraction from Weighted Sequences. String Processing and Information Retrieval. 10.1007/978-3-540-30213-1_41. (286-297).

    http://link.springer.com/10.1007/978-3-540-30213-1_41

  • Kim D, Jeon J and Park H. (2004). An Efficient Index Data Structure with the Capabilities of Suffix Trees and Suffix Arrays for Alphabets of Non-negligible Size. String Processing and Information Retrieval. 10.1007/978-3-540-30213-1_22. (138-149).

    http://link.springer.com/10.1007/978-3-540-30213-1_22

  • Lee I, Iliopoulos C and Park K. (2004). Linear Time Algorithm for the Longest Common Repeat Problem. String Processing and Information Retrieval. 10.1007/978-3-540-30213-1_2. (10-17).

    http://link.springer.com/10.1007/978-3-540-30213-1_2

  • Geertzen J and van Zaanen M. (2004). Grammatical Inference Using Suffix Trees. Grammatical Inference: Algorithms and Applications. 10.1007/978-3-540-30195-0_15. (163-174).

    http://link.springer.com/10.1007/978-3-540-30195-0_15

  • Janson S, Lonardi S and Szpankowski W. (2004). On the Average Sequence Complexity. Combinatorial Pattern Matching. 10.1007/978-3-540-27801-6_6. (74-88).

    http://link.springer.com/10.1007/978-3-540-27801-6_6

  • Chan H, Hon W and Lam T. (2004). Compressed Index for a Dynamic Collection of Texts. Combinatorial Pattern Matching. 10.1007/978-3-540-27801-6_34. (445-456).

    http://link.springer.com/10.1007/978-3-540-27801-6_34

  • Huynh T, Hon W, Lam T and Sung W. (2004). Approximate String Matching Using Compressed Suffix Arrays. Combinatorial Pattern Matching. 10.1007/978-3-540-27801-6_33. (434-444).

    http://link.springer.com/10.1007/978-3-540-27801-6_33

  • Akutsu T. (2004). Algorithms for Point Set Matching with k-Differences. Computing and Combinatorics. 10.1007/978-3-540-27798-9_28. (249-258).

    http://link.springer.com/10.1007/978-3-540-27798-9_28

  • Kim D, Jo J and Park H. (2004). A Fast Algorithm for Constructing Suffix Arrays for Fixed-Size Alphabets. Experimental and Efficient Algorithms. 10.1007/978-3-540-24838-5_23. (301-314).

    http://link.springer.com/10.1007/978-3-540-24838-5_23

  • Verbeurgt K, Dinolfo M and Fayer M. (2004). Extracting Patterns in Music for Composition via Markov Chains. Innovations in Applied Artificial Intelligence. 10.1007/978-3-540-24677-0_115. (1123-1132).

    http://link.springer.com/10.1007/978-3-540-24677-0_115

  • Kay M. (2004). Substring Alignment Using Suffix Trees. Computational Linguistics and Intelligent Text Processing. 10.1007/978-3-540-24630-5_34. (275-282).

    http://link.springer.com/10.1007/978-3-540-24630-5_34

  • Iliopoulos C, Makris C, Panagis Y, Perdikuri K, Theodoridis E and Tsakalidis A. Efficient Algorithms for Handling Molecular Weighted Sequences. Exploring New Frontiers of Theoretical Informatics. 10.1007/1-4020-8141-3_22. (265-278).

    http://link.springer.com/10.1007/1-4020-8141-3_22

  • Buchsbaum A, Fowler G, Kirishnamurthy B, Vo K and Wang J. (2003). Fast prefix matching of bounded strings. ACM Journal of Experimental Algorithmics. 8. (1.3-es). Online publication date: 31-Dec-2004.

    https://doi.org/10.1145/996546.996550

  • Kalyanaraman A, Aluru S, Brendel V and Kothari S. (2003). Space and time efficient parallel algorithms and software for EST clustering. IEEE Transactions on Parallel and Distributed Systems. 14:12. (1209-1221). Online publication date: 1-Dec-2003.

    https://doi.org/10.1109/TPDS.2003.1255634

  • Devroye L and Neininger R. (2003). Random suffix search trees. Random Structures & Algorithms. 23:4. (357-396). Online publication date: 1-Dec-2003.

    https://doi.org/10.1002/rsa.10103

  • Liu N, Wu Y and Chen A. Efficient K-NN search in polyphonic music databases using a lower bounding mechanism. Proceedings of the 5th ACM SIGMM international workshop on Multimedia information retrieval. (163-170).

    https://doi.org/10.1145/973264.973291

  • Ayala-Rincón M and Conejo P. (2003). A Linear Time Lower Bound on McCreight and General Updating Algorithms for Suffix Trees. Algorithmica. 37:3. (233-241). Online publication date: 1-Nov-2003.

    https://doi.org/10.1007/s00453-003-1034-5

  • Irving R and Love L. (2003). The suffix binary search tree and suffix AVL tree. Journal of Discrete Algorithms. 1:5-6. (387-408). Online publication date: 1-Oct-2003.

    https://doi.org/10.1016/S1570-8667(03)00034-0

  • Kwak T and Lee Y. (2003). A filtering method for searching similar multidimensional sequences under the time-warping distance. Information Systems. 28:7. (791-813). Online publication date: 1-Oct-2003.

    https://doi.org/10.1016/S0306-4379(02)00099-6

  • Hohlweg C and Reutenauer C. (2003). Lyndon words, permutations and trees. Theoretical Computer Science. 307:1. (173-178). Online publication date: 26-Sep-2003.

    https://doi.org/10.1016/S0304-3975(03)00099-9

  • Meek C, Patel J and Kasetty S. OASIS. Proceedings of the 29th international conference on Very large data bases - Volume 29. (910-921).

    /doi/10.5555/1315451.1315529

  • Sadakane K. (2003). New text indexing functionalities of the compressed suffix arrays. Journal of Algorithms. 48:2. (294-313). Online publication date: 1-Sep-2003.

    https://doi.org/10.1016/S0196-6774(03)00087-7

  • Giegerich R, Kurtz S and Stoye J. (2003). Efficient implementation of lazy suffix trees. Software: Practice and Experience. 10.1002/spe.535. 33:11. (1035-1049). Online publication date: 1-Sep-2003.

    https://onlinelibrary.wiley.com/doi/10.1002/spe.535

  • Adjeroh D and Feng J. The SCP and Compressed Domain Analysis of Biological Sequences. Proceedings of the IEEE Computer Society Conference on Bioinformatics.

    /doi/10.5555/937976.938118

  • Demaine E and López-Ortiz A. (2003). A linear lower bound on index size for text retrieval. Journal of Algorithms. 48:1. (2-15). Online publication date: 1-Aug-2003.

    https://doi.org/10.1016/S0196-6774(03)00043-9

  • Na J, Apostolico A, Iliopoulos C and Park K. (2003). Truncated suffix trees and their application to data compression. Theoretical Computer Science. 304:1. (87-101). Online publication date: 28-Jul-2003.

    /doi/10.5555/2780694.2780988

  • Chen Z, Fowler R, Fu A and Wang C. Fast construction of generalized suffix trees over a very large alphabet. Proceedings of the 9th annual international conference on Computing and combinatorics. (284-293).

    /doi/10.5555/1756869.1756909

  • Miyamoto S, Inenaga S, Takeda M and Shinohara A. Ternary directed acyclic word graphs. Proceedings of the 8th international conference on Implementation and application of automata. (120-130).

    /doi/10.5555/1760230.1760244

  • Na J, Apostolico A, Iliopoulos C and Park K. (2003). Truncated suffix trees and their application to data compression. Theoretical Computer Science. 10.1016/S0304-3975(03)00053-7. 304:1-3. (87-101). Online publication date: 1-Jul-2003.

    http://linkinghub.elsevier.com/retrieve/pii/S0304397503000537

  • Kärkkäinen J and Sanders P. Simple linear work suffix array construction. Proceedings of the 30th international conference on Automata, languages and programming. (943-955).

    /doi/10.5555/1759210.1759301

  • Ko P and Aluru S. Space efficient linear time construction of suffix arrays. Proceedings of the 14th annual conference on Combinatorial pattern matching. (200-210).

    /doi/10.5555/1756553.1756568

  • Kim D, Sim J, Park H and Park K. Linear-time construction of suffix arrays. Proceedings of the 14th annual conference on Combinatorial pattern matching. (186-199).

    /doi/10.5555/1756553.1756567

  • Burkhardt S and Kärkkäinen J. Fast lightweight suffix array construction and checking. Proceedings of the 14th annual conference on Combinatorial pattern matching. (55-69).

    /doi/10.5555/1756553.1756558

  • Kim D, Kim Y and Park K. (2003). Generalizations of suffix arrays to multi-dimensional matrices. Theoretical Computer Science. 302:1-3. (401-416). Online publication date: 13-Jun-2003.

    https://doi.org/10.1016/S0304-3975(02)00861-7

  • Kim D, Kim Y and Park K. (2003). Generalizations of suffix arrays to multi-dimensional matrices. Theoretical Computer Science. 302:1-3. (223-238). Online publication date: 13-Jun-2003.

    https://doi.org/10.1016/S0304-3975(02)00828-9

  • Wang H, Park S, Fan W and Yu P. ViST. Proceedings of the 2003 ACM SIGMOD international conference on Management of data. (110-121).

    https://doi.org/10.1145/872757.872774

  • Ferragina P, Koudas N, Muthukrishnan S and Srivastava D. (2003). Two-dimensional substring indexing. Journal of Computer and System Sciences. 66:4. (763-774). Online publication date: 1-Jun-2003.

    https://doi.org/10.1016/S0022-0000(03)00028-X

  • Inenaga S. (2003). Bidirectional construction of suffix trees. Nordic Journal of Computing. 10:1. (52-67). Online publication date: 1-Mar-2003.

    /doi/10.5555/846090.846097

  • Luk R, Yeung D, Lu Q, Leung H, Li S and Leung F. (2003). ASAB. Software—Practice & Experience. 33:3. (201-219). Online publication date: 1-Mar-2003.

    https://doi.org/10.1002/spe.497

  • Chen Z, Korn F, Koudas N and Muthukrishnan S. (2003). Generalized substring selectivity estimation. Journal of Computer and System Sciences. 66:1. (98-132). Online publication date: 1-Feb-2003.

    https://doi.org/10.1016/S0022-0000(02)00031-4

  • Crochemore M. (2003). Reducing space for index implementation. Theoretical Computer Science. 292:1. (185-197). Online publication date: 21-Jan-2003.

    https://doi.org/10.1016/S0304-3975(01)00222-5

  • Cole R and Lewenstein M. Multidimensional matching and fast search in suffix trees. Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms. (851-852).

    /doi/10.5555/644108.644251

  • Grossi R, Gupta A and Vitter J. High-order entropy-compressed text indexes. Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms. (841-850).

    /doi/10.5555/644108.644250

  • Mäkinen V. (2003). Compact Suffix Array — A Space-Efficient Full-Text Index. Fundamenta Informaticae. 56:1-2. (191-210). Online publication date: 1-Jan-2003.

    /doi/10.5555/2370956.2370966

  • Wing-Kai Hon , Sadakane K and Wing-Kin Sung . Breaking a time-and-space barrier in constructing full-text indices 44th Annual IEEE Symposium on Foundations of Computer Science - FOCS 2003. 10.1109/SFCS.2003.1238199. 0-7695-2040-5. (251-260).

    http://ieeexplore.ieee.org/document/1238199/

  • Fellah A and Mawson R. Distributed multidimensional suffix arrays for string search 2003 IEEE Pacific Rim Conference on Communications Computers and Signal Processing (PACRIM 2003). 10.1109/PACRIM.2003.1235900. 0-7803-7978-0. (792-795).

    http://ieeexplore.ieee.org/document/1235900/

  • Yun-Ching Chen and Suh-Yin Lee . (2003). Parsimony-spaced suffix trees for DNA sequences Proceedings. IEEE Fifth International Symposium on Multimedia Software Engineering. 10.1109/MMSE.2003.1254449. 0-7695-2031-6. (250-256).

    http://ieeexplore.ieee.org/document/1254449/

  • Zhixiang Chen , Fowler R, Ada Wai-chee Fu and Chunyue Wang . Linear and sublinear time algorithms for mining frequent traversal path patterns from very large Web logs International Database Engineering and Applications Symposium. 10.1109/IDEAS.2003.1214918. 0-7695-1981-4. (117-122).

    http://ieeexplore.ieee.org/document/1214918/

  • Wang H, Perng C, Fan W, Park S and Yu P. Indexing weighted-sequences in large databases 19th International Conference on Data Engineering. 10.1109/ICDE.2003.1260782. 0-7803-7665-X. (63-74).

    http://ieeexplore.ieee.org/document/1260782/

  • Yu-lung Lo and Shiou-jiuan Chen . Multi-feature indexing for music data 23rd International Conference on Distributed Computing Systems Workshops, 2003.. 10.1109/ICDCSW.2003.1203627. 0-7695-1921-0. (654-659).

    http://ieeexplore.ieee.org/document/1203627/

  • Deogun J, Fangrui Ma , Jingyi Yang and Benson A. (2003). A prototype for multiple whole genome alignment 36th Annual Hawaii International Conference on System Sciences, 2003. Proceedings of the. 10.1109/HICSS.2003.1174803. 0-7695-1874-5. (8 pp.).

    http://ieeexplore.ieee.org/document/1174803/

  • Chan S, Kao B, Yip C and Tang M. (2003). Mining emerging substrings Proceedings Eighth International Conference on Database Systems for Advanced Applications (DASFAA 2003). 10.1109/DASFAA.2003.1192375. 0-7695-1895-8. (119-126).

    http://ieeexplore.ieee.org/document/1192375/

  • Adjeroh D and Feng J. The SCP and compressed domain analysis of biological sequences 2003 IEEE Bioinformatics Conference. CSB2003. 10.1109/CSB.2003.1227416. 0-7695-2000-6. (587-592).

    http://ieeexplore.ieee.org/document/1227416/

  • Meek C, Patel J and Kasetty S. (2003). OASIS. Proceedings 2003 VLDB Conference. 10.1016/B978-012722442-8/50085-9. (910-921).

    http://linkinghub.elsevier.com/retrieve/pii/B9780127224428500859

  • Fenwick P. (2003). Burrows—Wheeler Compression. Lossless Compression Handbook. 10.1016/B978-012620861-0/50008-5. (169-193).

    http://linkinghub.elsevier.com/retrieve/pii/B9780126208610500085

  • Cenk Sahinalp S and Rajpoot N. (2003). Dictionary-Based Data Compression. Lossless Compression Handbook. 10.1016/B978-012620861-0/50007-3. (153-167).

    http://linkinghub.elsevier.com/retrieve/pii/B9780126208610500073

  • Evans P and Smith A. (2003). Toward Optimal Motif Enumeration. Algorithms and Data Structures. 10.1007/978-3-540-45078-8_5. (47-58).

    http://link.springer.com/10.1007/978-3-540-45078-8_5

  • Amir A, Landau G, Lewenstein M and Sokol D. (2003). Dynamic Text and Static Pattern Matching. Algorithms and Data Structures. 10.1007/978-3-540-45078-8_30. (340-352).

    http://link.springer.com/10.1007/978-3-540-45078-8_30

  • Inenaga S, Funamoto T, Takeda M and Shinohara A. (2003). Linear-Time Off-Line Text Compression by Longest-First Substitution. String Processing and Information Retrieval. 10.1007/978-3-540-39984-1_11. (137-152).

    http://link.springer.com/10.1007/978-3-540-39984-1_11

  • Shibuya T and Kurochkin I. (2003). Match Chaining Algorithms for cDNA Mapping. Algorithms in Bioinformatics. 10.1007/978-3-540-39763-2_33. (462-475).

    http://link.springer.com/10.1007/978-3-540-39763-2_33

  • Hon W, Lam T, Sadakane K and Sung W. (2003). Constructing Compressed Suffix Arrays with Large Alphabets. Algorithms and Computation. 10.1007/978-3-540-24587-2_26. (240-249).

    http://link.springer.com/10.1007/978-3-540-24587-2_26

  • Böckenhauer H and Bongartz D. (2003). String-Algorithmen. Algorithmische Grundlagen der Bioinformatik. 10.1007/978-3-322-80043-5_4. (43-77).

    http://link.springer.com/10.1007/978-3-322-80043-5_4

  • Böckenhauer H and Bongartz D. (2003). Vergleich von Genomen. Algorithmische Grundlagen der Bioinformatik. 10.1007/978-3-322-80043-5_10. (226-245).

    http://link.springer.com/10.1007/978-3-322-80043-5_10

  • Miyamoto S, Inenaga S, Takeda M and Shinohara A. (2003). Ternary Directed Acyclic Word Graphs. Implementation and Application of Automata. 10.1007/3-540-45089-0_12. (120-130).

    http://link.springer.com/10.1007/3-540-45089-0_12

  • Kärkkäinen J and Sanders P. (2003). Simple Linear Work Suffix Array Construction. Automata, Languages and Programming. 10.1007/3-540-45061-0_73. (943-955).

    http://link.springer.com/10.1007/3-540-45061-0_73

  • Burkhardt S and Kärkkäinen J. (2003). Fast Lightweight Suffix Array Construction and Checking. Combinatorial Pattern Matching. 10.1007/3-540-44888-8_5. (55-69).

    http://link.springer.com/10.1007/3-540-44888-8_5

  • Ko P and Aluru S. (2003). Space Efficient Linear Time Construction of Suffix Arrays. Combinatorial Pattern Matching. 10.1007/3-540-44888-8_15. (200-210).

    http://link.springer.com/10.1007/3-540-44888-8_15

  • Kim D, Sim J, Park H and Park K. (2003). Linear-Time Construction of Suffix Arrays. Combinatorial Pattern Matching. 10.1007/3-540-44888-8_14. (186-199).

    http://link.springer.com/10.1007/3-540-44888-8_14

  • Sagot M and Wakabayashi Y. (2003). Pattern Inference under many Guises. Recent Advances in Algorithms and Combinatorics. 10.1007/0-387-22444-0_8. (245-287).

    http://link.springer.com/10.1007/0-387-22444-0_8

  • Hunt E, Atkinson M and Irving R. (2002). Database indexing for large DNA and protein sequence collections. The VLDB Journal — The International Journal on Very Large Data Bases. 11:3. (256-271). Online publication date: 11-Nov-2002.

    https://doi.org/10.1007/s007780200064

  • Hsu J, Chen A, Chen H and Liu N. The effectiveness study of various music information retrieval approaches. Proceedings of the eleventh international conference on Information and knowledge management. (422-429).

    https://doi.org/10.1145/584792.584862

  • Chen Y, Che D and Aberer K. On the efficient evaluation of relaxed queries in biological databases. Proceedings of the eleventh international conference on Information and knowledge management. (227-236).

    https://doi.org/10.1145/584792.584832

  • Mäkinen V. (2002). Compact suffix array. Fundamenta Informaticae. 56:1,2. (191-210). Online publication date: 1-Oct-2002.

    /doi/10.5555/958824.958836

  • Leung H. Subject space. Proceedings of the 2002 conference of the Centre for Advanced Studies on Collaborative research.

    /doi/10.5555/782115.782122

  • Inenaga S, Shinohara A, Takeda M and Arikawa S. Compact Directed Acyclic Word Graphs for a Sliding Window. Proceedings of the 9th International Symposium on String Processing and Information Retrieval. (310-324).

    /doi/10.5555/646491.695104

  • Inenaga S, Shinohara A, Takeda M, Bannai H and Arikawa S. Space-Economical Construction of Index Structures for All Suffixes of a String. Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science. (341-352).

    /doi/10.5555/645731.668357

  • Apostolico A and Lonardi S. (2002). A speed-up for the commute between subword trees and DAWGs. Information Processing Letters. 83:3. (159-161). Online publication date: 16-Aug-2002.

    https://doi.org/10.1016/S0020-0190(01)00327-1

  • Lam T, Sadakane K, Sung W and Yiu S. A Space and Time Efficient Algorithm for Constructing Compressed Suffix Arrays. Proceedings of the 8th Annual International Conference on Computing and Combinatorics. (401-410).

    /doi/10.5555/646720.702409

  • Adjeroh D, Zhang Y, Mukherjee A, Powell M and Bell T. DNA Sequence Compression Using the Burrows-Wheeler Transform. Proceedings of the IEEE Computer Society Conference on Bioinformatics.

    /doi/10.5555/792771.793864

  • Yang J and Wang W. Towards Automatic Clustering of Protein Sequences. Proceedings of the IEEE Computer Society Conference on Bioinformatics.

    /doi/10.5555/792771.793857

  • Yang J, Wang W, Xia Y and Yu P. Accelerating Approximate Subsequence Search on Large Protein Sequence Databases. Proceedings of the IEEE Computer Society Conference on Bioinformatics.

    /doi/10.5555/792771.793854

  • Wang H, Perng C, Fan W and Yu P. An Index Structure for Pattern Similarity Searching in DNA Microarray Data. Proceedings of the IEEE Computer Society Conference on Bioinformatics.

    /doi/10.5555/792771.793847

  • Keogh E, Lonardi S and Chiu B. Finding surprising patterns in a time series database in linear time and space. Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining. (550-556).

    https://doi.org/10.1145/775047.775128

  • Brodal G, Lyngsø R, Östlin A and Pedersen C. Solving the String Statistics Problem in Time O(n log n). Proceedings of the 29th International Colloquium on Automata, Languages and Programming. (728-739).

    /doi/10.5555/646255.684570

  • Inenaga S, Takeda M, Shinohara A, Hoshino H and Arikawa S. The Minimum DAWG for All Suffixes of a String and Its Applications. Proceedings of the 13th Annual Symposium on Combinatorial Pattern Matching. (153-167).

    /doi/10.5555/647821.736379

  • Tahi F, Gouy M and Régnier M. (2002). Automatic RNA secondary structure prediction with a comparative approach. Computers & Chemistry. 10.1016/S0097-8485(02)00012-8. 26:5. (521-530). Online publication date: 1-Jul-2002.

    http://linkinghub.elsevier.com/retrieve/pii/S0097848502000128

  • Amir A, Landau G and Ukkonen E. (2002). Online timestamped text indexing. Information Processing Letters. 82:5. (253-259). Online publication date: 15-Jun-2002.

    https://doi.org/10.1016/S0020-0190(01)00275-7

  • Korn D and Vo K. Engineering a Differencing and Compression Data Format. Proceedings of the General Track of the annual conference on USENIX Annual Technical Conference. (219-228).

    /doi/10.5555/647057.713862

  • Effros M, Visweswariah K, Kulkarni S and Verdu S. (2006). Universal lossless source coding with the Burrows Wheeler transform. IEEE Transactions on Information Theory. 48:5. (1061-1081). Online publication date: 1-May-2002.

    https://doi.org/10.1109/18.995542

  • Kalyanaraman A, Aluru S and Kothari S. Parallel EST Clustering. Proceedings of the 16th International Parallel and Distributed Processing Symposium.

    /doi/10.5555/645610.661399

  • Chávez E and Navarro G. A Metric Index for Approximate String Matching. Proceedings of the 5th Latin American Symposium on Theoretical Informatics. (181-195).

    /doi/10.5555/646389.756827

  • Heinz S, Zobel J and Williams H. (2002). Burst tries. ACM Transactions on Information Systems. 20:2. (192-223). Online publication date: 1-Apr-2002.

    https://doi.org/10.1145/506309.506312

  • (2002). Task assignment with unknown duration. Journal of the ACM. 49:2. (260-288). Online publication date: 1-Mar-2002.

    https://doi.org/10.1145/506147.506154

  • Stoye J and Gusfield D. (2002). Simple and flexible detection of contiguous repeats using a suffix tree. Theoretical Computer Science. 270:1-2. (843-850). Online publication date: 6-Jan-2002.

    https://doi.org/10.1016/S0304-3975(01)00121-9

  • Arimura H, Sakamoto H and Arikawa S. Efficient Data Mining from Large Text Databases. Progress in Discovery Science, Final Report of the Japanese Discovery Science Project. (123-139).

    /doi/10.5555/647884.736176

  • Monostori K, Zaslavsky A and Schmidt H. (2002). Suffix vector. Australian Computer Science Communications. 24:1. (157-165). Online publication date: 1-Jan-2002.

    /doi/10.5555/563857.563820

  • Monostori K, Zaslavsky A and Schmidt H. Suffix vector. Proceedings of the twenty-fifth Australasian conference on Computer science - Volume 4. (157-165).

    /doi/10.5555/563801.563820

  • Kalyanaraman A, Aluru S and Kothari S. (2002). Parallel EST clustering Proceedings 16th International Parallel and Distributed Processing Symposium. IPDPS 2002. 10.1109/IPDPS.2002.1016587. 0-7695-1573-8. (8 pp).

    http://ieeexplore.ieee.org/document/1016587/

  • Hunt J and Tichy W. Extensible language-aware merging International Conference on Software Maintenance. 10.1109/ICSM.2002.1167812. 0-7695-1819-2. (511-520).

    http://ieeexplore.ieee.org/document/1167812/

  • Ai-Bo Song , Zuo-Peng Liang , Mao-Xian Zhao and Yi-Sheng Dong . Mining Web log data based on key path 2002 International Conference on Machine Learning and Cybernetics. 10.1109/ICMLC.2002.1176728. 0-7803-7508-4. (150-155).

    http://ieeexplore.ieee.org/document/1176728/

  • Junghoo Cho and Rajagopalan S. A fast regular expression indexing engine 18th International Conference on Data Engineering. 10.1109/ICDE.2002.994755. 0-7695-1531-2. (419-430).

    http://ieeexplore.ieee.org/document/994755/

  • Yu-lung Lo and Shiou-jiuan Chen . The numeric indexing for music data 22nd International Conference on Distributed Computing Systems Workshops. 10.1109/ICDCSW.2002.1030779. 0-7695-1588-6. (258-263).

    http://ieeexplore.ieee.org/document/1030779/

  • Annexstein F, Berman K, Jovanovic M and Ponnavaikko K. Indexing techniques for file sharing in scalable peer-to-peer networks Eleventh International Conference on Computer Communications and Networks. 10.1109/ICCCN.2002.1043038. 0-7803-7553-X. (10-15).

    http://ieeexplore.ieee.org/document/1043038/

  • Adjeroh D, Zhang Y, Mukherjee A, Powell M and Bell T. DNA sequence compression using the Burrows-Wheeler Transform IEEE Computer Society Bioinformatics Conference. 10.1109/CSB.2002.1039352. 0-7695-1653-X. (303-313).

    http://ieeexplore.ieee.org/document/1039352/

  • Haixun Wang , Chang-Shing Perng , Wei Fan and Yu P. An index structure for pattern similarity searching in DNA microarray data IEEE Computer Society Bioinformatics Conference. 10.1109/CSB.2002.1039348. 0-7695-1653-X. (256-267).

    http://ieeexplore.ieee.org/document/1039348/

  • Jiong Yang , Wei Wang , Yi Xia and Yu P. Accelerating approximate subsequence search on large protein sequence databases IEEE Computer Society Bioinformatics Conference. 10.1109/CSB.2002.1039343. 0-7695-1653-X. (207-216).

    http://ieeexplore.ieee.org/document/1039343/

  • Jiong Yang and Wei Wang . Towards automatic clustering of protein sequences IEEE Computer Society Bioinformatics Conference. 10.1109/CSB.2002.1039340. 0-7695-1653-X. (175-186).

    http://ieeexplore.ieee.org/document/1039340/

  • Devroye L and Neininger R. (2002). A Note on Random Suffix Search Trees. Mathematics and Computer Science II. 10.1007/978-3-0348-8211-8_16. (267-278).

    http://link.springer.com/10.1007/978-3-0348-8211-8_16

  • Chávez E and Navarro G. (2002). A Metric Index for Approximate String Matching. LATIN 2002: Theoretical Informatics. 10.1007/3-540-45995-2_20. (181-195).

    http://link.springer.com/10.1007/3-540-45995-2_20

  • Arimura H, Sakamoto H and Arikawa S. (2002). Efficient Data Mining from Large Text Databases. Progress in Discovery Science. 10.1007/3-540-45884-0_6. (123-139).

    http://link.springer.com/10.1007/3-540-45884-0_6

  • Inenaga S, Shinohara A, Takeda M and Arikawa S. (2002). Compact Directed Acyclic Word Graphs for a Sliding Window. String Processing and Information Retrieval. 10.1007/3-540-45735-6_27. (310-324).

    http://link.springer.com/10.1007/3-540-45735-6_27

  • Inenaga S, Shinohara A, Takeda M, Bannai H and Arikawa S. (2002). Space-Economical Construction of Index Structures for All Suffixes of a String. Mathematical Foundations of Computer Science 2002. 10.1007/3-540-45687-2_28. (341-352).

    https://link.springer.com/10.1007/3-540-45687-2_28

  • Lam T, Sadakane K, Sung W and Yiu S. (2002). A Space and Time Efficient Algorithm for Constructing Compressed Suffix Arrays. Computing and Combinatorics. 10.1007/3-540-45655-4_43. (401-410).

    http://link.springer.com/10.1007/3-540-45655-4_43

  • Brodal G, Lyngsø R, Östlin A and Pedersen C. (2002). Solving the String Statistics Problem in Time $$ \mathcal{O} $$ (nlogn). Automata, Languages and Programming. 10.1007/3-540-45465-9_62. (728-739).

    http://link.springer.com/10.1007/3-540-45465-9_62

  • Inenaga S, Takeda M, Shinohara A, Hoshino H and Arikawa S. (2002). The Minimum DAWG for All Suffixes of a String and Its Applications. Combinatorial Pattern Matching. 10.1007/3-540-45452-7_14. (153-167).

    http://link.springer.com/10.1007/3-540-45452-7_14

  • Vilo J and Kivinen K. (2001). Regulatory sequence analysis: application to the interpretation of gene expression. European Neuropsychopharmacology. 10.1016/S0924-977X(01)00117-1. 11:6. (399-411). Online publication date: 1-Dec-2001.

    http://linkinghub.elsevier.com/retrieve/pii/S0924977X01001171

  • Xiao Y and Dunham M. (2001). Efficient mining of traversal patterns. Data & Knowledge Engineering. 39:2. (191-214). Online publication date: 1-Nov-2001.

    https://doi.org/10.1016/S0169-023X(01)00039-8

  • Hunt E, Atkinson M and Irving R. A Database Index to Large Biological Sequences. Proceedings of the 27th International Conference on Very Large Data Bases. (139-148).

    /doi/10.5555/645927.672030

  • Hsu J, Liu C and Chen A. (2001). Discovering nontrivial repeating patterns in music data. IEEE Transactions on Multimedia. 3:3. (311-325). Online publication date: 1-Sep-2001.

    https://doi.org/10.1109/6046.944475

  • Inenaga S, Hoshino H, Shinohara A, Takeda M, Arikawa S, Mauri G and Pavesi G. On-Line Construction of Compact Directed Acyclic Word Graphs. Proceedings of the 12th Annual Symposium on Combinatorial Pattern Matching. (169-180).

    /doi/10.5555/647820.736366

  • Arimura H, Asaka H, Sakamoto H and Arikawa S. Efficient Discovery of Proximity Patterns with Suffix Arrays. Proceedings of the 12th Annual Symposium on Combinatorial Pattern Matching. (152-156).

    /doi/10.5555/647820.736364

  • Kasai T, Lee G, Arimura H, Arikawa S and Park K. Linear-Time Longest-Common-Prefix Computation in Suffix Arrays and Its Applications. Proceedings of the 12th Annual Symposium on Combinatorial Pattern Matching. (181-192).

    /doi/10.5555/647820.736222

  • Reif J and Storer J. (2001). Optimal encoding of non-stationary sources. Information Sciences: an International Journal. 135:1-2. (87-105). Online publication date: 28-Jun-2001.

    https://doi.org/10.1016/S0020-0255(01)00103-7

  • Bentley J and McIlroy D. (2001). Data compression with long repeated strings. Information Sciences: an International Journal. 135:1-2. (1-11). Online publication date: 28-Jun-2001.

    https://doi.org/10.1016/S0020-0255(01)00097-4

  • Vitter J. (2001). External memory algorithms and data structures. ACM Computing Surveys. 33:2. (209-271). Online publication date: 1-Jun-2001.

    https://doi.org/10.1145/384192.384193

  • Ferragina P, Koudas N, Srivastava D and Muthukrishnan S. Two-dimensional substring indexing. Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems. (282-288).

    https://doi.org/10.1145/375551.375610

  • Munro J, Raman V and Rao S. (2001). Space Efficient Suffix Trees. Journal of Algorithms. 39:2. (205-222). Online publication date: 1-May-2001.

    https://doi.org/10.1006/jagm.2000.1151

  • Yamamoto M and Church K. (2001). Using suffix arrays to compute term frequency and document frequency for all substrings in a corpus. Computational Linguistics. 27:1. (1-30). Online publication date: 1-Mar-2001.

    https://doi.org/10.1162/089120101300346787

  • Navarro G. (2001). A guided tour to approximate string matching. ACM Computing Surveys. 33:1. (31-88). Online publication date: 1-Mar-2001.

    https://doi.org/10.1145/375360.375365

  • MONGELLI H and SONG S. (2001). PARALLEL PATTERN MATCHING WITH SCALING. Parallel Processing Letters. 10.1142/S0129626401000476. 11:01. (125-138). Online publication date: 1-Mar-2001.

    http://www.worldscientific.com/doi/abs/10.1142/S0129626401000476

  • Demaine E and López-Ortiz A. A linear lower bound on index size for text retrieval. Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms. (289-294).

    /doi/10.5555/365411.365460

  • Sang Hyun P and Wesley W. C. (2001). Discovering and Matching Elastic Rules from Sequence Databases. Fundamenta Informaticae. 47:1-2. (75-90). Online publication date: 1-Jan-2001.

    /doi/10.5555/2372179.2372184

  • Gero J and Kazakov V. (2001). A Genetic Engineering Approach to Genetic Algorithms. Evolutionary Computation. 9:1. (71-92). Online publication date: 1-Jan-2001.

    https://doi.org/10.1162/10636560151075121

  • Inenaga S, Hoshino H, Shinohara A, Takeda M and Arikawa S. (2001). On-line construction of symmetric compact directed acyclic word graphs Proceedings Eighth Symposium on String Processing and Information Retrieval. 10.1109/SPIRE.2001.989743. 0-7695-1192-9. (96-110).

    http://ieeexplore.ieee.org/document/989743/

  • Kasai T, Lee G, Arimura H, Arikawa S and Park K. (2001). Linear-Time Longest-Common-Prefix Computation in Suffix Arrays and Its Applications. Combinatorial Pattern Matching. 10.1007/3-540-48194-X_17. (181-192).

    http://link.springer.com/10.1007/3-540-48194-X_17

  • Inenaga S, Hoshino H, Shinohara A, Takeda M, Arikawa S, Mauri G and Pavesi G. (2001). On-Line Construction of Compact Directed Acyclic Word Graphs*. Combinatorial Pattern Matching. 10.1007/3-540-48194-X_16. (169-180).

    http://link.springer.com/10.1007/3-540-48194-X_16

  • Arimura H, Asaka H, Sakamoto H and Arikawa S. (2001). Efficient Discovery of Proximity Patterns with Suffix Arrays (Extended Abstract). Combinatorial Pattern Matching. 10.1007/3-540-48194-X_14. (152-156).

    http://link.springer.com/10.1007/3-540-48194-X_14

  • Wang H and Perng C. (2001). The S 2-Tree: An Index Structure for Subsequence Matching of Spatial Objects. Advances in Knowledge Discovery and Data Mining. 10.1007/3-540-45357-1_34. (312-323).

    http://link.springer.com/10.1007/3-540-45357-1_34

  • Mäkinen V. (2001). Trade Off Between Compression and Search Times in Compact Suffix Array. Algorithm Engineering and Experimentation. 10.1007/3-540-44808-X_16. (189-201).

    http://link.springer.com/10.1007/3-540-44808-X_16

  • Jagadish H, Kapitskaia O, Ng R and Srivastava D. (2000). One-dimensional and multi-dimensional substring selectivity estimation. The VLDB Journal — The International Journal on Very Large Data Bases. 9:3. (214-230). Online publication date: 1-Dec-2000.

    https://doi.org/10.1007/s007780000029

  • Deorowicz S. (2000). Improvements to Burrows-Wheeler compression algorithm. Software: Practice and Experience. 10.1002/1097-024X(20001110)30:13<1465::AID-SPE345>3.0.CO;2-D. 30:13. (1465-1483). Online publication date: 10-Nov-2000.

    http://doi.wiley.com/10.1002/1097-024X%2820001110%2930%3A13%3C1465%3A%3AAID-SPE345%3E3.0.CO%3B2-D

  • Farach-Colton M, Ferragina P and Muthukrishnan S. (2000). On the sorting-complexity of suffix tree construction. Journal of the ACM. 47:6. (987-1011). Online publication date: 1-Nov-2000.

    https://doi.org/10.1145/355541.355547

  • Effros M. PPM performance with BWT complexity: a fast and effective data compression algorithm. Proceedings of the IEEE. 10.1109/5.892706. 88:11. (1703-1712).

    http://ieeexplore.ieee.org/document/892706/

  • Amir A, Keselman D, Landau G, Lewenstein M, Lewenstein N and Rodeh M. (2000). Text Indexing and Dictionary Matching with One Error. Journal of Algorithms. 37:2. (309-325). Online publication date: 1-Nov-2000.

    https://doi.org/10.1006/jagm.2000.1104

  • Balkenhol B and Kurtz S. (2000). Universal Data Compression Based on the Burrows-Wheeler Transformation. IEEE Transactions on Computers. 49:10. (1043-1053). Online publication date: 1-Oct-2000.

    https://doi.org/10.1109/12.888040

  • Apostolico A and Bejerano G. (2000). Optimal Amnesic Probabilistic Automata or How to Learn and Classify Proteins in Linear Time and Space. Journal of Computational Biology. 10.1089/106652700750050844. 7:3-4. (381-393). Online publication date: 1-Aug-2000.

    http://www.liebertpub.com/doi/10.1089/106652700750050844

  • Marsan L and Sagot M. (2000). Algorithms for Extracting Structured Motifs Using a Suffix Tree with an Application to Promoter and Regulatory Site Consensus Identification. Journal of Computational Biology. 10.1089/106652700750050826. 7:3-4. (345-362). Online publication date: 1-Aug-2000.

    http://www.liebertpub.com/doi/10.1089/106652700750050826

  • Amir A and Călinescu G. (2000). Alphabet-Independent and Scaled Dictionary Matching. Journal of Algorithms. 36:1. (34-62). Online publication date: 1-Jul-2000.

    https://doi.org/10.1006/jagm.2000.1081

  • Jagadish H, Koudas N and Srivastava D. (2000). On effective multi-dimensional indexing for strings. ACM SIGMOD Record. 29:2. (403-414). Online publication date: 1-Jun-2000.

    https://doi.org/10.1145/335191.335434

  • Jagadish H, Koudas N and Srivastava D. On effective multi-dimensional indexing for strings. Proceedings of the 2000 ACM SIGMOD international conference on Management of data. (403-414).

    https://doi.org/10.1145/342009.335434

  • Cole R and Hariharan R. Faster suffix tree construction with missing suffix links. Proceedings of the thirty-second annual ACM symposium on Theory of computing. (407-415).

    https://doi.org/10.1145/335305.335352

  • Grossi R and Vitter J. Compressed suffix arrays and suffix trees with applications to text indexing and string matching (extended abstract). Proceedings of the thirty-second annual ACM symposium on Theory of computing. (397-406).

    https://doi.org/10.1145/335305.335351

  • Chen Z, Koudas N, Korn F and Muthukrishnan S. Selectively estimation for Boolean queries. Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems. (216-225).

    https://doi.org/10.1145/335168.335225

  • Marsan L and Sagot M. Extracting structured motifs using a suffix tree—algorithms and application to promoter consensus identification. Proceedings of the fourth annual international conference on Computational molecular biology. (210-219).

    https://doi.org/10.1145/332306.332553

  • Apostolico A and Bejerano G. Optimal amnesic probabilistic automata or how to learn and classify proteins in linear time and space. Proceedings of the fourth annual international conference on Computational molecular biology. (25-32).

    https://doi.org/10.1145/332306.332321

  • Effros M. PPM Performance with BWT Complexity. Proceedings of the Conference on Data Compression.

    /doi/10.5555/789087.789806

  • Shimozono S, Arimura H and Arikawa S. (2000). Efficient discovery of optimal word-association patterns in large text databases. New Generation Computing. 18:1. (49-60). Online publication date: 1-Mar-2000.

    https://doi.org/10.1007/BF03037568

  • Alstrup S, Brodal G and Rauhe T. Pattern matching in dynamic texts. Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms. (819-828).

    /doi/10.5555/338219.338645

  • Amir A, Lewenstein M and Porat E. Faster algorithms for string matching with k mismatches. Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms. (794-803).

    /doi/10.5555/338219.338641

  • Apostolico A, Bock M, Lonardi S and Xu X. (2000). Efficient Detection of Unusual Words. Journal of Computational Biology. 10.1089/10665270050081397. 7:1-2. (71-94). Online publication date: 1-Feb-2000.

    http://www.liebertpub.com/doi/10.1089/10665270050081397

  • Dube R. (2000). Scalable hierarchical coarse-grained timers. ACM SIGOPS Operating Systems Review. 34:1. (11-20). Online publication date: 1-Jan-2000.

    https://doi.org/10.1145/506128.506130

  • Kolpakov R and Kucherov G. Finding repeats with fixed gap SPIRE'2000 - String Processing and Information Retrieval. 10.1109/SPIRE.2000.878192. 0-7695-0746-8. (162-168).

    http://ieeexplore.ieee.org/document/878192/

  • Ferragina P and Manzini G. Opportunistic data structures with applications 41st Annual Symposium on Foundations of Computer Science. 10.1109/SFCS.2000.892127. 0-7695-0850-2. (390-398).

    http://ieeexplore.ieee.org/document/892127/

  • Chen A, Chang M, Chen J, Jia-Lien Hsu , Chih-How Hsu and Hua S. Query by music segments: an efficient approach for song retrieval International Conference on Multimedia and Expo. 10.1109/ICME.2000.871498. 0-7803-6536-4. (873-876).

    http://ieeexplore.ieee.org/document/871498/

  • Effros M. PPM performance with BWT complexity: a new method for lossless data compression DCC 2000. Data Compression Conference. 10.1109/DCC.2000.838160. 0-7695-0592-9. (203-212).

    http://ieeexplore.ieee.org/document/838160/

  • Malpohl G, Hunt J and Tichy W. (2000). Renaming detection Proceedings of ASE 2000 15th IEEE International Automated Software Engineering Conference. 10.1109/ASE.2000.873652. 0-7695-0710-7. (73-80).

    http://ieeexplore.ieee.org/document/873652/

  • Salomon D. (2000). Other Methods. Data Compression. 10.1007/978-3-642-86092-8_9. (681-754).

    http://www.springerlink.com/index/10.1007/978-3-642-86092-8_9

  • Kurtz S and Balkenhol B. (2000). Space Efficient Linear Time Computation of the Burrows and Wheeler-Transformation. Numbers, Information and Complexity. 10.1007/978-1-4757-6048-4_31. (375-383).

    http://link.springer.com/10.1007/978-1-4757-6048-4_31

  • Kim D. (2000). Advanced Compiler Optimization for CalmRISC8 Low-End Embedded Processor. Compiler Construction. 10.1007/3-540-46423-9_12. (173-188).

    http://link.springer.com/10.1007/3-540-46423-9_12

  • Fujino R, Arimura H and Arikawa S. (2000). Discovering Unordered and Ordered Phrase Association Patterns for Text Mining. Knowledge Discovery and Data Mining. Current Issues and New Applications. 10.1007/3-540-45571-X_34. (281-293).

    http://link.springer.com/10.1007/3-540-45571-X_34

  • Matsuzawa H and Fukuda T. (2000). Mining Structured Association Patterns from Databases. Knowledge Discovery and Data Mining. Current Issues and New Applications. 10.1007/3-540-45571-X_30. (233-244).

    http://link.springer.com/10.1007/3-540-45571-X_30

  • Buchsbaum A, Goodrich M and Westbrook J. (2000). Range Searching over Tree Cross Products. Algorithms - ESA 2000. 10.1007/3-540-45253-2_12. (120-131).

    http://link.springer.com/10.1007/3-540-45253-2_12

  • Brodal G and Pedersen C. (2000). Finding Maximal Quasiperiodicities in Strings. Combinatorial Pattern Matching. 10.1007/3-540-45123-4_33. (397-411).

    http://link.springer.com/10.1007/3-540-45123-4_33

  • Maaß M. (2000). Linear Bidirectional On-Line Construction of Affix Trees. Combinatorial Pattern Matching. 10.1007/3-540-45123-4_27. (320-334).

    http://link.springer.com/10.1007/3-540-45123-4_27

  • Mäkinen V. (2000). Compact Suffix Array. Combinatorial Pattern Matching. 10.1007/3-540-45123-4_26. (305-319).

    http://link.springer.com/10.1007/3-540-45123-4_26

  • Klein S. (2000). Improving Static Compression Schemes by Alphabet Extension. Combinatorial Pattern Matching. 10.1007/3-540-45123-4_19. (210-221).

    http://link.springer.com/10.1007/3-540-45123-4_19

  • Shibuya T. (2000). Generalization of a Suffix Tree for RNA Structural Pattern Matching. Algorithm Theory - SWAT 2000. 10.1007/3-540-44985-X_34. (393-406).

    http://link.springer.com/10.1007/3-540-44985-X_34

  • Sadakane K. (2000). Compressed Text Databases with Efficient Query Algorithms Based on the Compressed Suffix Array. Algorithms and Computation. 10.1007/3-540-40996-3_35. (410-421).

    http://link.springer.com/10.1007/3-540-40996-3_35

  • Park S and Chu W. (2000). Discovering and Matching Elastic Rules from Sequence Databases. Foundations of Intelligent Systems. 10.1007/3-540-39963-1_42. (400-408).

    http://link.springer.com/10.1007/3-540-39963-1_42

  • Kurtz S. (1999). Reducing the space requirement of suffix trees. Software: Practice and Experience. 10.1002/(SICI)1097-024X(199911)29:13<1149::AID-SPE274>3.0.CO;2-O. 29:13. (1149-1171). Online publication date: 1-Nov-1999.

    http://doi.wiley.com/10.1002/%28SICI%291097-024X%28199911%2929%3A13%3C1149%3A%3AAID-SPE274%3E3.0.CO%3B2-O

  • Kolpakov R and Kucherov G. Finding Maximal Repetitions in a Word in Linear Time. Proceedings of the 40th Annual Symposium on Foundations of Computer Science.

    /doi/10.5555/795665.796470

  • Jagadish H, Kapitskaia O, Ng R and Srivastava D. Multi-Dimensional Substring Selectivity Estimation. Proceedings of the 25th International Conference on Very Large Data Bases. (387-398).

    /doi/10.5555/645925.671501

  • Huang Y and Yu P. Adaptive query processing for time-series data. Proceedings of the fifth ACM SIGKDD international conference on Knowledge discovery and data mining. (282-286).

    https://doi.org/10.1145/312129.318357

  • Crauser A and Ferragina P. On Constructing Suffix Arrays in External Memory. Proceedings of the 7th Annual European Symposium on Algorithms. (224-235).

    /doi/10.5555/647909.740304

  • Atallah M, Génin Y and Szpankowski W. (1999). Pattern Matching Image Compression. IEEE Transactions on Pattern Analysis and Machine Intelligence. 21:7. (614-627). Online publication date: 1-Jul-1999.

    https://doi.org/10.1109/34.777372

  • Jagadish H, Lakshmanan L, Milo T, Srivastava D and Vista D. Querying network directories. Proceedings of the 1999 ACM SIGMOD international conference on Management of data. (133-144).

    https://doi.org/10.1145/304182.304194

  • Jagadish H, Lakshmanan L, Milo T, Srivastava D and Vista D. (1999). Querying network directories. ACM SIGMOD Record. 28:2. (133-144). Online publication date: 1-Jun-1999.

    https://doi.org/10.1145/304181.304194

  • Jagadish H, Ng R and Srivastava D. Substring selectivity estimation. Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems. (249-260).

    https://doi.org/10.1145/303976.304001

  • Cooper K and McIntosh N. (1999). Enhanced code compression for embedded RISC processors. ACM SIGPLAN Notices. 34:5. (139-149). Online publication date: 1-May-1999.

    https://doi.org/10.1145/301631.301655

  • Cooper K and McIntosh N. Enhanced code compression for embedded RISC processors. Proceedings of the ACM SIGPLAN 1999 conference on Programming language design and implementation. (139-149).

    https://doi.org/10.1145/301618.301655

  • Ferragina P and Grossi R. (1999). Improved Dynamic Text Indexing. Journal of Algorithms. 31:2. (291-319). Online publication date: 1-May-1999.

    https://doi.org/10.1006/jagm.1998.0999

  • Burkhardt S, Crauser A, Ferragina P, Lenhof H, Rivals E and Vingron M. q-gram based database searching using a suffix array (QUASAR). Proceedings of the third annual international conference on Computational molecular biology. (77-83).

    https://doi.org/10.1145/299432.299460

  • Ferragina P and Grossi R. (1999). The string B-tree. Journal of the ACM. 46:2. (236-280). Online publication date: 1-Mar-1999.

    https://doi.org/10.1145/301970.301973

  • Giancarlo R and Grossi R. (1999). Parallel Construction and Query of Index Data Structures for Pattern Matching on Square Matrices. Journal of Complexity. 15:1. (30-71). Online publication date: 1-Mar-1999.

    https://doi.org/10.1006/jcom.1998.0496

  • Giancarlo R and Guaiana D. (1999). On-line Construction of Two-Dimensional Suffix Trees. Journal of Complexity. 15:1. (72-127). Online publication date: 1-Mar-1999.

    https://doi.org/10.1006/jcom.1998.0495

  • Cole R and Hariharan R. Dynamic LCA queries on trees. Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms. (235-244).

    /doi/10.5555/314500.314564

  • Kolpakov R and Kucherov G. Finding maximal repetitions in a word in linear time 40th Annual Symposium on Foundations of Computer Science. 10.1109/SFFCS.1999.814634. 0-7695-0409-4. (596-604).

    http://ieeexplore.ieee.org/document/814634/

  • Chih-Chin Liu , Jia-Lien Hsu and Chen A. (1999). Efficient theme and non-trivial repeating pattern discovering in music databases Proceedings 15th International Conference on Data Engineering (Cat. No.99CB36337). 10.1109/ICDE.1999.754893. 0-7695-0071-4. (14-21).

    http://ieeexplore.ieee.org/document/754893/

  • Bentley J and McIlroy D. (1999). Data compression using long common strings Proceedings DCC'99 Data Compression Conference (Cat. No. PR00096). 10.1109/DCC.1999.755678. 0-7695-0096-X. (287-295).

    http://ieeexplore.ieee.org/document/755678/

  • Balkenhol B, Kurtz S and Shtarkov Y. (1999). Modifications of the Burrows and Wheeler data compression algorithm Proceedings DCC'99 Data Compression Conference (Cat. No. PR00096). 10.1109/DCC.1999.755668. 0-7695-0096-X. (188-197).

    http://ieeexplore.ieee.org/document/755668/

  • Apostolico A, Bock M and Lonardi S. (1999). Linear global detectors of redundant and rare substrings Proceedings DCC'99 Data Compression Conference (Cat. No. PR00096). 10.1109/DCC.1999.755666. 0-7695-0096-X. (168-177).

    http://ieeexplore.ieee.org/document/755666/

  • Delcher A, Kasif S, Fleischmann R, Peterson J, White O and Salzberg S. (1999). Alignment of whole genomes. Nucleic Acids Research. 10.1093/nar/27.11.2369. 27:11. (2369-2376). Online publication date: 1-Jan-1999.

    https://academic.oup.com/nar/article-lookup/doi/10.1093/nar/27.11.2369

  • Kim D and Park K. (1999). Linear-Time Construction of Two-Dimensional Suffix Trees (Extended Abstract). Automata, Languages and Programming. 10.1007/3-540-48523-6_43. (463-472).

    http://link.springer.com/10.1007/3-540-48523-6_43

  • Crauser A and Ferragina P. (1999). On Constructing Suffix Arrays in External Memory. Algorithms - ESA’ 99. 10.1007/3-540-48481-7_20. (224-235).

    http://link.springer.com/10.1007/3-540-48481-7_20

  • Yokoo H. (1999). A Dynamic Data Structure for Reverse Lexicographically Sorted Prefixes. Combinatorial Pattern Matching. 10.1007/3-540-48452-3_12. (150-162).

    http://link.springer.com/10.1007/3-540-48452-3_12

  • Brodal G, Lyngsø R, Pedersen C and Stoye J. (1999). Finding Maximal Pairs with Bounded Gap. Combinatorial Pattern Matching. 10.1007/3-540-48452-3_11. (134-149).

    http://link.springer.com/10.1007/3-540-48452-3_11

  • Amir A, Keselman D, Landau G, Lewenstein M, Lewenstein N and Rodeh M. (1999). Indexing and Dictionary Matching with One Error (Extended Abstract). Algorithms and Data Structures. 10.1007/3-540-48447-7_19. (181-192).

    http://link.springer.com/10.1007/3-540-48447-7_19

  • Manzini G. (1999). The Burrows-Wheeler Transform: Theory and Practice. Mathematical Foundations of Computer Science 1999. 10.1007/3-540-48340-3_4. (34-47).

    http://link.springer.com/10.1007/3-540-48340-3_4

  • Giegerich R, Kurtz S and Stoye J. (1999). Efficient Implementation of Lazy Suffix Trees. Algorithm Engineering. 10.1007/3-540-48318-7_5. (30-42).

    http://link.springer.com/10.1007/3-540-48318-7_5

  • Ikeda D. (1999). Characteristic Sets of Strings Common to Semi-structured Documents. Discovery Science. 10.1007/3-540-46846-3_13. (139-147).

    http://link.springer.com/10.1007/3-540-46846-3_13

  • Shibuya T. (1999). Constructing the Suffix Tree of a Tree with a Large Alphabet. Algorithms and Computation. 10.1007/3-540-46632-0_24. (225-236).

    http://link.springer.com/10.1007/3-540-46632-0_24

  • Brāzma A, Jonassen I, Vilo J and Ukkonen E. (1998). Predicting Gene Regulatory Elements in Silico on a Genomic Scale. Genome Research. 10.1101/gr.8.11.1202. 8:11. (1202-1215). Online publication date: 1-Nov-1998.

    http://genome.cshlp.org/lookup/doi/10.1101/gr.8.11.1202

  • Ferragina P and Luccio F. (1998). Dynamic dictionary matching in external memory. Information and Computation. 146:2. (85-99). Online publication date: 1-Nov-1998.

    https://doi.org/10.1006/inco.1998.2733

  • Argamon S, Dagan I and Krymolowski Y. A memory-based approach to learning shallow natural language patterns. Proceedings of the 36th Annual Meeting of the Association for Computational Linguistics and 17th International Conference on Computational Linguistics - Volume 1. (67-73).

    https://doi.org/10.3115/980845.980857

  • Ferragina P, Grossi R and Montangero M. (1998). On updating suffix tree labels. Theoretical Computer Science. 201:1-2. (249-262). Online publication date: 1-Jul-1998.

    https://doi.org/10.1016/S0304-3975(97)00243-0

  • Ferragina P and Grossi R. (1998). Optimal On-Line Search and Sublinear Time Update in String Matching. SIAM Journal on Computing. 27:3. (713-736). Online publication date: 1-Jun-1998.

    https://doi.org/10.1137/S0097539795286119

  • Hunt J, Vo K and Tichy W. (1998). Delta algorithms. ACM Transactions on Software Engineering and Methodology. 7:2. (192-214). Online publication date: 1-Apr-1998.

    https://doi.org/10.1145/279310.279321

  • Kovács L. (1998). Discovery of resources within a distributed library system. Communications of the ACM. 41:4. (78-79). Online publication date: 1-Apr-1998.

    https://doi.org/10.1145/273035.273061

  • Maeda A, Dartois M, Fujita T, Sakaguchi T, Sugimoto S and Tabata K. (1998). Viewing multilingual documents on your local Web browser. Communications of the ACM. 41:4. (64-65). Online publication date: 1-Apr-1998.

    https://doi.org/10.1145/273035.273053

  • Landau G, Myers E and Schmidt J. (1998). Incremental String Comparison. SIAM Journal on Computing. 10.1137/S0097539794264810. 27:2. (557-582). Online publication date: 1-Apr-1998.

    http://epubs.siam.org/doi/10.1137/S0097539794264810

  • Breslauer D. (1998). The suffix tree of a tree and minimizing sequential transducers. Theoretical Computer Science. 191:1-2. (131-144). Online publication date: 30-Jan-1998.

    https://doi.org/10.1016/S0304-3975(96)00319-2

  • Ayala-Rincon M and Conejo P. A linear time lower bound on updating algorithms for suffix trees Proceedings. String Processing and Information Retrieval: A South American Symposium (Cat. No.98EX207). 10.1109/SPIRE.1998.712976. 0-8186-8664-2. (1-6).

    http://ieeexplore.ieee.org/document/712976/

  • Farach M, Ferragina P and Muthukrishnan S. Overcoming the memory bottleneck in suffix tree construction 39th Annual Symposium on Foundations of Computer Science. 10.1109/SFCS.1998.743441. 0-8186-9172-7. (174-183).

    http://ieeexplore.ieee.org/document/743441/

  • Arge L, Ferragina P, Grossi R and Vitter J. Sequence sorting in secondary storage Compression and Complexity of SEQUENCES 1997. 10.1109/SEQUEN.1997.666927. 0-8186-8132-2. (329-346).

    http://ieeexplore.ieee.org/document/666927/

  • Sadakane K. Text compression using recency rank with context and relation to context sorting, block sorting and PPM/sup */ Compression and Complexity of SEQUENCES 1997. 10.1109/SEQUEN.1997.666925. 0-8186-8132-2. (305-319).

    http://ieeexplore.ieee.org/document/666925/

  • Ferragina P and Luccio F. Multi-string search in BSP Compression and Complexity of SEQUENCES 1997. 10.1109/SEQUEN.1997.666919. 0-8186-8132-2. (240-252).

    http://ieeexplore.ieee.org/document/666919/

  • Apostolico A, Bock M and Xuyan Xu . Annotated statistical indices for sequence analysis Compression and Complexity of SEQUENCES 1997. 10.1109/SEQUEN.1997.666917. 0-8186-8132-2. (215-229).

    http://ieeexplore.ieee.org/document/666917/

  • Reif J and Storer J. Optimal lossless compression of a class of dynamic sources DCC '98 Data Compression Conference. 10.1109/DCC.1998.672221. 0-8186-8406-2. (501-510).

    http://ieeexplore.ieee.org/document/672221/

  • Larsson N. The context trees of block sorting compression DCC '98 Data Compression Conference. 10.1109/DCC.1998.672147. 0-8186-8406-2. (189-198).

    http://ieeexplore.ieee.org/document/672147/

  • Sadakane K. A fast algorithm for making suffix arrays and for Burrows-Wheeler transformation DCC '98 Data Compression Conference. 10.1109/DCC.1998.672139. 0-8186-8406-2. (129-138).

    http://ieeexplore.ieee.org/document/672139/

  • Apostolico A and Lonardi S. Some theory and practice of greedy off-line textual substitution DCC '98 Data Compression Conference. 10.1109/DCC.1998.672138. 0-8186-8406-2. (119-128).

    http://ieeexplore.ieee.org/document/672138/

  • Yip Chi Lap and Kao B. Indexing multilingual information on the Web Proceedings. The Twenty-Second Annual International Computer Software and Applications Conference (Compsac '98) (Cat. No.98CB 36241). 10.1109/CMPSAC.1998.716722. 0-8186-8585-9. (576-581).

    http://ieeexplore.ieee.org/document/716722/

  • Sagot M. (1998). Spelling approximate repeated or common motifs using a suffix tree. LATIN'98: Theoretical Informatics. 10.1007/BFb0054337. (374-390).

    http://link.springer.com/10.1007/BFb0054337

  • Brāzma A, Jonassen I, Vilo J and Ukkonen E. (1998). Pattern discovery in biosequences. Grammatical Inference. 10.1007/BFb0054081. (257-270).

    http://link.springer.com/10.1007/BFb0054081

  • Stoye J and Gusfield D. (1998). Simple and flexible detection of contiguous repeats using a suffix tree Preliminary Version. Combinatorial Pattern Matching. 10.1007/BFb0030787. (140-152).

    http://link.springer.com/10.1007/BFb0030787

  • Kim D, Kim Y and Park K. (1998). Constructing suffix arrays for multi-dimensional matrices. Combinatorial Pattern Matching. 10.1007/BFb0030786. (126-139).

    http://link.springer.com/10.1007/BFb0030786

  • Munro I, Raman V and Rao S. (1998). Space Efficient Suffix Trees. Foundations of Software Technology and Theoretical Computer Science. 10.1007/978-3-540-49382-2_17. (186-196).

    http://link.springer.com/10.1007/978-3-540-49382-2_17

  • Salomon D. (1998). Bibliography. Data Compression. 10.1007/978-1-4757-2939-9_7. (305-316).

    http://link.springer.com/10.1007/978-1-4757-2939-9_7

  • Salomon D. (1998). Other Methods. Data Compression. 10.1007/978-1-4757-2939-9_5. (251-299).

    http://link.springer.com/10.1007/978-1-4757-2939-9_5

  • Matias Y, Muthukrishnan S, Sahinalp S and Ziv J. (1998). Augmenting Suffix Trees, with Applications. Algorithms — ESA’ 98. 10.1007/3-540-68530-8_6. (67-78).

    http://link.springer.com/10.1007/3-540-68530-8_6

  • Arimura H, Wataki A, Fujino R and Arikawa S. (1998). A Fast Algorithm for Discovering Optimal String Patterns in Large Text Databases. Algorithmic Learning Theory. 10.1007/3-540-49730-7_19. (247-261).

    http://link.springer.com/10.1007/3-540-49730-7_19

  • Iliopoulos C and Korda M. (1998). Massively Parallel Suffix Array Construction. SOFSEM’ 98: Theory and Practice of Informatics. 10.1007/3-540-49477-4_29. (371-380).

    http://link.springer.com/10.1007/3-540-49477-4_29

  • Arimura H and Shimozono S. (1998). Maximizing Agreement with a Classification by Bounded or Unbounded number of Associated Words. Algorithms and Computation. 10.1007/3-540-49381-6_6. (41-49).

    http://link.springer.com/10.1007/3-540-49381-6_6

  • Mehta D and Sahni S. (1997). Models, techniques, and algorithms for finding, selecting, and displaying patterns in strings and other discrete objects. Journal of Systems and Software. 39:3. (201-221). Online publication date: 1-Dec-1997.

    https://doi.org/10.1016/S0164-1212(96)00110-0

  • Baker B. (1997). Parameterized Duplication in Strings. SIAM Journal on Computing. 26:5. (1343-1362). Online publication date: 1-Oct-1997.

    https://doi.org/10.1137/S0097539793246707

  • Johansen P. (1997). Adaptive Pattern Recognition. Journal of Mathematical Imaging and Vision. 7:4. (325-339). Online publication date: 1-Oct-1997.

    https://doi.org/10.1023/A:1008207228099

  • Hariharan R. (1997). Optimal Parallel Suffix Tree Construction. Journal of Computer and System Sciences. 55:1. (44-69). Online publication date: 1-Aug-1997.

    https://doi.org/10.1006/jcss.1997.1496

  • Giancarlo R and Grossi R. (1997). Multi-Dimensional Pattern Matching with Dimensional Wildcards. Journal of Algorithms. 24:2. (223-265). Online publication date: 1-Aug-1997.

    https://doi.org/10.1006/jagm.1996.0844

  • Hirsh H and Kudenko D. Representing sequences in description logics. Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence. (384-389).

    /doi/10.5555/1867406.1867465

  • Satta G and Henderson J. String transformation learning. Proceedings of the 35th Annual Meeting of the Association for Computational Linguistics and Eighth Conference of the European Chapter of the Association for Computational Linguistics. (444-451).

    https://doi.org/10.3115/976909.979674

  • Wang K. (1997). Discovering Patterns from Large and Dynamic Sequential Data. Journal of Intelligent Information Systems. 9:1. (33-56). Online publication date: 1-Jul-1997.

    https://doi.org/10.1023/A:1008689103430

  • Arge L, Ferragina P, Grossi R and Vitter J. On sorting strings in external memory (extended abstract). Proceedings of the twenty-ninth annual ACM symposium on Theory of computing. (540-548).

    https://doi.org/10.1145/258533.258647

  • Choi Y and Lam T. (1997). Dynamic suffix tree and two-dimensional texts management. Information Processing Letters. 61:4. (213-220). Online publication date: 28-Feb-1997.

    https://doi.org/10.1016/S0020-0190(97)00018-5

  • Ferragina P. (1997). Dynamic Text Indexing under String Updates. Journal of Algorithms. 22:2. (296-328). Online publication date: 1-Feb-1997.

    https://doi.org/10.1006/jagm.1996.0814

  • Farach M. Optimal suffix tree construction with large alphabets 38th Annual Symposium on Foundations of Computer Science. 10.1109/SFCS.1997.646102. 0-8186-8197-7. (137-143).

    http://ieeexplore.ieee.org/document/646102/

  • Min Wang , Vitter J and Iyer B. Selectivity estimation in the presence of alphanumeric correlations 13th International Conference on Data Engineering. 10.1109/ICDE.1997.581750. 0-8186-7807-0. (169-180).

    http://ieeexplore.ieee.org/document/581750/

  • Choffrut C and Karhumäki J. (1997). Combinatorics of Words. Handbook of Formal Languages. 10.1007/978-3-642-59136-5_6. (329-438).

    http://link.springer.com/10.1007/978-3-642-59136-5_6

  • Edelkamp S. (1997). Suffix tree automata in state space search. KI-97: Advances in Artificial Intelligence. 10.1007/3540634932_32. (381-384).

    http://link.springer.com/10.1007/3540634932_32

  • Giancarlo R and Guaiana D. (1997). On-line construction of two-dimensional suffix trees. Algorithms — ESA '97. 10.1007/3-540-63397-9_17. (217-231).

    http://link.springer.com/10.1007/3-540-63397-9_17

  • Apostolico A and Breslauer D. (1997). Of periods, quasiperiods, repetitions and covers. Structures in Logic and Computer Science. 10.1007/3-540-63246-8_14. (236-248).

    http://link.springer.com/10.1007/3-540-63246-8_14

  • Crochemore M and Vérin R. (1997). On compact directed acyclic word graphs. Structures in Logic and Computer Science. 10.1007/3-540-63246-8_12. (192-211).

    http://link.springer.com/10.1007/3-540-63246-8_12

  • Crochemore M and Vérin R. (1997). Direct construction of compact directed acyclic word graphs. Combinatorial Pattern Matching. 10.1007/3-540-63220-4_55. (116-129).

    http://link.springer.com/10.1007/3-540-63220-4_55

  • Ferragina P, Grossi R and Montangero M. (1997). A note on updating suffix tree labels. Algorithms and Complexity. 10.1007/3-540-62592-5_71. (181-192).

    http://link.springer.com/10.1007/3-540-62592-5_71

  • Giancarlo R and Grossi R. (1996). On the Construction of Classes of Suffix Trees for Square Matrices. Information and Computation. 130:2. (151-182). Online publication date: 1-Nov-1996.

    https://doi.org/10.1006/inco.1996.0087

  • Sadeh I. (2009). Universal Data Compression Algorithm Based on Approximate String Matching. Probability in the Engineering and Informational Sciences. 10.1017/S0269964800004502. 10:04. (465). Online publication date: 1-Oct-1996.

    http://www.journals.cambridge.org/abstract_S0269964800004502

  • Sadeh I. (1996). Optimal data compression algorithm. Computers & Mathematics with Applications. 10.1016/0898-1221(96)00135-6. 32:5. (57-72). Online publication date: 1-Sep-1996.

    http://linkinghub.elsevier.com/retrieve/pii/0898122196001356

  • Shang H and Merrettal T. (1996). Tries for Approximate String Matching. IEEE Transactions on Knowledge and Data Engineering. 8:4. (540-547). Online publication date: 1-Aug-1996.

    https://doi.org/10.1109/69.536247

  • Krishnan P, Vitter J and Iyer B. (1996). Estimating alphanumeric selectivity in the presence of wildcards. ACM SIGMOD Record. 25:2. (282-293). Online publication date: 1-Jun-1996.

    https://doi.org/10.1145/235968.233341

  • Krishnan P, Vitter J and Iyer B. Estimating alphanumeric selectivity in the presence of wildcards. Proceedings of the 1996 ACM SIGMOD international conference on Management of data. (282-293).

    https://doi.org/10.1145/233269.233341

  • Colussi L and De Col A. (1996). A time and space efficient data structure for string searching on large texts. Information Processing Letters. 10.1016/0020-0190(96)00061-0. 58:5. (217-222). Online publication date: 1-Jun-1996.

    http://linkinghub.elsevier.com/retrieve/pii/0020019096000610

  • Apostolico A and Preparata F. (1996). Data structures and algorithms for the string statistics problem. Algorithmica. 15:5. (481-494). Online publication date: 1-May-1996.

    https://doi.org/10.1007/BF01955046

  • Amir A, Benson G and Farach M. (1996). Let Sleeping Files Lie. Journal of Computer and System Sciences. 52:2. (299-307). Online publication date: 1-Apr-1996.

    https://doi.org/10.1006/jcss.1996.0023

  • Idury R and Schäffer A. (1996). Multiple matching of parameterized patterns. Theoretical Computer Science. 154:2. (203-224). Online publication date: 5-Feb-1996.

    https://doi.org/10.1016/0304-3975(94)00270-3

  • Clark D and Munro J. Efficient suffix trees on secondary storage. Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms. (383-391).

    /doi/10.5555/313852.314087

  • Ferragina P and Grossi R. Fast string searching in secondary storage. Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms. (373-382).

    /doi/10.5555/313852.314086

  • Sahinalp S and Vishkin U. Efficient approximate and dynamic matching of patterns using a labeling paradigm 37th Conference on Foundations of Computer Science. 10.1109/SFCS.1996.548491. 0-8186-7594-2. (320-328).

    http://ieeexplore.ieee.org/document/548491/

  • Ta-Chun Chou , Chen A and Chih-Chin Liu . Music databases: indexing techniques and implementation International Workshop on Multimedia Database Management Systems. 10.1109/MMDBMS.1996.541853. 0-8186-7469-5. (46-53).

    http://ieeexplore.ieee.org/document/541853/

  • Storer J. Lossless image compression using generalized LZ1-type methods Data Compression Conference - DCC '96. 10.1109/DCC.1996.488334. 0-8186-7358-3. (290-299).

    http://ieeexplore.ieee.org/document/488334/

  • Larsson N. Extended application of suffix trees to data compression Data Compression Conference - DCC '96. 10.1109/DCC.1996.488324. 0-8186-7358-3. (190-199).

    http://ieeexplore.ieee.org/document/488324/

  • Shi F. (1996). Suffix arrays for multiple strings: A method for on-line multiple string searches. Concurrency and Parallelism, Programming, Networking, and Security. 10.1007/BFb0027775. (11-22).

    http://link.springer.com/10.1007/BFb0027775

  • Hunt J, Vo K and Tichy W. (1996). An empirical study of delta algorithms. Software Configuration Management. 10.1007/BFb0023080. (49-66).

    http://link.springer.com/10.1007/BFb0023080

  • Brāzma A, Ukkonen E and Vilo J. (1996). Discovering unbounded unions of regular pattern languages from positive examples. Algorithms and Computation. 10.1007/BFb0009485. (95-104).

    http://link.springer.com/10.1007/BFb0009485

  • Choi Y and Lam T. (1996). Two-dimensional dynamic dictionary matching. Algorithms and Computation. 10.1007/BFb0009484. (85-94).

    http://link.springer.com/10.1007/BFb0009484

  • Plotkin N and Wyner A. (1996). An Entropy Estimator Algorithm and Telecommunications Applications. Maximum Entropy and Bayesian Methods. 10.1007/978-94-015-8729-7_29. (351-363).

    http://link.springer.com/10.1007/978-94-015-8729-7_29

  • Kärkkäinen J and Sutinen E. (1996). Lempel-Ziv index for q-grams. Algorithms — ESA '96. 10.1007/3-540-61680-2_69. (378-391).

    http://link.springer.com/10.1007/3-540-61680-2_69

  • Ferragina P and Luccio F. (1996). On the Parallel Dynamic Dictionary Matching problem: New results with applications. Algorithms — ESA '96. 10.1007/3-540-61680-2_61. (261-275).

    http://link.springer.com/10.1007/3-540-61680-2_61

  • Ferragina P. (1996). A simple parallel dictionary matching algorithm. Euro-Par'96 Parallel Processing. 10.1007/3-540-61626-8_102. (779-788).

    http://link.springer.com/10.1007/3-540-61626-8_102

  • Farach M and Muthukrishnan S. (1996). Optimal logarithmic time randomized suffix tree construction. Automata, Languages and Programming. 10.1007/3-540-61440-0_158. (550-561).

    http://link.springer.com/10.1007/3-540-61440-0_158

  • Kärkkäinen J and Ukkonen E. (1996). Sparse suffix trees. Computing and Combinatorics. 10.1007/3-540-61332-3_155. (219-230).

    http://link.springer.com/10.1007/3-540-61332-3_155

  • Andersson A, Larsson N and Swanson K. (1996). Suffix trees on words. Combinatorial Pattern Matching. 10.1007/3-540-61258-0_9. (102-115).

    http://link.springer.com/10.1007/3-540-61258-0_9

  • Amir A and Calinescu G. (1996). Alphabet independent and dictionary scaled matching. Combinatorial Pattern Matching. 10.1007/3-540-61258-0_23. (320-334).

    http://link.springer.com/10.1007/3-540-61258-0_23

  • Breslauer D. (1996). The suffix tree of a tree and minimizing sequential transducers. Combinatorial Pattern Matching. 10.1007/3-540-61258-0_10. (116-129).

    http://link.springer.com/10.1007/3-540-61258-0_10

  • Giegerich R and Kurtz S. (1995). A comparison of imperative and purely functional suffix tree constructions. Science of Computer Programming. 25:2-3. (187-218). Online publication date: 1-Dec-1995.

    https://doi.org/10.1016/0167-6423(95)00003-8

  • Ukkonen E. (1995). On-line construction of suffix trees. Algorithmica. 14:3. (249-260). Online publication date: 1-Sep-1995.

    https://doi.org/10.1007/BF01206331

  • Giancarlo R. (1995). A Generalization of the Suffix Tree to Square Matrices, with Applications. SIAM Journal on Computing. 24:3. (520-562). Online publication date: 1-Jun-1995.

    https://doi.org/10.1137/S0097539792231982

  • Amir A, Farach M, Idury R, Lapoutre J and Schaffer A. (1995). Improved Dynamic Dictionary Matching. Information and Computation. 119:2. (258-282). Online publication date: 1-Jun-1995.

    https://doi.org/10.1006/inco.1995.1090

  • Ferragina P and Grossi R. A fully-dynamic data structure for external substring search. Proceedings of the twenty-seventh annual ACM symposium on Theory of computing. (693-702).

    https://doi.org/10.1145/225058.225287

  • Kosaraju S and Delcher A. Large-scale assembly of DNA strings and space-efficient construction of suffix trees. Proceedings of the twenty-seventh annual ACM symposium on Theory of computing. (169-177).

    https://doi.org/10.1145/225058.225108

  • Ramesh R, Ramakrishnan I and Warren D. (1995). Automata-driven indexing of prolog clauses. The Journal of Logic Programming. 10.1016/0743-1066(94)00016-Y. 23:2. (151-202). Online publication date: 1-May-1995.

    http://linkinghub.elsevier.com/retrieve/pii/074310669400016Y

  • Johansen P. (1995). On-line string matching with feedback. Theoretical Computer Science. 141:1-2. (53-67). Online publication date: 17-Apr-1995.

    https://doi.org/10.1016/0304-3975(94)00184-7

  • Andersson A and Nilsson S. (1995). Efficient implementation of suffix trees. Software—Practice & Experience. 25:2. (129-141). Online publication date: 1-Feb-1995.

    https://doi.org/10.1002/spe.4380250203

  • Ferragina P and Grossi R. Fast incremental text editing. Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms. (531-540).

    /doi/10.5555/313651.313815

  • Jacobson V. (1995). Congestion avoidance and control. ACM SIGCOMM Computer Communication Review. 25:1. (157-187). Online publication date: 11-Jan-1995.

    https://doi.org/10.1145/205447.205462

  • Kent C and Mogul J. (1995). Fragmentation considered harmful. ACM SIGCOMM Computer Communication Review. 25:1. (75-87). Online publication date: 11-Jan-1995.

    https://doi.org/10.1145/205447.205456

  • Karn P and Partridge C. (1995). Improving round-trip time estimates in reliable transport protocols. ACM SIGCOMM Computer Communication Review. 25:1. (66-74). Online publication date: 11-Jan-1995.

    https://doi.org/10.1145/205447.205455

  • McQuillan J, Richer I and Rosen E. (1995). An overview of the new routing algorithm for the ARPANET. ACM SIGCOMM Computer Communication Review. 25:1. (54-60). Online publication date: 11-Jan-1995.

    https://doi.org/10.1145/205447.205453

  • Kleinrock L. (1995). Research areas in computer communication. ACM SIGCOMM Computer Communication Review. 25:1. (33-35). Online publication date: 11-Jan-1995.

    https://doi.org/10.1145/205447.205449

  • Baker B. On finding duplication and near-duplication in large software systems 2nd Working Conference on Reverse Engineering. 10.1109/WCRE.1995.514697. 0-8186-7111-4. (86-95).

    http://ieeexplore.ieee.org/document/514697/

  • Rao Kosaraju S. Faster algorithms for the construction of parameterized suffix trees IEEE 36th Annual Foundations of Computer Science. 10.1109/SFCS.1995.492664. 0-8186-7183-1. (631-638).

    http://ieeexplore.ieee.org/document/492664/

  • Ferragina P and Grossi R. Optimal on-line search and sublinear time update in string matching IEEE 36th Annual Foundations of Computer Science. 10.1109/SFCS.1995.492590. 0-8186-7183-1. (604-612).

    http://ieeexplore.ieee.org/document/492590/

  • Choi Y and Lam T. (1995). Two-dimensional pattern matching on a dynamic library of texts. Computing and Combinatorics. 10.1007/BFb0030874. (530-538).

    http://link.springer.com/10.1007/BFb0030874

  • Kosaraju S. (1995). Pattern matching in compressed texts. Foundations of Software Technology and Theoretical Computer Science. 10.1007/3-540-60692-0_60. (349-362).

    http://link.springer.com/10.1007/3-540-60692-0_60

  • Giancarlo R and Grossi R. (1995). On the construction of classes of suffix trees for square matrices: Algorithms and applications. Automata, Languages and Programming. 10.1007/3-540-60084-1_67. (111-122).

    http://link.springer.com/10.1007/3-540-60084-1_67

  • Park K and Kim D. (1995). String matching in hypertext. Combinatorial Pattern Matching. 10.1007/3-540-60044-2_51. (318-329).

    http://link.springer.com/10.1007/3-540-60044-2_51

  • Mewes H and Heumann K. (1995). Genome analysis: Pattern search in biological macromolecules. Combinatorial Pattern Matching. 10.1007/3-540-60044-2_48. (261-285).

    http://link.springer.com/10.1007/3-540-60044-2_48

  • Kärkkäinen J. (1995). Suffix cactus: A cross between suffix tree and suffix array. Combinatorial Pattern Matching. 10.1007/3-540-60044-2_43. (191-204).

    http://link.springer.com/10.1007/3-540-60044-2_43

  • Giancarlo R and Grossi R. (1995). Multi-dimensional pattern matching with dimensional wildcards. Combinatorial Pattern Matching. 10.1007/3-540-60044-2_37. (90-101).

    http://link.springer.com/10.1007/3-540-60044-2_37

  • Cobbs A. (1995). Fast approximate matching using suffix trees. Combinatorial Pattern Matching. 10.1007/3-540-60044-2_33. (41-54).

    http://link.springer.com/10.1007/3-540-60044-2_33

  • Landau G and Vishkin U. (1994). Pattern matching in a digitized image. Algorithmica. 10.1007/BF01185433. 12:4-5. (375-408). Online publication date: 1-Nov-1994.

    http://link.springer.com/10.1007/BF01185433

  • Chang W and Lawler E. (1994). Sublinear approximate string matching and biological applications. Algorithmica. 10.1007/BF01185431. 12:4-5. (327-344). Online publication date: 1-Nov-1994.

    http://link.springer.com/10.1007/BF01185431

  • Amir A, Farach M, Galil Z, Giancarlo R and Park K. (1994). Dynamic dictionary matching. Journal of Computer and System Sciences. 49:2. (208-222). Online publication date: 1-Oct-1994.

    https://doi.org/10.1016/S0022-0000(05)80047-9

  • Idury R and Schäffer A. (1994). Dynamic dictionary matching with failure functions. Theoretical Computer Science. 131:2. (295-310). Online publication date: 12-Sep-1994.

    https://doi.org/10.1016/0304-3975(94)90176-7

  • López-Ortiz A. (1994). Linear pattern matching of repeated substrings. ACM SIGACT News. 25:3. (114-121). Online publication date: 1-Sep-1994.

    https://doi.org/10.1145/193820.193842

  • Wang J, Chirn G, Marr T, Shapiro B, Shasha D and Zhang K. (1994). Combinatorial pattern discovery for scientific data. ACM SIGMOD Record. 23:2. (115-125). Online publication date: 1-Jun-1994.

    https://doi.org/10.1145/191843.191863

  • Wang J, Chirn G, Marr T, Shapiro B, Shasha D and Zhang K. Combinatorial pattern discovery for scientific data. Proceedings of the 1994 ACM SIGMOD international conference on Management of data. (115-125).

    https://doi.org/10.1145/191839.191863

  • Kosaraju S. Real-time pattern matching and quasi-real-time construction of suffix trees (preliminary version). Proceedings of the twenty-sixth annual ACM symposium on Theory of Computing. (310-316).

    https://doi.org/10.1145/195058.195170

  • Sahinalp S and Vishkin U. Symmetry breaking for suffix tree construction. Proceedings of the twenty-sixth annual ACM symposium on Theory of Computing. (300-309).

    https://doi.org/10.1145/195058.195164

  • Hariharan R. Optimal parallel suffix tree construction. Proceedings of the twenty-sixth annual ACM symposium on Theory of Computing. (290-299).

    https://doi.org/10.1145/195058.195162

  • Jacquet P and Szpankowski W. (1994). Autocorrelation on words and its applications. Journal of Combinatorial Theory Series A. 66:2. (237-269). Online publication date: 1-May-1994.

    https://doi.org/10.1016/0097-3165(94)90065-5

  • Amir A, Benson G and Farach M. (1994). An Alphabet Independent Approach to Two-Dimensional Pattern Matching. SIAM Journal on Computing. 23:2. (313-323). Online publication date: 1-Apr-1994.

    https://doi.org/10.1137/S0097539792226321

  • Mehta D and Sahni S. (1994). Computing Display Conflicts in String Visualization. IEEE Transactions on Computers. 43:3. (350-361). Online publication date: 1-Mar-1994.

    https://doi.org/10.1109/12.272435

  • Amir A, Benson G and Farach M. Let sleeping files lie. Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms. (705-714).

    /doi/10.5555/314464.314678

  • Gu M, Farach M and Beigel R. An efficient algorithm for dynamic text indexing. Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms. (697-704).

    /doi/10.5555/314464.314675

  • Morgera S and Hallik J. A fast algorithm for entropy estimation of grey-level images Workshop on Physics and Computation. PhysComp '94. 10.1109/PHYCMP.1994.363676. 0-8186-6715-X. (233-238).

    http://ieeexplore.ieee.org/document/363676/

  • Vishkin U. Can parallel algorithms enhance serial implementation? 8th International Parallel Processing Symposium. 10.1109/IPPS.1994.288274. 0-8186-5602-6. (376-385).

    http://ieeexplore.ieee.org/document/288274/

  • Bieganski , Riedl , Cartis and Retzel . (1994). Generalized suffix trees for biological sequence data: applications and implementation Proceedings of the Twenty-Seventh Annual Hawaii International Conference on System Sciences. 10.1109/HICSS.1994.323593. 0-8186-5090-7. (35-44).

    http://ieeexplore.ieee.org/document/323593/

  • Roos , Fei Shi and Widmayer . (1994). A data structure for approximate string searching Proceedings of the Twenty-Seventh Annual Hawaii International Conference on System Sciences. 10.1109/HICSS.1994.323592. 0-8186-5090-7. (45-46).

    http://ieeexplore.ieee.org/document/323592/

  • Ferragina P. (1994). Incremental text editing: a new data structure. Algorithms — ESA '94. 10.1007/BFb0049434. (495-507).

    http://link.springer.com/10.1007/BFb0049434

  • Day W and McMorris F. (1994). Alignment, Comparison and Consensus of Molecular Sequences. New Approaches in Classification and Data Analysis. 10.1007/978-3-642-51175-2_38. (327-346).

    http://link.springer.com/10.1007/978-3-642-51175-2_38

  • Myers E. (1994). Algorithmic Advances for Searching Biosequence Databases. Computational Methods in Genome Research. 10.1007/978-1-4615-2451-9_10. (121-135).

    http://link.springer.com/10.1007/978-1-4615-2451-9_10

  • Nakanishi M, Hasidume M, Ito M and Hashimoto A. (1994). A linear-time algorithm for computing characteristic strings. Algorithms and Computation. 10.1007/3-540-58325-4_195. (315-323).

    http://link.springer.com/10.1007/3-540-58325-4_195

  • Cobbs A. (1994). Fast identification of approximately matching substrings. Combinatorial Pattern Matching. 10.1007/3-540-58094-8_6. (64-74).

    http://link.springer.com/10.1007/3-540-58094-8_6

  • Idury R and Schäffer A. (1994). Multiple matching of parameterized patterns. Combinatorial Pattern Matching. 10.1007/3-540-58094-8_20. (226-239).

    http://link.springer.com/10.1007/3-540-58094-8_20

  • Breslauer D. (1994). Dictionary-matching on unbounded alphabets: Uniform length dictionaries. Combinatorial Pattern Matching. 10.1007/3-540-58094-8_17. (184-197).

    http://link.springer.com/10.1007/3-540-58094-8_17

  • Kosaraju S. (1994). Computation of squares in a string. Combinatorial Pattern Matching. 10.1007/3-540-58094-8_13. (146-150).

    http://link.springer.com/10.1007/3-540-58094-8_13

  • Giegerich R and Kurtz S. (1994). Suffix trees in the functioned programming paradigm. Programming Languages and Systems — ESOP '94. 10.1007/3-540-57880-3_15. (225-240).

    http://link.springer.com/10.1007/3-540-57880-3_15

  • Sahinalp S and Vishkin U. (1994). On a parallel-algorithms method for string matching problems (overview). Algorithms and Complexity. 10.1007/3-540-57811-0_3. (22-32).

    http://link.springer.com/10.1007/3-540-57811-0_3

  • Szpankowski W. (1993). A generalized suffix tree and its (un)expected asymptotic behaviors. SIAM Journal on Computing. 22:6. (1176-1198). Online publication date: 1-Dec-1993.

    https://doi.org/10.1137/0222070

  • Morita H and Kobayashi K. (2006). On asymptotic optimality of a sliding window variation of Lempel-Ziv codes. IEEE Transactions on Information Theory. 39:6. (1840-1846). Online publication date: 1-Nov-1993.

    https://doi.org/10.1109/18.265494

  • Apostolico A and Ehrenfeucht A. (1993). Efficient detection of quasiperiodicities in strings. Theoretical Computer Science. 119:2. (247-265). Online publication date: 25-Oct-1993.

    https://doi.org/10.1016/0304-3975(93)90159-Q

  • Manber U and Myers G. (1993). Suffix arrays. SIAM Journal on Computing. 22:5. (935-948). Online publication date: 1-Oct-1993.

    https://doi.org/10.1137/0222058

  • Szpankowski W. (2006). Asymptotic properties of data compression and suffix trees. IEEE Transactions on Information Theory. 39:5. (1647-1659). Online publication date: 1-Sep-1993.

    https://doi.org/10.1109/18.259648

  • Zobel J, Moffat A and Sacks-Davis R. Searching Large Lexicons for Partially Specified Terms using Compressed Inverted Files. Proceedings of the 19th International Conference on Very Large Data Bases. (290-301).

    /doi/10.5555/645919.672653

  • Giancarlo R and Grossi R. Parallel construction and query of suffix trees for two-dimensional matrices. Proceedings of the fifth annual ACM symposium on Parallel Algorithms and Architectures. (86-97).

    https://doi.org/10.1145/165231.165243

  • Mehta D and Sahni S. (1993). A Data Structure for Circular String Analysis and Visualization. IEEE Transactions on Computers. 42:8. (992-997). Online publication date: 1-Aug-1993.

    https://doi.org/10.1109/12.238492

  • Bell T and Kulp D. (1993). Longest-match string searching for ziv-lempel compression. Software: Practice and Experience. 10.1002/spe.4380230705. 23:7. (757-771). Online publication date: 1-Jul-1993.

    https://onlinelibrary.wiley.com/doi/10.1002/spe.4380230705

  • Baker B. A theory of parameterized pattern matching. Proceedings of the twenty-fifth annual ACM symposium on Theory of Computing. (71-80).

    https://doi.org/10.1145/167088.167115

  • Fischer M. (1992). Unifying software elements with LISP-based object-oriented technology. ACM SIGPLAN Lisp Pointers. VI:2. (33-42). Online publication date: 1-Apr-1993.

    https://doi.org/10.1145/174186.174191

  • Grund M and Timmermann G. (1992). Supporting complex flight scheduling tasks using CLOS and Statice. ACM SIGPLAN Lisp Pointers. VI:2. (23-32). Online publication date: 1-Apr-1993.

    https://doi.org/10.1145/174186.174190

  • Hodgkinson J. (1992). Sleeping with the enemy. ACM SIGPLAN Lisp Pointers. VI:2. (16-22). Online publication date: 1-Apr-1993.

    https://doi.org/10.1145/174186.174189

  • Shoop E, Srivastava J, Bieganski P, Riedl J and Retzel E. An object-oriented genetics information system. Proceedings of the 1993 ACM/SIGAPP symposium on Applied computing: states of the art and practice. (641-651).

    https://doi.org/10.1145/162754.167189

  • Grossi R. (1993). On finding common subtrees. Theoretical Computer Science. 108:2. (345-356). Online publication date: 15-Feb-1993.

    https://doi.org/10.1016/0304-3975(93)90198-3

  • Apostolico A. (1993). Efficient CRCW-PRAM algorithms for universal substring searching. Theoretical Computer Science. 108:2. (331-344). Online publication date: 15-Feb-1993.

    https://doi.org/10.1016/0304-3975(93)90197-2

  • Giancarlo R. The Suffix of a square matrix, with applications. Proceedings of the fourth annual ACM-SIAM symposium on Discrete algorithms. (402-411).

    /doi/10.5555/313559.313842

  • Promhouse G. Tree compacting transformations [Proceedings] DCC `93: Data Compression Conference. 10.1109/DCC.1993.253117. 0-8186-3392-1. (320-329).

    http://ieeexplore.ieee.org/document/253117/

  • Gusev V, Kulichkov V and Chupakhina O. (1993). The Lempel-Ziv complexity and local structure analysis of genomes. Biosystems. 10.1016/0303-2647(93)90070-S. 30:1-3. (183-200). Online publication date: 1-Jan-1993.

    http://linkinghub.elsevier.com/retrieve/pii/030326479390070S

  • Ukkonen E. Approximate string-matching over suffix trees. Combinatorial Pattern Matching. 10.1007/BFb0029808. (228-242).

    http://www.springerlink.com/index/10.1007/BFb0029808

  • Akutsu T. A linear time pattern matching algorithm between a string and a tree. Combinatorial Pattern Matching. 10.1007/BFb0029792. (1-10).

    http://www.springerlink.com/index/10.1007/BFb0029792

  • Ukkonen E. (1993). Approximate string-matching and the q-gram distance. Sequences II. 10.1007/978-1-4613-9323-8_22. (300-312).

    http://link.springer.com/10.1007/978-1-4613-9323-8_22

  • Gusfield D, Landau G and Schieber B. (1993). An Efficient Algorithm for the All Pairs Suffix-Prefix Problem. Sequences II. 10.1007/978-1-4613-9323-8_16. (218-224).

    http://link.springer.com/10.1007/978-1-4613-9323-8_16

  • Breslauer D and Galil Z. (1993). Parallel string matching algorithms. Sequences II. 10.1007/978-1-4613-9323-8_10. (121-142).

    http://link.springer.com/10.1007/978-1-4613-9323-8_10

  • Giancarlo R. (1993). An index data structure for matrices, with applications to fast two-dimensional pattern matching. Algorithms and Data Structures. 10.1007/3-540-57155-8_260. (337-348).

    http://link.springer.com/10.1007/3-540-57155-8_260

  • O’Connor L and Snider T. Suffix trees and string complexity. Advances in Cryptology — EUROCRYPT’ 92. 10.1007/3-540-47555-9_12. (138-152).

    http://link.springer.com/10.1007/3-540-47555-9_12

  • Amir A and Farach M. (1992). Two-dimensional dictionary matching. Information Processing Letters. 44:5. (233-239). Online publication date: 21-Dec-1992.

    https://doi.org/10.1016/0020-0190(92)90206-B

  • Landau G and Vishkin U. Pattern matching in a digitized image. Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms. (453-462).

    /doi/10.5555/139404.139490

  • Szpankowski W. (Un)expected behavior of typical suffix trees. Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms. (422-431).

    /doi/10.5555/139404.139487

  • Apostolico A and Szpankowski W. (1992). Self-alignments in words and their applications. Journal of Algorithms. 13:3. (446-467). Online publication date: 1-Sep-1992.

    https://doi.org/10.1016/0196-6774(92)90049-I

  • Eppstein D, Galil Z, Giancarlo R and Italiano G. (1992). Sparse dynamic programming I. Journal of the ACM. 39:3. (519-545). Online publication date: 1-Jul-1992.

    https://doi.org/10.1145/146637.146650

  • Amir A, Benson G and Farach M. Alphabet independent two dimensional matching. Proceedings of the twenty-fourth annual ACM symposium on Theory of Computing. (59-68).

    https://doi.org/10.1145/129712.129719

  • Barron S, Witten M and Liu G. (1992). A bibliography on computational molecular biology and genetics. Mathematical and Computer Modelling: An International Journal. 16:6-7. (245-319). Online publication date: 1-Jun-1992.

    https://doi.org/10.1016/0895-7177(92)90166-I

  • O'Connor L and Snider T. Suffix trees and string complexity. Proceedings of the 11th annual international conference on Theory and application of cryptographic techniques. (138-152).

    /doi/10.5555/1754948.1754964

  • Gusfield D, Landau G and Schieber B. (1992). An efficient algorithm for the All Pairs Suffix-Prefix Problem. Information Processing Letters. 41:4. (181-185). Online publication date: 18-Mar-1992.

    https://doi.org/10.1016/0020-0190(92)90176-V

  • Devroye L, Szpankowski W and Rais B. (1992). A note on the height of suffix trees. SIAM Journal on Computing. 21:1. (48-53). Online publication date: 1-Feb-1992.

    https://doi.org/10.1137/0221005

  • Ukkonen E. (1992). Approximate string-matching with q-grams and maximal matches. Theoretical Computer Science. 92:1. (191-211). Online publication date: 6-Jan-1992.

    https://doi.org/10.1016/0304-3975(92)90143-4

  • Quong R. (1992). Fast average-case pattern matching by multiplexing sparse tables. Theoretical Computer Science. 92:1. (165-179). Online publication date: 6-Jan-1992.

    https://doi.org/10.1016/0304-3975(92)90141-2

  • Amir A, Landau G and Vishkin U. (1992). Efficient pattern matching with scaling. Journal of Algorithms. 13:1. (2-32). Online publication date: 1-Jan-1992.

    https://doi.org/10.1016/0196-6774(92)90003-U

  • Storer J. (1992). Massively Parallel Systolic Algorithms for Real-Time Dictionary-Based Text Compression. Image and Text Compression. 10.1007/978-1-4615-3596-6_7. (159-178).

    http://link.springer.com/10.1007/978-1-4615-3596-6_7

  • Idury R and Schäffer A. (1992). Dynamic dictionary matching with failure functions. Combinatorial Pattern Matching. 10.1007/3-540-56024-6_22. (276-287).

    http://link.springer.com/10.1007/3-540-56024-6_22

  • Mehta D and Sahni S. (1992). Computing display conflicts in string and circular string visualization. Combinatorial Pattern Matching. 10.1007/3-540-56024-6_20. (244-261).

    http://link.springer.com/10.1007/3-540-56024-6_20

  • Chang W and Lampe J. (1992). Theoretical and empirical comparisons of approximate string matching algorithms. Combinatorial Pattern Matching. 10.1007/3-540-56024-6_14. (175-184).

    http://link.springer.com/10.1007/3-540-56024-6_14

  • Szpankowski W. (1992). Probabilistic analysis of generalized suffix trees. Combinatorial Pattern Matching. 10.1007/3-540-56024-6_1. (1-14).

    http://link.springer.com/10.1007/3-540-56024-6_1

  • Amir A and Farach M. Adaptive dictionary matching. Proceedings of the 32nd annual symposium on Foundations of computer science. (760-766).

    https://doi.org/10.1109/SFCS.1991.185445

  • Crochemore M and Perrin D. (1991). Two-way string-matching. Journal of the ACM. 38:3. (650-674). Online publication date: 1-Jul-1991.

    https://doi.org/10.1145/116825.116845

  • Szpankowski W. A typical behavior of some data compression schemes Data Compression Conference. 10.1109/DCC.1991.213356. 0-8186-9202-2. (247-256).

    http://ieeexplore.ieee.org/document/213356/

  • Penzhorn W. Complexity measures for cryptographic sequences COMSIG 1991: South African Symposium on Communications and Signal Processing. 10.1109/COMSIG.1991.278245. 0-7803-0040-8. (178-185).

    http://ieeexplore.ieee.org/document/278245/

  • Jacquet P and Szpankowski W. What can we learn about suffix trees from independent tries?. Algorithms and Data Structures. 10.1007/BFb0028265. (228-239).

    http://www.springerlink.com/index/10.1007/BFb0028265

  • Jokinen P and Ukkonen E. (1991). Two algorithms for approxmate string matching in static texts. Mathematical Foundations of Computer Science 1991. 10.1007/3-540-54345-7_67. (240-248).

    http://link.springer.com/10.1007/3-540-54345-7_67

  • Naor M. (1991). String matching with preprocessing of text and pattern. Automata, Languages and Programming. 10.1007/3-540-54233-7_179. (739-750).

    http://link.springer.com/10.1007/3-540-54233-7_179

  • Zito-Wolf . A broadcast/reduce architecture for high-speed data compression. Proceedings of the 1990 IEEE Second Symposium on Parallel and Distributed Processing. (174-181).

    https://doi.org/10.1109/SPDP.1990.143529

  • Chang W and Lawler E. Approximate string matching in sublinear expected time. Proceedings of the 31st Annual Symposium on Foundations of Computer Science. (116-124 vol.1).

    https://doi.org/10.1109/FSCS.1990.89530

  • Foulser D and Core N. (1990). Parallel computation of multiple biological sequence comparisons. Computers and Biomedical Research. 23:4. (310-331). Online publication date: 1-Aug-1990.

    https://doi.org/10.1016/0010-4809(90)90024-7

  • Bertossi A, Luccio F, Lodi E and Pagli L. (1990). String matching with weighted errors. Theoretical Computer Science. 73:3. (319-328). Online publication date: 22-Jul-1990.

    https://doi.org/10.1016/0304-3975(90)90182-H

  • Crochemore M and Rytter W. (1990). Parallel construction of minimal suffix and factor automata. Information Processing Letters. 35:3. (121-128). Online publication date: 1-Jul-1990.

    https://doi.org/10.1016/0020-0190(90)90060-B

  • Wolfson H. (1990). On curve matching. IEEE Transactions on Pattern Analysis and Machine Intelligence. 12:5. (483-489). Online publication date: 1-May-1990.

    https://doi.org/10.1109/34.55108

  • Amir A, Landau G and Vishkin U. Efficient pattern matching with scaling. Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms. (344-357).

    /doi/10.5555/320176.320220

  • Manber U and Myers G. Suffix arrays. Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms. (319-327).

    /doi/10.5555/320176.320218

  • Purdin T. Compressing tries for storing dictionaries 1990 Symposium on Applied Computing. 10.1109/SOAC.1990.82193. 0-8186-2031-5. (336-340).

    http://ieeexplore.ieee.org/document/82193/

  • PERRIN D. (1990). Finite Automata. Formal Models and Semantics. 10.1016/B978-0-444-88074-1.50006-8. (1-57).

    https://linkinghub.elsevier.com/retrieve/pii/B9780444880741500068

  • AHO A. (1990). Algorithms for Finding Patterns in Strings. Algorithms and Complexity. 10.1016/B978-0-444-88071-0.50010-2. (255-300).

    https://linkinghub.elsevier.com/retrieve/pii/B9780444880710500102

  • Landau G, Vishkin U and Nussinov R. (1990). [31] Fast alignment of DNA and protein sequences. . 10.1016/0076-6879(90)83033-6. (487-502).

    http://linkinghub.elsevier.com/retrieve/pii/0076687990830336

  • Timkovskii V. (1990). Complexity of common subsequence and supersequence problems and related problems. Cybernetics. 10.1007/BF01075212. 25:5. (565-580).

    http://link.springer.com/10.1007/BF01075212

  • Crochemore M. (1990). Constant-Space String-Matching. Sequences. 10.1007/978-1-4612-3352-7_3. (41-44).

    https://link.springer.com/10.1007/978-1-4612-3352-7_3

  • Blumer A. (1990). Applications of DAWGs to Data Compression. Sequences. 10.1007/978-1-4612-3352-7_24. (303-311).

    https://link.springer.com/10.1007/978-1-4612-3352-7_24

  • Jansen C and Boekee D. The Shortest Feedback Shift Register That Can Generate A Given Sequence. Advances in Cryptology — CRYPTO’ 89 Proceedings. 10.1007/0-387-34805-0_10. (90-99).

    http://link.springer.com/10.1007/0-387-34805-0_10

  • Ramesh R, Ramakrishnan I and Warren D. Automata-driven indexing of Prolog clauses. Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages. (281-291).

    https://doi.org/10.1145/96709.96738

  • Kosaraju S. Efficient tree pattern matching. Proceedings of the 30th Annual Symposium on Foundations of Computer Science. (178-183).

    https://doi.org/10.1109/SFCS.1989.63475

  • Turner J. (1989). Approximation algorithms for the shortest common superstring problem. Information and Computation. 83:1. (1-20). Online publication date: 1-Oct-1989.

    https://doi.org/10.1016/0890-5401(89)90044-8

  • Main M. (1989). Detecting leftmost maximal periodicities. Discrete Applied Mathematics. 25:1-2. (145-153). Online publication date: 1-Sep-1989.

    https://doi.org/10.1016/0166-218X(89)90051-6

  • Jensen C and Boekee D. The shortest feedback shift register that can generate a given sequence. Proceedings on Advances in cryptology. (90-99).

    /doi/10.5555/118209.118219

  • Baeza-Yates R. (1989). Algorithms for string searching. ACM SIGIR Forum. 23:3-4. (34-58). Online publication date: 1-Apr-1989.

    https://doi.org/10.1145/74697.74700

  • Fiala E and Greene D. (1989). Data compression with finite windows. Communications of the ACM. 32:4. (490-505). Online publication date: 1-Apr-1989.

    https://doi.org/10.1145/63334.63341

  • Blumer A, Ehrenfeucht A and Haussler D. (1989). Average sizes of suffix trees and DAWGs. Discrete Applied Mathematics. 10.1016/0166-218X(92)90270-K. 24:1-3. (37-45).

    http://linkinghub.elsevier.com/retrieve/pii/0166218X9290270K

  • Perrin D. (1989). Automates et algorithmes sur les motsAutomata and string algorithms. Annales Des Télécommunications. 10.1007/BF02999876. 44:1-2. (20-33). Online publication date: 1-Jan-1989.

    https://link.springer.com/10.1007/BF02999876

  • Apostolico A, Iliopoulos C, Landau G, Schieber B and Vishkin U. (1988). Parallel construction of a suffix tree with applications. Algorithmica. 3:1-4. (347-365). Online publication date: 1-Nov-1988.

    https://doi.org/10.1007/BF01762122

  • Spehner J. (1988). Recognition of the factors of a finite language in a linear time text. Theoretical Computer Science. 60:3. (341-381). Online publication date: 3-Sep-1988.

    https://doi.org/10.1016/0304-3975(88)90116-8

  • Ehrenfeucht A and Haussler D. (1988). A new distance metric on strings computable in linear time. Discrete Applied Mathematics. 20:3. (191-203). Online publication date: 1-Jul-1988.

    https://doi.org/10.1016/0166-218X(88)90076-5

  • Miller W and Myers E. (2006). A simple row‐replacement method. Software: Practice and Experience. 10.1002/spe.4380180703. 18:7. (597-611). Online publication date: 1-Jul-1988.

    https://onlinelibrary.wiley.com/doi/10.1002/spe.4380180703

  • Galil Z and Giancarlo R. (1988). Data structures and algorithms for approximate string matching. Journal of Complexity. 4:1. (33-72). Online publication date: 1-Mar-1988.

    https://doi.org/10.1016/0885-064X(88)90008-8

  • Crochemore M. String matching with constraints. Mathematical Foundations of Computer Science 1988. 10.1007/BFb0017130. (44-58).

    http://link.springer.com/10.1007/BFb0017130

  • Crochemore M and Perrin D. (1988). Pattern Matching in Strings. Image Analysis and Processing II. 10.1007/978-1-4613-1007-5_6. (67-79).

    http://link.springer.com/10.1007/978-1-4613-1007-5_6

  • Crochemore M. (1988). Constant-space string-matching. Foundations of Software Technology and Theoretical Computer Science. 10.1007/3-540-50517-2_72. (80-87).

    http://link.springer.com/10.1007/3-540-50517-2_72

  • Spehner J. (1988). La Reconnaissance Des Facteurs D'un Langage Fini Dans Un Texte En Temps Lineaire - Resume -. Automata, Languages and Programming. 10.1007/3-540-19488-6_141. (547-560).

    http://link.springer.com/10.1007/3-540-19488-6_141

  • Blumer J. (1987). How much is that DAWG in the window? A moving window algorithm for the directed acyclic word graph. Journal of Algorithms. 8:4. (451-469). Online publication date: 1-Dec-1987.

    https://doi.org/10.1016/0196-6774(87)90045-9

  • Kempf M, Bayer R and Güntzer U. (1987). Time optimal left to right construction of position trees. Acta Informatica. 24:4. (461-474). Online publication date: 1-Aug-1987.

    https://doi.org/10.1007/BF00292114

  • Blumer A, Blumer J, Haussler D, McConnell R and Ehrenfeucht A. (1987). Complete inverted files for efficient text retrieval and analysis. Journal of the ACM. 34:3. (578-595). Online publication date: 1-Jul-1987.

    https://doi.org/10.1145/28869.28873

  • Galil Z and Giancarlo R. (1987). Parallel string matching with k mismatches. Theoretical Computer Science. 10.1016/0304-3975(87)90042-9. 51:3. (341-348).

    http://linkinghub.elsevier.com/retrieve/pii/0304397587900429

  • Obst W. Delta technique and string-to-string correction. ESEC '87. 10.1007/BFb0022099. (64-68).

    http://www.springerlink.com/index/10.1007/BFb0022099

  • Landau G, Schieber B and Vishkin U. (1987). Parallel construction of a suffix tree. Automata, Languages and Programming. 10.1007/3-540-18088-5_26. (314-325).

    http://link.springer.com/10.1007/3-540-18088-5_26

  • Bell T. (1986). Better OPM/L Text Compression. IEEE Transactions on Communications. 10.1109/TCOM.1986.1096485. 34:12. (1176-1182). Online publication date: 1-Dec-1986.

    http://ieeexplore.ieee.org/document/1096485/

  • Myers E. (2023). AnO(ND) difference algorithm and its variations. Algorithmica. 1:1-4. (251-266). Online publication date: 1-Nov-1986.

    https://doi.org/10.1007/BF01840446

  • Crochemore M. (1986). Transducers and repetitions. Theoretical Computer Science. 45:C. (63-86). Online publication date: 1-Jun-1986.

    https://doi.org/10.1016/0304-3975(86)90041-1

  • Seiferas J. (1986). A simplified lower bound for context-free-language recognition. Information and Control. 69:1-3. (255-260). Online publication date: 1-Apr-1986.

    https://doi.org/10.1016/S0019-9958(86)80048-1

  • Spehner J. (1986). La reconnaissance des facteurs d'un mot dans un texte. Theoretical Computer Science. 10.1016/0304-3975(86)90082-4. 48. (35-52).

    http://linkinghub.elsevier.com/retrieve/pii/0304397586900824

  • Apostolico A and Preparata F. (1985). Structural properties of the string statistics problem. Journal of Computer and System Sciences. 31:3. (394-411). Online publication date: 1-Dec-1985.

    https://doi.org/10.1016/0022-0000(85)90060-1

  • Blumer A, Blumer J, Haussler D, Ehrenfeucht A, Chen M and Seiferas J. (1985). The smallest automation recognizing the subwords of a text. Theoretical Computer Science. 10.1016/0304-3975(85)90157-4. 40. (31-55).

    http://linkinghub.elsevier.com/retrieve/pii/0304397585901574

  • Storer J. (1985). Textual Substitution Techniques for Data Compression. Combinatorial Algorithms on Words. 10.1007/978-3-642-82456-2_8. (111-129).

    http://link.springer.com/10.1007/978-3-642-82456-2_8

  • Chen M and Seiferas J. (1985). Efficient and Elegant Subword-Tree Construction. Combinatorial Algorithms on Words. 10.1007/978-3-642-82456-2_7. (97-107).

    http://www.springerlink.com/index/10.1007/978-3-642-82456-2_7

  • Apostolico A. (1985). The Myriad Virtues of Subword Trees. Combinatorial Algorithms on Words. 10.1007/978-3-642-82456-2_6. (85-96).

    http://www.springerlink.com/index/10.1007/978-3-642-82456-2_6

  • Capocelli R and Hoffmann C. (1985). Algorithms for Factorizing and Testing Subsemigroups. Combinatorial Algorithms on Words. 10.1007/978-3-642-82456-2_5. (59-81).

    http://www.springerlink.com/index/10.1007/978-3-642-82456-2_5

  • Rabin M. (1985). Discovering Repetitions in Strings. Combinatorial Algorithms on Words. 10.1007/978-3-642-82456-2_19. (279-288).

    http://www.springerlink.com/index/10.1007/978-3-642-82456-2_19

  • Hartman A and Rodeh M. (1985). Optimal Parsing of Strings. Combinatorial Algorithms on Words. 10.1007/978-3-642-82456-2_11. (155-167).

    http://www.springerlink.com/index/10.1007/978-3-642-82456-2_11

  • Blumer A, Blumer J, Ehrenfeucht A, Haussler D and McConnell R. Building a complete inverted file for a set of text files in linear time. Proceedings of the sixteenth annual ACM symposium on Theory of computing. (349-358).

    https://doi.org/10.1145/800057.808700

  • Tichy W. (1984). The string-to-string correction problem with block moves. ACM Transactions on Computer Systems. 2:4. (309-321). Online publication date: 1-Nov-1984.

    https://doi.org/10.1145/357401.357404

  • Fraser C, Myers E and Wendt A. Analyzing and compressing assembly code. Proceedings of the 1984 SIGPLAN symposium on Compiler construction. (117-121).

    https://doi.org/10.1145/502874.502886

  • Fraser C, Myers E and Wendt A. (1984). Analyzing and compressing assembly code. ACM SIGPLAN Notices. 19:6. (117-121). Online publication date: 1-Jun-1984.

    https://doi.org/10.1145/502949.502886

  • Apostolico A and Giancarlo R. (1984). Pattern matching machine implementation of a fast test for unique decipherability. Information Processing Letters. 18:3. (155-158). Online publication date: 22-Mar-1984.

    https://doi.org/10.1016/0020-0190(84)90020-6

  • Apostolico A. (2011). On context constrained squares and repetitions in a string. RAIRO. Informatique théorique. 10.1051/ita/1984180201471. 18:2. (147-159).

    http://www.rairo-ita.org/10.1051/ita/1984180201471

  • Hoffmann C. A note on unique decipherability. Mathematical Foundations of Computer Science 1984. 10.1007/BFb0030289. (50-63).

    http://www.springerlink.com/index/10.1007/BFb0030289

  • Blumer A, Blumer J, Ehrenfeucht A, Haussler D and McConnell R. (1984). Building the minimal DFA for the set of all subwords of a word on-line in linear time. Automata, Languages and Programming. 10.1007/3-540-13345-3_9. (109-118).

    http://link.springer.com/10.1007/3-540-13345-3_9

  • Berstel J. (1984). Some recent results on squarefree words. STACS 84. 10.1007/3-540-12920-0_2. (14-25).

    http://link.springer.com/10.1007/3-540-12920-0_2

  • Parikh J and Hedrick G. (2016). On-Line Data Entry for Information Systems Which Use Vsam Files. The Journal of Data Education. 10.1080/00220310.1983.11646267. 23:4. (3-6). Online publication date: 1-Jul-1983.

    https://www.tandfonline.com/doi/full/10.1080/00220310.1983.11646267

  • Apostolico A and Preparata F. (1983). Optimal off-line detection of repetitions in a string. Theoretical Computer Science. 10.1016/0304-3975(83)90109-3. 22:3. (297-315). Online publication date: 1-Feb-1983.

    http://linkinghub.elsevier.com/retrieve/pii/0304397583901093

  • Slisenko A. (1983). Detection of periodicities and string-matching in real time. Journal of Soviet Mathematics. 10.1007/BF01084395. 22:3. (1316-1387).

    http://link.springer.com/10.1007/BF01084395

  • Storer J and Szymanski T. (1982). Data compression via textual substitution. Journal of the ACM. 29:4. (928-951). Online publication date: 1-Oct-1982.

    https://doi.org/10.1145/322344.322346

  • Rodeh M. (1982). A fast test for unique decipherability based on suffix trees (Corresp.). IEEE Transactions on Information Theory. 10.1109/TIT.1982.1056535. 28:4. (648-651). Online publication date: 1-Jul-1982.

    http://ieeexplore.ieee.org/document/1056535/

  • Rodeh M, Pratt V and Even S. (1981). Linear Algorithm for Data Compression via String Matching. Journal of the ACM. 28:1. (16-24). Online publication date: 1-Jan-1981.

    https://doi.org/10.1145/322234.322237

  • Tanimoto S. (1981). A method for detecting structure in polygons. Pattern Recognition. 10.1016/0031-3203(81)90001-7. 13:6. (389-394). Online publication date: 1-Jan-1981.

    http://linkinghub.elsevier.com/retrieve/pii/0031320381900017

  • Barth G. (1981). An alternative for the implementation of the Knuth-Morris-Pratt algorithm. Information Processing Letters. 10.1016/0020-0190(81)90042-9. 13:4-5. (134-137). Online publication date: 1-Jan-1981.

    http://linkinghub.elsevier.com/retrieve/pii/0020019081900429

  • Majster M and Reiser A. (1980). Efficient On-Line Construction and Correction of Position Trees. SIAM Journal on Computing. 9:4. (785-807). Online publication date: 1-Nov-1980.

    https://doi.org/10.1137/0209061

  • Galil Z. (1979). On improving the worst case running time of the Boyer-Moore string matching algorithm. Communications of the ACM. 22:9. (505-508). Online publication date: 1-Sep-1979.

    https://doi.org/10.1145/359146.359148

  • Kambayashi Y, Nakatsu N and Yajima S. Hierarchical string pattern matching using dynamic pattern matching machines COMPSAC 79. Computer Software and The IEEE Computer Society's Third International Applications Conference, 1979.. 10.1109/CMPSAC.1979.762607. . (813-818).

    http://ieeexplore.ieee.org/document/762607/

  • Commentz-Walter B. (1979). A string matching algorithm fast on the average. Automata, Languages and Programming. 10.1007/3-540-09510-1_10. (118-132).

    http://link.springer.com/10.1007/3-540-09510-1_10

  • Majster M and Reiser A. (1979). An efficient on-line position tree construction algorithm. Theoretical Computer Science 4th GI Conference. 10.1007/3-540-09118-1_21. (190-198).

    http://link.springer.com/10.1007/3-540-09118-1_21

  • Baker T. (1978). A Technique for Extending Rapid Exact-Match String Matching to Arrays of More than One Dimension. SIAM Journal on Computing. 7:4. (533-541). Online publication date: 1-Nov-1978.

    https://doi.org/10.1137/0207043

  • Tarjan R. (1978). Complexity of Combinatorial Algorithms. SIAM Review. 20:3. (457-491). Online publication date: 1-Jul-1978.

    https://doi.org/10.1137/1020067

  • Schek H. (1978). The reference string indexing method. Information Systems Methodology. 10.1007/3-540-08934-9_92. (432-459).

    http://link.springer.com/10.1007/3-540-08934-9_92

  • Galil Z. (1978). On improving the worst case running time of the Boyer-Moore string matching algorithm. Automata, Languages and Programming. 10.1007/3-540-08860-1_18. (241-250).

    http://link.springer.com/10.1007/3-540-08860-1_18

  • Kearsley G and Hunka S. (1977). Copyright and CAI. ACM SIGCUE Outlook. 11:2. (3-12). Online publication date: 1-Apr-1977.

    https://doi.org/10.1145/1216485.1216486

  • Katz S and Manna Z. (1976). Logical analysis of programs. Communications of the ACM. 19:4. (188-206). Online publication date: 1-Apr-1976.

    https://doi.org/10.1145/360032.360048

  • Jenks R. (1970). META/LISP. ACM SIGSAM Bulletin:16. (10-18). Online publication date: 1-Oct-1970.

    https://doi.org/10.1145/1093415.1093417