Skip header Section
Skip Bibliometrics Section
Algorithms on strings, trees, and sequences: computer science and computational biologyJuly 1997
- Author:
- Dan Gusfield
Abstract
No abstract available.
Cited By
Münch M, Röder M and Schleif F Unlocking the Potential of Non-PSD Kernel Matrices: A Polar Decomposition-based Transformation for Improved Prediction Models Proceedings of the 32nd ACM International Conference on Information and Knowledge Management, (1867-1876)- Gavazzo F and Di Florio C (2023). Elements of Quantitative Rewriting, Proceedings of the ACM on Programming Languages, 7:POPL, (1832-1863), Online publication date: 9-Jan-2023.
- Kärkkäinen J, Piątkowski M and Puglisi S (2023). String inference from longest-common-prefix array, Theoretical Computer Science, 942:C, (180-199), Online publication date: 9-Jan-2023.
- Russo L, Costa D, Henriques R, Bannai H and Francisco A (2022). Order-preserving pattern matching indeterminate strings, Information and Computation, 289:PA, Online publication date: 1-Nov-2022.
- Kwon S, Jung W and Shim K (2022). Cardinality estimation of approximate substring queries using deep learning, Proceedings of the VLDB Endowment, 15:11, (3145-3157), Online publication date: 1-Jul-2022.
- Bringmann K, Cassis A, Fischer N and Nakos V Almost-optimal sublinear-time edit distance in the low distance regime Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing, (1102-1115)
- Tsuruta K, Köppl D, Kanda S, Nakashima Y, Inenaga S, Bannai H and Takeda M (2022). c-trie++, Information and Computation, 285:PB, Online publication date: 1-May-2022.
- 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.
- Kirschenbaum A (2022). Unsupervised induction of inflectional families, Computer Speech and Language, 73:C, Online publication date: 1-May-2022.
- Navarro G (2021). Indexing Highly Repetitive String Collections, Part II, ACM Computing Surveys, 54:2, (1-32), Online publication date: 31-Mar-2022.
- Kabra A, Bhatia M, Singla Y, Jessy Li J and Ratn Shah R Evaluation Toolkit For Robustness Testing Of Automatic Essay Scoring Systems Proceedings of the 5th Joint International Conference on Data Science & Management of Data (9th ACM IKDD CODS and 27th COMAD), (90-99)
- Lipták Z, Puglisi S and Rossi M (2020). Pattern Discovery in Colored Strings, ACM Journal of Experimental Algorithmics, 26, (1-26), Online publication date: 31-Dec-2022.
- 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.
- Wang D, Kula R, Ishio T and Matsumoto K (2021). Automatic patch linkage detection in code review using textual content and file location features, Information and Software Technology, 139:C, Online publication date: 1-Nov-2021.
- Dubuisson Duplessis G, Langlet C, Clavel C and Landragin F (2021). Towards alignment strategies in human-agent interactions based on measures of lexical repetitions, Language Resources and Evaluation, 55:2, (353-388), Online publication date: 1-Jun-2021.
- Berger T and Raschke M Repetition effects in task-driven eye movement analyses after longer time-spans ACM Symposium on Eye Tracking Research and Applications, (1-6)
- Chiesa M, Sedar R, Antichi G, Borokhovich M, Kamisiński A, Nikolaidis G and Schmid S (2021). Fast ReRoute on Programmable Switches, IEEE/ACM Transactions on Networking, 29:2, (637-650), Online publication date: 1-Apr-2021.
- Kim D, Hahn A, Hanson N, Konwar K and Hallam S FAST: Fast annotation with synchronized threads 2016 IEEE Conference on Computational Intelligence in Bioinformatics and Computational Biology (CIBCB), (1-8)
- Yan L and Shen H (2021). Utilizing Game Theory to Optimize In-motion Wireless Charging Service Efficiency for Electric Vehicles, ACM Transactions on Cyber-Physical Systems, 5:2, (1-26), Online publication date: 28-Jan-2021.
- Chakraborty D, Das D and Krauthgamer R Approximating the median under the Ulam metric Proceedings of the Thirty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, (761-775)
- Allen D, Thankachan S and Xu B (2021). An Ultra-Fast and Parallelizable Algorithm for Finding
$k$ - Nienkötter A and Jiang X (2020). A lower bound for generalized median based consensus learning using kernel-induced distance functions, Pattern Recognition Letters, 140:C, (339-347), Online publication date: 1-Dec-2020.
- Amir A, Charalampopoulos P, Pissis S and Radoszewski J (2020). Dynamic and Internal Longest Common Substring, Algorithmica, 82:12, (3707-3743), Online publication date: 1-Dec-2020.
- Bringmann K, Gawrychowski P, Mozes S and Weimann O (2020). Tree Edit Distance Cannot be Computed in Strongly Subcubic Time (Unless APSP Can), ACM Transactions on Algorithms, 16:4, (1-22), Online publication date: 31-Oct-2020.
- Belazzougui D, Cunial F, Kärkkäinen J and Mäkinen V (2020). Linear-time String Indexing and Analysis in Small Space, ACM Transactions on Algorithms, 16:2, (1-54), Online publication date: 27-Apr-2020.
- 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.
- Williams L and Mumey B Extending Maximal Perfect Haplotype Blocks to the Realm of Pangenomics Algorithms for Computational Biology, (41-48)
- Tchendji V, Ngomade A, Zeutouo J and Myoupo J (2020). Efficient CGM-based parallel algorithms for the longest common subsequence problem with multiple substring-exclusion constraints, Parallel Computing, 91:C, Online publication date: 1-Mar-2020.
- Fernau H, Manea F, Mercaş R and Schmid M (2020). Pattern Matching with Variables, ACM Transactions on Computation Theory, 12:1, (1-37), Online publication date: 25-Feb-2020.
- Javanmard M, Ahmad Z, Kong M, Pouchet L, Chowdhury R and Harrison R Deriving parametric multi-way recursive divide-and-conquer dynamic programming algorithms using polyhedral compilers Proceedings of the 18th ACM/IEEE International Symposium on Code Generation and Optimization, (317-329)
- Leon-Alcaide P, Rodriguez-Benitez L, Castillo-Herrera E, Moreno-Garcia J and Jimenez-Linares L (2020). An evolutionary approach for efficient prototyping of large time series datasets, Information Sciences: an International Journal, 511:C, (74-93), Online publication date: 1-Feb-2020.
- Crochemore M, Héliou A, Kucherov G, Mouchard L, Pissis S and Ramusat Y (2020). Absent words in a sliding window with applications, Information and Computation, 270:C, Online publication date: 1-Feb-2020.
- Cresci S, Di Pietro R, Petrocchi M, Spognardi A and Tesconi M (2020). Emergent properties, models, and laws of behavioral similarities within groups of twitter users, Computer Communications, 150:C, (47-61), Online publication date: 15-Jan-2020.
- Ganguly A, Shah R and Thankachan S (2019). Succinct Non-overlapping Indexing, Algorithmica, 82:1, (107-117), Online publication date: 1-Jan-2020.
- Weber R, Eyal M, Detlefsen N, Shriki O and Freifeld O Diffeomorphic temporal alignment nets Proceedings of the 33rd International Conference on Neural Information Processing Systems, (6574-6585)
- Giancarlo R, Rombo S and Utro F (2019). DNA combinatorial messages and Epigenomics, Theoretical Computer Science, 792:C, (117-130), Online publication date: 5-Nov-2019.
- Bonizzoni P, Ciccolella S, Vedova G and Soto M (2019). Does Relaxing the Infinite Sites Assumption Give Better Tumor Phylogenies? An ILP-Based Comparative Approach, IEEE/ACM Transactions on Computational Biology and Bioinformatics, 16:5, (1410-1423), Online publication date: 1-Sep-2019.
- 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.
- 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.
- Bossek J, Kerschke P, Neumann A, Wagner M, Neumann F and Trautmann H Evolving diverse TSP instances by means of novel and creative mutation operators Proceedings of the 15th ACM/SIGEVO Conference on Foundations of Genetic Algorithms, (58-71)
- Markin A and Eulenstein O (2019). Computing Manhattan Path-Difference Median Trees, IEEE/ACM Transactions on Computational Biology and Bioinformatics, 16:4, (1063-1076), Online publication date: 1-Jul-2019.
- Zhang Y, Fu J, Yang C and Xiao C (2019). A local expansion propagation algorithm for social link identification, Knowledge and Information Systems, 60:1, (545-568), Online publication date: 1-Jul-2019.
- Cresci S, Petrocchi M, Spognardi A and Tognazzi S Better Safe Than Sorry Proceedings of the 10th ACM Conference on Web Science, (47-56)
- Li F, Cabrera C and Clarke S A WS-Agreement Based SLA Ontology for IoT Services Internet of Things – ICIOT 2019, (58-72)
- Dudek B and Gawrychowski P Computing quartet distance is equivalent to counting 4-cycles Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, (733-743)
- Boroujeni M, Ghodsi M, Hajiaghayi M and Seddighin S 1+ε approximation of tree edit distance in quadratic time Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, (709-720)
- Kempa D and Kociumaka T String synchronizing sets: sublinear-time BWT construction and optimal LCE data structure Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, (756-767)
- 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.
- Marteau P (2018). Sequence Covering for Efficient Host-Based Intrusion Detection, IEEE Transactions on Information Forensics and Security, 14:4, (994-1006), Online publication date: 1-Apr-2019.
- Charalampopoulos P, Crochemore M, Iliopoulos C, Kociumaka T, Pissis S, Radoszewski J, Rytter W and Waleń T (2019). Efficient enumeration of non-equivalent squares in partial words with few holes, Journal of Combinatorial Optimization, 37:2, (501-522), Online publication date: 1-Feb-2019.
- Hajiaghayi M, Seddighin S and Sun X Massively parallel approximation algorithms for edit distance and longest common subsequence Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, (1654-1672)
- Kuszmaul W Efficiently approximating edit distance between pseudorandom strings Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, (1165-1180)
- Marle F, Jaber H, Pointurier C and Botev J (2019). Organizing Project Actors for Collective Decision-Making about Interdependent Risks, Complexity, 2019, Online publication date: 1-Jan-2019.
- Makarenko A (2019). Metrization of the T-Alphabet, Automation and Remote Control, 80:1, (138-149), Online publication date: 1-Jan-2019.
- Rizzi R, Cairo M, Makinen V, Tomescu A and Valenzuela D (2019). Hardness of Covering Alignment, IEEE/ACM Transactions on Computational Biology and Bioinformatics, 16:1, (23-30), Online publication date: 1-Jan-2019.
- Brill M, Fluschnik T, Froese V, Jain B, Niedermeier R and Schultz D (2019). Exact mean computation in dynamic time warping spaces, Data Mining and Knowledge Discovery, 33:1, (252-291), Online publication date: 1-Jan-2019.
- Turakhia Y, Bejerano G and Dally W (2018). Darwin, ACM SIGPLAN Notices, 53:2, (199-213), Online publication date: 30-Nov-2018.
- 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.
- Halioui A, Valtchev P and Diallo A (2018). Bioinformatic Workflow Extraction from Scientific Texts based on Word Sense Disambiguation, IEEE/ACM Transactions on Computational Biology and Bioinformatics, 15:6, (1979-1990), Online publication date: 1-Nov-2018.
- Wickland D, Calvert D and Harley J Evaluating symbolic representations in melodic similarity Proceedings of the 5th International Conference on Digital Libraries for Musicology, (62-68)
- Nair N, Thomas C and Jayagopi D Human Activity Recognition Using Temporal Convolutional Network Proceedings of the 5th International Workshop on Sensor-based Activity Recognition and Interaction, (1-8)
- Barbosa J, Andrade R, Filho J, Bezerra C, Barreto I and Capilla R Cloning in Customization Classes Proceedings of the VII Brazilian Symposium on Software Components, Architectures, and Reuse, (43-52)
- Koumarelas I, Kroschk A, Mosley C and Naumann F (2018). Experience, Journal of Data and Information Quality, 10:2, (1-16), Online publication date: 13-Sep-2018.
- Harris M, Levene M, Zhang D and Levene D (2018). Finding Parallel Passages in Cultural Heritage Archives, Journal on Computing and Cultural Heritage , 11:3, (1-24), Online publication date: 5-Sep-2018.
- Dal Palù A, Dovier A, Formisano A and Pontelli E Exploring life Declarative Logic Programming, (359-412)
- Wang B, Yang X and Wang G (2018). ACRES, World Wide Web, 21:5, (1349-1376), Online publication date: 1-Sep-2018.
- Allen D, Thankachan S and Xu B A Practical and Efficient Algorithm for the k-mismatch Shortest Unique Substring Finding Problem Proceedings of the 2018 ACM International Conference on Bioinformatics, Computational Biology, and Health Informatics, (428-437)
- Abboud A, Backurs A, Hansen T, Vassilevska Williams V and Zamir O (2018). Subtree Isomorphism Revisited, ACM Transactions on Algorithms, 14:3, (1-23), Online publication date: 16-Jul-2018.
- Lohrey M, Maneth S and Reh C (2018). Constant-Time Tree Traversal and Subtree Equality Check for Grammar-Compressed Trees, Algorithmica, 80:7, (2082-2105), Online publication date: 1-Jul-2018.
- Hujdurović A, Husić E, Milanić M, Rizzi R and Tomescu A (2018). Perfect Phylogenies via Branchings in Acyclic Digraphs and a Generalization of Dilworth’s Theorem, ACM Transactions on Algorithms, 14:2, (1-26), Online publication date: 4-Jun-2018.
- Issa M, Hassanien A, Oliva D, Helmi A, Ziedan I and Alzohairy A (2018). ASCA-PSO, Expert Systems with Applications: An International Journal, 99:C, (56-70), Online publication date: 1-Jun-2018.
- Schramm C, Wang Y and Bry F Codekōan Proceedings of the 5th International Workshop on Crowd Sourcing in Software Engineering, (1-8)
- Cafaro L, Francese R, Palumbo C, Risi M and Tortora G An agile process supporting software reuse Proceedings of the 33rd Annual ACM Symposium on Applied Computing, (1544-1551)
- Turakhia Y, Bejerano G and Dally W Darwin Proceedings of the Twenty-Third International Conference on Architectural Support for Programming Languages and Operating Systems, (199-213)
- Ritz A Programming the Central Dogma Proceedings of the 49th ACM Technical Symposium on Computer Science Education, (239-244)
- Schultz D and Jain B (2018). Nonsmooth analysis and subgradient methods for averaging in dynamic time warping spaces, Pattern Recognition, 74:C, (340-358), Online publication date: 1-Feb-2018.
- Rubinchik M and Shur A (2018). EERTREE, European Journal of Combinatorics, 68:C, (249-265), Online publication date: 1-Feb-2018.
- Bringmann K, Gawrychowski P, Mozes S and Weimann O Tree edit distance cannot be computed in strongly subcubic time (unless APSP can) Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, (1190-1206)
- Gawrychowski P, I T, Inenaga S, Köppl D and Manea F (2018). Tighter Bounds and Optimal Algorithms for All Maximal ź-gapped Repeats and Palindromes, Theory of Computing Systems, 62:1, (162-191), Online publication date: 1-Jan-2018.
- Gabow H (2017). A Data Structure for Nearest Common Ancestors with Linking, ACM Transactions on Algorithms, 13:4, (1-28), Online publication date: 21-Dec-2017.
- Hirvola T and Tarhio J (2017). Bit-Parallel Approximate Matching of Circular Strings with k Mismatches, ACM Journal of Experimental Algorithmics, 22, (1-12), Online publication date: 15-Dec-2017.
- Manca V (2017). The principles of informational genomics, Theoretical Computer Science, 701:C, (190-202), Online publication date: 21-Nov-2017.
- 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.
- Velloso R and Dorneles C Extracting Records from the Web Using a Signal Processing Approach Proceedings of the 2017 ACM on Conference on Information and Knowledge Management, (197-206)
- Lizárraga E, Blesa M, Blum C and Raidl G (2017). Large neighborhood search for the most strings with few bad columns problem, Soft Computing - A Fusion of Foundations, Methodologies and Applications, 21:17, (4901-4915), Online publication date: 1-Sep-2017.
- Adjeroh D, Allaga M, Tan J, Lin J, Jiang Y, Abbasi A and Zhou X String-Based Models for Predicting RNA-Protein Interaction Proceedings of the 8th ACM International Conference on Bioinformatics, Computational Biology,and Health Informatics, (661-666)
- Bonizzoni P, Ciccolella S, Della Vedova G and Soto M Beyond Perfect Phylogeny Proceedings of the 8th ACM International Conference on Bioinformatics, Computational Biology,and Health Informatics, (1-10)
- Chanda A, Ahmed C, Samiullah M and Leung C (2017). A new framework for mining weighted periodic patterns in time series databases, Expert Systems with Applications: An International Journal, 79:C, (207-224), Online publication date: 15-Aug-2017.
- Barceló P and Muñoz P (2017). Graph Logics with Rational Relations, ACM Transactions on Computational Logic, 18:2, (1-41), Online publication date: 23-Jun-2017.
- Alevizos E, Artikis A and Paliouras G Event Forecasting with Pattern Markov Chains Proceedings of the 11th ACM International Conference on Distributed and Event-based Systems, (146-157)
- Munro J, Navarro G, Nielsen J, Shah R and Thankachan S (2017). Top-k Term-Proximity in Succinct Space, Algorithmica, 78:2, (379-393), Online publication date: 1-Jun-2017.
- Wressnegger C, Freeman K, Yamaguchi F and Rieck K Automatically Inferring Malware Signatures for Anti-Virus Assisted Attacks Proceedings of the 2017 ACM on Asia Conference on Computer and Communications Security, (587-598)
- Cattaneo G, Petrillo U, Giancarlo R and Roscigno G (2017). An effective extension of the applicability of alignment-free biological sequence comparison algorithms with Hadoop, The Journal of Supercomputing, 73:4, (1467-1483), Online publication date: 1-Apr-2017.
- Yu M, Wang J, Li G, Zhang Y, Deng D and Feng J (2017). A unified framework for string similarity search with edit-distance constraint, The VLDB Journal — The International Journal on Very Large Data Bases, 26:2, (249-274), Online publication date: 1-Apr-2017.
- Ibaez R, Soria l, Teyseyre A, Rodrguez G and Campo M (2017). Approximate string matching, Pattern Recognition, 62:C, (73-86), Online publication date: 1-Feb-2017.
- Caminiti S, Finocchi I, Fusco E and Silvestri F (2017). Resilient Dynamic Programming, Algorithmica, 77:2, (389-425), Online publication date: 1-Feb-2017.
- Ganguly A, Shah R and Thankachan S pBWT Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, (397-407)
- Bonizzoni P, Carrieri A, Della Vedova G, Rizzi R and Trucco G (2017). A colored graph approach to perfect phylogeny with persistent characters, Theoretical Computer Science, 658:PA, (60-73), Online publication date: 7-Jan-2017.
- Anselmo M, Giammarresi D and Madonia M (2017). Non-expandable non-overlapping sets of pictures, Theoretical Computer Science, 657:PB, (127-136), Online publication date: 2-Jan-2017.
- 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.
- Marcus S and Sokol D (2017). 2D Lyndon Words and Applications, Algorithmica, 77:1, (116-133), Online publication date: 1-Jan-2017.
- Kim Y, Na J, Park H and Sim J (2016). A space-efficient alphabet-independent Four-Russians' lookup table and a multithreaded Four-Russians' edit distance algorithm, Theoretical Computer Science, 656:PB, (173-179), Online publication date: 20-Dec-2016.
- Rytter W (2016). Two fast constructions of compact representations of binary words with given set of periods, Theoretical Computer Science, 656:PB, (180-187), Online publication date: 20-Dec-2016.
- Badkobeh G, Crochemore M, Mohamed M and Toopsuwan C (2016). Efficient computation of maximal anti-exponent in palindrome-free strings, Theoretical Computer Science, 656:PB, (241-248), Online publication date: 20-Dec-2016.
- 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)
- Chowdhury R, Ganapathi P, Tithi J, Bachmeier C, Kuszmaul B, Leiserson C, Solar-Lezama A and Tang Y (2016). AUTOGEN, ACM SIGPLAN Notices, 51:8, (1-12), Online publication date: 9-Nov-2016.
- 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.
- Wang S, Ewert S, Dixon S, Siying Wang , Ewert S and Dixon S (2016). Robust and Efficient Joint Alignment of Multiple Musical Performances, IEEE/ACM Transactions on Audio, Speech and Language Processing, 24:11, (2132-2145), Online publication date: 1-Nov-2016.
- Becerra D, Mendivelso J and Pinzón Y (2016). A multiobjective optimization algorithm for the weighted LCS, Discrete Applied Mathematics, 212:C, (37-47), Online publication date: 30-Oct-2016.
- Cazaux B and Rivals E (2016). The power of greedy algorithms for approximating Max-ATSP, Cyclic Cover, and superstrings, Discrete Applied Mathematics, 212:C, (48-60), Online publication date: 30-Oct-2016.
- 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.
- Markin A and Eulenstein O Manhattan Path-Difference Median Trees Proceedings of the 7th ACM International Conference on Bioinformatics, Computational Biology, and Health Informatics, (404-413)
- Ferragina P and Venturini R (2016). Compressed Cache-Oblivious String B-Tree, ACM Transactions on Algorithms, 12:4, (1-17), Online publication date: 2-Sep-2016.
- Jansson J, Shen C and Sung W (2016). Improved Algorithms for Constructing Consensus Trees, Journal of the ACM, 63:3, (1-24), Online publication date: 1-Sep-2016.
- Siyari P, Dilkina B and Dovrolis C Lexis Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, (1185-1194)
- Wang J (2016). Extracting significant pattern histories from timestamped texts using MapReduce, The Journal of Supercomputing, 72:8, (3236-3260), Online publication date: 1-Aug-2016.
- 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.
- Bille P, Gawrychowski P, Gørtz I, Landau G and Weimann O (2016). Longest common extensions in trees, Theoretical Computer Science, 638:C, (98-107), Online publication date: 25-Jul-2016.
- Na J, Kim H, Park H, Lecroq T, Lonard M, Mouchard L and Park K (2016). FM-index of alignment, Theoretical Computer Science, 638:C, (159-170), Online publication date: 25-Jul-2016.
- Munro J Succinct Data Structures ... Potential for Symbolic Computation? Proceedings of the ACM on International Symposium on Symbolic and Algebraic Computation, (5-8)
- Kosolobov D (2016). Finding the leftmost critical factorization on unordered alphabet, Theoretical Computer Science, 636:C, (56-65), Online publication date: 11-Jul-2016.
- Phuong T, Yang G, Susilo W and Liang K Edit Distance Based Encryption and Its Application Proceedings, Part II, of the 21st Australasian Conference on Information Security and Privacy - Volume 9723, (103-119)
- Kang Y and Zadorozhny V (2016). Process monitoring using maximum sequence divergence, Knowledge and Information Systems, 48:1, (81-109), Online publication date: 1-Jul-2016.
- Srivastava A, Nayak A and Kapoor K (2016). On del-robust primitive words, Discrete Applied Mathematics, 206:C, (115-121), Online publication date: 19-Jun-2016.
- Francese R, Risi M, Scanniello G and Tortora G LifeBook Proceedings of the International Working Conference on Advanced Visual Interfaces, (184-191)
- Nielandt J, Bronselaer A and de Tré G (2016). Predicate enrichment of aligned XPaths for wrapper induction, Expert Systems with Applications: An International Journal, 51:C, (259-275), Online publication date: 1-Jun-2016.
- Sandes E, Boukerche A and Melo A (2016). Parallel Optimal Pairwise Biological Sequence Comparison, ACM Computing Surveys, 48:4, (1-36), Online publication date: 2-May-2016.
- Badkobeh G and Crochemore M (2016). Computing maximal-exponent factors in an overlap-free word, Journal of Computer and System Sciences, 82:3, (477-487), Online publication date: 1-May-2016.
- Zhu D, Wu Y and Wang X An Efficient Dynamic Programming Algorithm for STR-IC-STR-IC-LCS Problem Proceedings, Part II, of the 20th Pacific-Asia Conference on Advances in Knowledge Discovery and Data Mining - Volume 9652, (466-477)
- 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.
- Cazaux B and Rivals E (2016). A linear time algorithm for Shortest Cyclic Cover of Strings, Journal of Discrete Algorithms, 37:C, (56-67), Online publication date: 1-Mar-2016.
- Tustumi W, Gog S, Telles G and Louza F (2016). An improved algorithm for the all-pairs suffixprefix problem, Journal of Discrete Algorithms, 37:C, (34-43), Online publication date: 1-Mar-2016.
- Chowdhury R, Ganapathi P, Tithi J, Bachmeier C, Kuszmaul B, Leiserson C, Solar-Lezama A and Tang Y AUTOGEN Proceedings of the 21st ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, (1-12)
- Nakamura A, Takigawa I, Tosaka H, Kudo M and Mamitsuka H (2016). Mining approximate patterns with frequent locally optimal occurrences, Discrete Applied Mathematics, 200:C, (123-152), Online publication date: 19-Feb-2016.
- Zhou F and Torre F (2016). Generalized Canonical Time Warping, IEEE Transactions on Pattern Analysis and Machine Intelligence, 38:2, (279-294), Online publication date: 1-Feb-2016.
- Zhang W, Cheng A and Subhlok J (2016). DwarfCode: A Performance Prediction Tool for Parallel Applications, IEEE Transactions on Computers, 65:2, (495-507), Online publication date: 1-Feb-2016.
- Biesinger B, Hu B and Raidl G (2016). Models and algorithms for competitive facility location problems with different customer behavior, Annals of Mathematics and Artificial Intelligence, 76:1-2, (93-119), Online publication date: 1-Feb-2016.
- Devroey X, Perrouin G, Legay A, Schobbens P and Heymans P Search-based Similarity-driven Behavioural SPL Testing Proceedings of the 10th International Workshop on Variability Modelling of Software-Intensive Systems, (89-96)
- Abboud A, Backurs A, Hansen T, Williams V and Zamir O Subtree isomorphism revisited Proceedings of the twenty-seventh annual ACM-SIAM symposium on Discrete algorithms, (1256-1271)
- Beal R and Adjeroh D (2016). Compressed parameterized pattern matching, Theoretical Computer Science, 609:P1, (129-142), Online publication date: 4-Jan-2016.
- Tang Y, You R, Kan H, Tithi J, Ganapathi P and Chowdhury R (2015). Cache-oblivious wavefront: improving parallelism of recursive dynamic programming algorithms without losing cache-efficiency, ACM SIGPLAN Notices, 50:8, (205-214), Online publication date: 18-Dec-2015.
- Aghabozorgi S, Seyed Shirkhorshidi A and Ying Wah T (2015). Time-series clustering - A decade review, Information Systems, 53:C, (16-38), Online publication date: 1-Oct-2015.
- Gusfield D Persistent phylogeny Proceedings of the 6th ACM Conference on Bioinformatics, Computational Biology and Health Informatics, (443-451)
- Chernyak E Some thoughts on using annotated suffix trees for natural language processing Proceedings of the 2nd International Conference on Interactions between Data Mining and Natural Language Processing - Volume 1410, (5-18)
- Nguyen T, Schmidt B, Zheng Z and Kwoh C (2015). Efficient and Accurate OTU Clustering with GPU-Based Sequence Alignment and Dynamic Dendrogram Cutting, IEEE/ACM Transactions on Computational Biology and Bioinformatics, 12:5, (1060-1073), Online publication date: 1-Sep-2015.
- Ehlers T, Manea F, Mercaş R and Nowotka D (2015). k-Abelian pattern matching, Journal of Discrete Algorithms, 34:C, (37-48), Online publication date: 1-Sep-2015.
- Dumitran M, Manea F and Nowotka D On Prefix/Suffix-Square Free Words Proceedings of the 22nd International Symposium on String Processing and Information Retrieval - Volume 9309, (54-66)
- Manzini G Longest Common Prefix with Mismatches Proceedings of the 22nd International Symposium on String Processing and Information Retrieval - Volume 9309, (299-310)
- Tanimura Y, Fujishige Y, I T, Inenaga S, Bannai H and Takeda M A Faster Algorithm for Computing Maximal $$\alpha $$-gapped Repeats in a String Proceedings of the 22nd International Symposium on String Processing and Information Retrieval - Volume 9309, (124-136)
- Allali J, Chauve C and Bourgeade L Chaining Fragments in Sequences Proceedings of the 22nd International Symposium on String Processing and Information Retrieval - Volume 9309, (116-123)
- 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.
- Kang B, Höllerer T and O'Donovan J The Full Story Proceedings of the 2015 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining 2015, (1192-1199)
- You S and Pu Y (2015). Using Paired Distances of Signal Peaks in Stereo Channels as Fingerprints for Copy Identification, ACM Transactions on Multimedia Computing, Communications, and Applications, 12:1, (1-22), Online publication date: 24-Aug-2015.
- Beal R and Adjeroh D (2015). Efficient pattern matching for RNA secondary structures, Theoretical Computer Science, 592:C, (59-71), Online publication date: 9-Aug-2015.
- Xue Y, Wang J, Liu Y, Xiao H, Sun J and Chandramohan M Detection and classification of malicious JavaScript via attack behavior modelling Proceedings of the 2015 International Symposium on Software Testing and Analysis, (48-59)
- Paskov H, Mitchell J and Hastie T Fast algorithms for learning with long N-grams via suffix tree based matrix multiplication Proceedings of the Thirty-First Conference on Uncertainty in Artificial Intelligence, (672-681)
- Jiang B and Chan W (2015). Input-based adaptive randomized test case prioritization, Journal of Systems and Software, 105:C, (91-106), Online publication date: 1-Jul-2015.
- Hilbrich M and Müller-Pfefferkorn R Cross-Correlation as Tool to Determine the Similarity of Series of Measurements for Big-Data Analysis Tasks Revised Selected Papers of the Second International Conference on Cloud Computing and Big Data - Volume 9106, (263-282)
- Flouri T, Giaquinta E, Kobert K and Ukkonen E (2015). Longest common substrings with k mismatches, Information Processing Letters, 115:6, (643-647), Online publication date: 1-Jun-2015.
- Grabowski S (2015). A note on the longest common substring with k-mismatches problem, Information Processing Letters, 115:6, (640-642), Online publication date: 1-Jun-2015.
- Paul M, White R and Horvitz E Diagnoses, Decisions, and Outcomes Proceedings of the 24th International Conference on World Wide Web, (831-841)
- Roychoudhury S, Kulkarni V and Bellarykar N Mining enterprise models for knowledgeable decision making Proceedings of the Fourth International Workshop on Realizing Artificial Intelligence Synergies in Software Engineering, (1-6)
- Daily J, Kalyanaraman A, Krishnamoorthy S and Vishnu A (2015). A work stealing based approach for enabling scalable optimal sequence homology detection, Journal of Parallel and Distributed Computing, 79:C, (132-142), Online publication date: 1-May-2015.
- Starikovskaya T and Vildhøj H (2015). A suffix tree or not a suffix tree?, Journal of Discrete Algorithms, 32:C, (14-23), Online publication date: 1-May-2015.
- Tiskin A (2015). Fast Distance Multiplication of Unit-Monge Matrices, Algorithmica, 71:4, (859-888), Online publication date: 1-Apr-2015.
- Bachmaier C, Brandenburg F, Gleiíßner A and Hofmeier A (2015). On the hardness of maximum rank aggregation problems, Journal of Discrete Algorithms, 31:C, (2-13), Online publication date: 1-Mar-2015.
- 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.
- Chernyak E An Approach to the Problem of Annotation of Research Publications Proceedings of the Eighth ACM International Conference on Web Search and Data Mining, (429-434)
- Laftchiev E, Lagoa C and Brennan S (2015). Vehicle Localization Using In-Vehicle Pitch Data and Dynamical Models, IEEE Transactions on Intelligent Transportation Systems, 16:1, (206-220), Online publication date: 1-Feb-2015.
- Wu Z, Jiang X, Zheng N, Liu Y and Cheng D (2015). Exact solution to median surface problem using 3D graph search and application to parameter space exploration, Pattern Recognition, 48:2, (380-390), Online publication date: 1-Feb-2015.
- Tang Y, You R, Kan H, Tithi J, Ganapathi P and Chowdhury R Cache-oblivious wavefront: improving parallelism of recursive dynamic programming algorithms without losing cache-efficiency Proceedings of the 20th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, (205-214)
- İleri A, Külekci M and Xu B (2015). A simple yet time-optimal and linear-space algorithm for shortest unique substring queries, Theoretical Computer Science, 562:C, (621-633), Online publication date: 11-Jan-2015.
- Amir A, Apostolico A, Landau G, Porat E and Sar Shalom O (2015). A PTAS for the Square Tiling Problem, Theoretical Computer Science, 562:C, (33-45), Online publication date: 11-Jan-2015.
- Kociumaka T, Radoszewski J, Rytter W and Waleń T Internal pattern matching queries in a text and applications Proceedings of the twenty-sixth annual ACM-SIAM symposium on Discrete algorithms, (532-551)
- Abboud A, Williams R and Yu H More applications of the polynomial method to algorithm design Proceedings of the twenty-sixth annual ACM-SIAM symposium on Discrete algorithms, (218-230)
- Chłopkowski M and Walkowiak R (2015). A general purpose lossless data compression method for GPU, Journal of Parallel and Distributed Computing, 75:C, (40-52), Online publication date: 1-Jan-2015.
- Smetanin Y and Ulyanov M (2015). Reconstruction of a Word from a Finite Set of its Subwords Under the Unit Shift Hypothesis. II. Reconstruction with Forbidden Words, Cybernetics and Systems Analysis, 51:1, (157-164), Online publication date: 1-Jan-2015.
- Fazekas S, Manea F, Mercaş R and Shikishima-Tsuji K (2014). The pseudopalindromic completion of regular languages, Information and Computation, 239:C, (222-236), Online publication date: 1-Dec-2014.
- Mohanty P and Tragoudas S (2014). Scalable Offline Searches in DNA Sequences, ACM Journal on Emerging Technologies in Computing Systems, 11:2, (1-25), Online publication date: 18-Nov-2014.
- Shun J Fast parallel computation of longest common prefixes Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis, (387-398)
- Dragut E, Dasgupta B, Beirne B, Neyestani A, Atassi B, Yu C and Meng W (2014). Merging Query Results From Local Search Engines for Georeferenced Objects, ACM Transactions on the Web, 8:4, (1-29), Online publication date: 6-Nov-2014.
- Zhu X, Schleif F and Hammer B (2014). Adaptive conformal semi-supervised vector quantization for dissimilarity data, Pattern Recognition Letters, 49:C, (138-145), Online publication date: 1-Nov-2014.
- Loptev A, Selugina A and Starikovskaya T Simple and Efficient String Algorithms for Query Suggestion Metrics Computation Proceedings of the 21st International Symposium on String Processing and Information Retrieval - Volume 8799, (268-278)
- Kim H and Han Y Online Multiple Palindrome Pattern Matching Proceedings of the 21st International Symposium on String Processing and Information Retrieval - Volume 8799, (173-178)
- Ohlebusch E and Beller T Alphabet-Independent Algorithms for Finding Context-Sensitive Repeats in Linear Time Proceedings of the 21st International Symposium on String Processing and Information Retrieval - Volume 8799, (117-128)
- 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.
- Chowdhury S, Hasan M, Iqbal S and Rahman M (2014). Computing a Longest Common Palindromic Subsequence, Fundamenta Informaticae, 129:4, (329-340), Online publication date: 1-Oct-2014.
- 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.
- Lettner F, Grossauer C and Holzmann C Mobile interaction analysis Proceedings of the 16th international conference on Human-computer interaction with mobile devices & services, (359-368)
- Azim M, Iliopoulos C, Rahman M and Samiruzzaman M A fast and lightweight filter-based algorithm for circular pattern matching Proceedings of the 5th ACM Conference on Bioinformatics, Computational Biology, and Health Informatics, (621-622)
- Adnan M, Lima A, Rossi L, Veluru S, Longley P, Musolesi M and Rajarajan M The Uncertainty of Identity Toolset Proceedings of the 7th International Conference on Security of Information and Networks, (254-260)
- Smith D, Cordell R, Dillon E, Stramp N and Wilkerson J Detecting and modeling local text reuse Proceedings of the 14th ACM/IEEE-CS Joint Conference on Digital Libraries, (183-192)
- Harris M, Levene M, Zhang D and Levene D The anatomy of a search and mining system for digital humanities Proceedings of the 14th ACM/IEEE-CS Joint Conference on Digital Libraries, (165-168)
- Fici G, Gagie T, Kärkkäinen J and Kempa D (2014). A subquadratic algorithm for minimum palindromic factorization, Journal of Discrete Algorithms, 28:C, (41-48), Online publication date: 1-Sep-2014.
- 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.
- Jupin J and Shi J Identity Tracking in Big Data Proceedings of the 2014 International Conference on Big Data Science and Computing, (1-8)
- 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.
- Navarro G and Ordóñez A Faster Compressed Suffix Trees for Repetitive Text Collections Proceedings of the 13th International Symposium on Experimental Algorithms - Volume 8504, (424-435)
- 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)
- Hirvola T and Tarhio J Approximate Online Matching of Circular Strings Proceedings of the 13th International Symposium on Experimental Algorithms - Volume 8504, (315-325)
- Gallé M and Renders J Boilerplate Detection and Recoding Proceedings of the 36th European Conference on IR Research on Advances in Information Retrieval - Volume 8416, (462-467)
- Navarro G (2014). Spaces, Trees, and Colors, ACM Computing Surveys, 46:4, (1-47), Online publication date: 1-Apr-2014.
- Gorji A and Abadi M Detecting Obfuscated JavaScript Malware Using Sequences of Internal Function Calls Proceedings of the 2014 ACM Southeast Regional Conference, (1-6)
- Lanc I, Bui P, Thain D and Emrich S (2014). Adapting bioinformatics applications for heterogeneous systems, Concurrency and Computation: Practice & Experience, 26:4, (866-877), Online publication date: 25-Mar-2014.
- Gallé M and Tealdi M On Context-Diverse Repeats and Their Incremental Computation Proceedings of the 8th International Conference on Language and Automata Theory and Applications - Volume 8370, (384-395)
- Blondin Massé A, Gaboury S, Hallé S and Larouche M Solving Equations on Words with Morphisms and Antimorphisms Proceedings of the 8th International Conference on Language and Automata Theory and Applications - Volume 8370, (186-197)
- Ota T, Fukae H and Morita H (2014). Dynamic construction of an antidictionary with linear complexity, Theoretical Computer Science, 526, (108-119), Online publication date: 1-Mar-2014.
- Stølting Brodal G, Kaporis A, Papadopoulos A, Sioutas S, Tsakalidis K and Tsichlas K (2014). Dynamic 3-sided planar range queries with expected doubly-logarithmic time, Theoretical Computer Science, 526, (58-74), Online publication date: 1-Mar-2014.
- Vasconcellos J, Nishibe C, Almeida N and Cáceres E Efficient Parallel Implementations of Multiple Sequence Alignment using BSP/CGM Model Proceedings of Programming Models and Applications on Multicores and Manycores, (103-110)
- Ozsoy A, Chauhan A and Swany M Fast Longest Common Subsequence with General Integer Scoring Support on GPUs Proceedings of Programming Models and Applications on Multicores and Manycores, (92-102)
- Vasconcellos J, Nishibe C, Almeida N and Cáceres E Efficient Parallel Implementations of Multiple Sequence Alignment using BSP/CGM Model Proceedings of Programming Models and Applications on Multicores and Manycores, (103-110)
- Ozsoy A, Chauhan A and Swany M Fast Longest Common Subsequence with General Integer Scoring Support on GPUs Proceedings of Programming Models and Applications on Multicores and Manycores, (92-102)
- Alstrup S, Halvorsen E and Larsen K Near-optimal labeling schemes for nearest common ancestors Proceedings of the twenty-fifth annual ACM-SIAM symposium on Discrete algorithms, (972-982)
- Liwicki M, Ebert S and Dengel A (2014). Bridging the gap between handwriting recognition and knowledge management, Pattern Recognition Letters, 35:C, (204-213), Online publication date: 1-Jan-2014.
- Brlek S and Lafreniére N (2014). Reconstructing Words from a σ-palindromic Language, Fundamenta Informaticae, 135:1-2, (59-72), Online publication date: 1-Jan-2014.
- 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.
- Smetanin Y and Ulyanov M (2014). Reconstruction of a Word from a Finite Set of its Subwords under the unit Shift Hypothesis. I. Reconstruction without for Bidden Words1 Please check captured article title, if appropriate., Cybernetics and Systems Analysis, 50:1, (148-156), Online publication date: 1-Jan-2014.
- Gog S and Ohlebusch E (2013). Compressed suffix trees, ACM Journal of Experimental Algorithmics, 18, (2.1-2.31), Online publication date: 1-Dec-2013.
- Barash V, Milic-Frayling N and Smith M A Method for Discovering Dynamic Network Motifs by Encoding Topic Propagation Proceedings of the 2013 IEEE/WIC/ACM International Joint Conferences on Web Intelligence (WI) and Intelligent Agent Technologies (IAT) - Volume 01, (451-458)
- Lim W, Sachan A and Thing V A Lightweight Algorithm for Automated Forum Information Processing Proceedings of the 2013 IEEE/WIC/ACM International Joint Conferences on Web Intelligence (WI) and Intelligent Agent Technologies (IAT) - Volume 01, (121-126)
- Huang Z, Juarez J, Duan H and Li H (2013). Length of stay prediction for clinical treatment process using temporal similarity, Expert Systems with Applications: An International Journal, 40:16, (6330-6339), Online publication date: 1-Nov-2013.
- Severyn A, Nicosia M and Moschitti A Building structures from classifiers for passage reranking Proceedings of the 22nd ACM international conference on Information & Knowledge Management, (969-978)
- Sahli M, Mansour E and Kalnis P Parallel motif extraction from very long sequences Proceedings of the 22nd ACM international conference on Information & Knowledge Management, (549-558)
- Na J, Park H, Lee S, Hong M, Lecroq T, Mouchard L and Park K Suffix Array of Alignment Proceedings of the 20th International Symposium on String Processing and Information Retrieval - Volume 8214, (243-254)
- Amershi S, Mahmud J, Nichols J, Lau T and Ruiz G (2013). LiveAction, ACM Transactions on Interactive Intelligent Systems, 3:3, (1-23), Online publication date: 1-Oct-2013.
- 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.
- Huang S, Kao C, McMillan L and Wang W Transforming Genomes Using MOD Files with Applications Proceedings of the International Conference on Bioinformatics, Computational Biology and Biomedical Informatics, (595-604)
- Beal R, Adjeroh D and Abbasi A The Forward Stem Matrix Proceedings of the International Conference on Bioinformatics, Computational Biology and Biomedical Informatics, (575-584)
- Lei J, Techa-angkoon P, Sun Y and Achawanantakun R ChainKnot Proceedings of the International Conference on Bioinformatics, Computational Biology and Biomedical Informatics, (535-544)
- Barton C, Flouri T, Iliopoulos C and Pissis S GapsMis Proceedings of the International Conference on Bioinformatics, Computational Biology and Biomedical Informatics, (402-411)
- Weber M, Mohror K, Schulz M, de Supinski B, Brunst H and Nagel W Alignment-Based metrics for trace comparison Proceedings of the 19th international conference on Parallel Processing, (29-40)
- Asoudeh N and Labiche Y A Multi-objective Genetic Algorithm for Generating Test Suites from Extended Finite State Machines Proceedings of the 5th International Symposium on Search Based Software Engineering - Volume 8084, (288-293)
- Huang X, Luo J and Wang X Finding frequent sub-trajectories with time constraints Proceedings of the 2nd ACM SIGKDD International Workshop on Urban Computing, (1-8)
- Gonçalves J and Madeira S Heuristic approaches for time-lagged biclustering Proceedings of the 12th International Workshop on Data Mining in Bioinformatics, (1-9)
- Gallé M The bag-of-repeats representation of documents Proceedings of the 36th international ACM SIGIR conference on Research and development in information retrieval, (1053-1056)
- Hasan M, Islam A, Rahman M and Sen A On palindromic sequence automata and applications Proceedings of the 18th international conference on Implementation and Application of Automata, (158-168)
- Elzinga C and Wang H (2013). Versatile string kernels, Theoretical Computer Science, 495, (50-65), Online publication date: 1-Jul-2013.
- Rasheed F, Adnan M and Alhajj R (2013). Out-of-core detection of periodicity from sequence databases, Knowledge and Information Systems, 36:1, (277-301), Online publication date: 1-Jul-2013.
- Barceló Baeza P Querying graph databases Proceedings of the 32nd ACM SIGMOD-SIGACT-SIGAI symposium on Principles of database systems, (175-188)
- Zhu X, Schleif F and Hammer B Secure semi-supervised vector quantization for dissimilarity data Proceedings of the 12th international conference on Artificial Neural Networks: advances in computational intelligence - Volume Part I, (347-356)
- Dumas M, GarcíA-BañUelos L, La Rosa M and Uba R (2013). Fast detection of exact clones in business process model repositories, Information Systems, 38:4, (619-633), Online publication date: 1-Jun-2013.
- de Alfaro L and Shavlovsky M Attributing authorship of revisioned content Proceedings of the 22nd international conference on World Wide Web, (343-354)
- Garcia S, Rodrigues J, Santos S, Pratas D, Afreixo V, Bastos C, Ferreira P and Pinho A (2013). A Genomic Distance for Assembly Comparison Based on Compressed Maximal Exact Matches, IEEE/ACM Transactions on Computational Biology and Bioinformatics, 10:3, (793-798), Online publication date: 1-May-2013.
- Qi J, Hu J, Peng Y, Chai X and Ren Q (2013). Case based time series prediction using biased time warp distance for electrical evoked potential forecasting in visual prostheses, Applied Soft Computing, 13:5, (2467-2477), Online publication date: 1-May-2013.
- Jansson J, Shen C and Sung W An optimal algorithm for building the majority rule consensus tree Proceedings of the 17th international conference on Research in Computational Molecular Biology, (88-99)
- Guo Q, Luo J, Li G, Wang X and Geroliminis N A data-driven approach for convergence prediction on road network Proceedings of the 12th international conference on Web and Wireless Geographical Information Systems, (41-53)
- Siragusa E, Weese D and Reinert K Scalable string similarity search/join with approximate seeds and multiple backtracking Proceedings of the Joint EDBT/ICDT 2013 Workshops, (370-374)
- DeRonne K and Karypis G (2013). Pareto Optimal Pairwise Sequence Alignment, IEEE/ACM Transactions on Computational Biology and Bioinformatics, 10:2, (481-493), Online publication date: 1-Mar-2013.
- Lei J, Techa-angkoon P and Sun Y (2013). Chain-RNA, IEEE/ACM Transactions on Computational Biology and Bioinformatics, 10:2, (274-285), Online publication date: 1-Mar-2013.
- Hemmati H, Arcuri A and Briand L (2013). Achieving scalable model-based testing through test case diversity, ACM Transactions on Software Engineering and Methodology, 22:1, (1-42), Online publication date: 1-Feb-2013.
- 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.
- Hermelin D, Landau G, Landau S and Weimann O (2013). Unified Compression-Based Acceleration of Edit-Distance Computation, Algorithmica, 65:2, (339-353), Online publication date: 1-Feb-2013.
- Samanta R, Deshmukh J and Chaudhuri S Robustness Analysis of Networked Systems Proceedings of the 14th International Conference on Verification, Model Checking, and Abstract Interpretation - Volume 7737, (229-247)
- Lindawati , Yuan Z, Lau H and Zhu F Automated Parameter Tuning Framework for Heterogeneous and Large Instances Revised Selected Papers of the 7th International Conference on Learning and Intelligent Optimization - Volume 7997, (423-437)
- Jansson J, Shen C and Sung W Improved algorithms for constructing consensus trees Proceedings of the twenty-fourth annual ACM-SIAM symposium on Discrete algorithms, (1800-1813)
- Leckey K, Neininger R and Szpankowski W Towards more realistic probabilistic models for data structures Proceedings of the twenty-fourth annual ACM-SIAM symposium on Discrete algorithms, (877-886)
- Fredriksson K and Grabowski S (2013). Exploiting word-level parallelism for fast convolutions and their applications in approximate string matching, European Journal of Combinatorics, 34:1, (38-51), Online publication date: 1-Jan-2013.
- 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.
- Smyth W (2013). Computing regularities in strings, European Journal of Combinatorics, 34:1, (3-14), Online publication date: 1-Jan-2013.
- Petri M and Culpepper J Efficient indexing algorithms for approximate pattern matching in text Proceedings of the Seventeenth Australasian Document Computing Symposium, (9-16)
- Barceló P, Libkin L, Lin A and Wood P (2012). Expressive Languages for Path Queries over Graph-Structured Data, ACM Transactions on Database Systems, 37:4, (1-46), Online publication date: 1-Dec-2012.
- Gu Z, Barr E, Schleck D and Su Z (2012). Reusing debugging knowledge via trace-based bug search, ACM SIGPLAN Notices, 47:10, (927-942), Online publication date: 15-Nov-2012.
- Esling P and Agon C (2012). Time-series data mining, ACM Computing Surveys, 45:1, (1-34), Online publication date: 1-Nov-2012.
- 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.
- Badkobeh G, Crochemore M and Toopsuwan C Computing the maximal-exponent repeats of an overlap-free string in linear time Proceedings of the 19th international conference on String Processing and Information Retrieval, (61-72)
- 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)
- Kociumaka T, Radoszewski J, Rytter W and Waleń T Efficient data structures for the factor periodicity problem Proceedings of the 19th international conference on String Processing and Information Retrieval, (284-294)
- Beller T, Berger K and Ohlebusch E Space-Efficient computation of maximal and supermaximal repeats in genome sequences Proceedings of the 19th international conference on String Processing and Information Retrieval, (99-110)
- Gu Z, Barr E, Schleck D and Su Z Reusing debugging knowledge via trace-based bug search Proceedings of the ACM international conference on Object oriented programming systems languages and applications, (927-942)
- Kurnia I and Poetzsch-Heffter A Verification of Open Concurrent Object Systems Revised Lectures of the 11th International Symposium on Formal Methods for Components and Objects - Volume 7866, (83-118)
- Abouelhoda M and Seif S Efficient distributed computation of maximal exact matches Proceedings of the 19th European conference on Recent Advances in the Message Passing Interface, (214-223)
- Andrzejewski W and Bębel B FOCUS Proceedings of the 16th East European conference on Advances in Databases and Information Systems, (29-42)
- Bonizzoni P, Dondi R, Mauri G and Zoppis I Restricted and swap common superstring Proceedings of the 7th international conference on Parameterized and Exact Computation, (49-60)
- Alatabbi A, Crochemore M, Iliopoulos C and Okanlawon T Overlapping repetitions in weighted sequence Proceedings of the CUBE International Information Technology Conference, (435-440)
- Grozea C, Manea F, Müller M and Nowotka D String matching with involutions Proceedings of the 11th international conference on Unconventional Computation and Natural Computation, (106-117)
- Labarre A (2012). Review of combinatorial pattern matching algorithms in computational biology using Perl and R, by Gabriel Valiente, ACM SIGACT News, 43:3, (48-50), Online publication date: 27-Aug-2012.
- Sukarno P, Bhattacharjee N and Srinivasan B How confident are you to counter uncertainty? Proceedings of the First International Conference on Security of Internet of Things, (116-125)
- Massé A, Gaboury S and Hallé S Pseudoperiodic words Proceedings of the 16th international conference on Developments in Language Theory, (308-319)
- Speiser M, Antonini G, Labbi A and Sutanto J On nested palindromes in clickstream data Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining, (1460-1468)
- Andrews N, Eisner J and Dredze M Name phylogeny Proceedings of the 2012 Joint Conference on Empirical Methods in Natural Language Processing and Computational Natural Language Learning, (344-355)
- Zhu X, Schleif F and Hammer B Patch processing for relational learning vector quantization Proceedings of the 9th international conference on Advances in Neural Networks - Volume Part I, (55-63)
- Pinnis M, Ion R, Ştefănescu D, Su F, Skadiņa I, Vasiļjevs A and Babych B ACCURAT toolkit for multi-level alignment and information extraction from comparable corpora Proceedings of the ACL 2012 System Demonstrations, (91-96)
- Gesmundo A and Samardžić T Lemmatisation as a tagging task Proceedings of the 50th Annual Meeting of the Association for Computational Linguistics: Short Papers - Volume 2, (368-372)
- Allali J, Chauve C, Ferraro P and Gaillard A (2012). Efficient chaining of seeds in ordered trees, Journal of Discrete Algorithms, 14, (107-118), Online publication date: 1-Jul-2012.
- Dai D, Xie J, Zhang H and Dong J Efficient range queries over uncertain strings Proceedings of the 24th international conference on Scientific and Statistical Database Management, (75-95)
- Fenz D, Lange D, Rheinländer A, Naumann F and Leser U Efficient similarity search in very large string sets Proceedings of the 24th international conference on Scientific and Statistical Database Management, (262-279)
- Bär D, Biemann C, Gurevych I and Zesch T UKP Proceedings of the First Joint Conference on Lexical and Computational Semantics - Volume 1: Proceedings of the main conference and the shared task, and Volume 2: Proceedings of the Sixth International Workshop on Semantic Evaluation, (435-440)
- Paul M and Eisner J Implicitly intersecting weighted automata using dual decomposition Proceedings of the 2012 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, (232-242)
- Sachan M and Bhattacharya A (2012). Mining statistically significant substrings using the chi-square statistic, Proceedings of the VLDB Endowment, 5:10, (1052-1063), Online publication date: 1-Jun-2012.
- Segura V, Barbosa S and Simões F UISKEI Proceedings of the International Working Conference on Advanced Visual Interfaces, (18-25)
- Wood P (2012). Query languages for graph databases, ACM SIGMOD Record, 41:1, (50-60), Online publication date: 25-Apr-2012.
- List J LexStat Proceedings of the EACL 2012 Joint Workshop of LINGVIS & UNCLH, (117-125)
- Lohk A, Vare K and Võhandu L First steps in checking and comparing Princeton WordNet and Estonian Wordnet Proceedings of the EACL 2012 Joint Workshop of LINGVIS & UNCLH, (25-29)
- Aggarwal C, Lin W and Yu P Searching by corpus with fingerprints Proceedings of the 15th International Conference on Extending Database Technology, (348-359)
- Zibran M and Roy C IDE-based real-time focused search for near-miss clones Proceedings of the 27th Annual ACM Symposium on Applied Computing, (1235-1242)
- Bille P and Stöckel M Fast and cache-oblivious dynamic programming with local dependencies Proceedings of the 6th international conference on Language and Automata Theory and Applications, (131-142)
- Kulekci M, Vitter J and Xu B (2012). Efficient Maximal Repeat Finding Using the Burrows-Wheeler Transform and Wavelet Tree, IEEE/ACM Transactions on Computational Biology and Bioinformatics, 9:2, (421-429), Online publication date: 1-Mar-2012.
- Dhaliwal J, Puglisi S and Turpin A Trends in suffix sorting Proceedings of the Thirty-fifth Australasian Computer Science Conference - Volume 122, (91-98)
- Navarro G and Nekrich Y Top-k document retrieval in optimal time and linear space Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete algorithms, (1066-1077)
- Chiniforooshan E, Kari L and Xu Z (2012). Pseudopower Avoidance, Fundamenta Informaticae, 114:1, (55-72), Online publication date: 1-Jan-2012.
- Kawanami K and Fujimoto N GPU accelerated computation of the longest common subsequence Facing the Multicore-Challenge II, (84-95)
- Eusse J, Moreano N, de Melo A and Jacobi R (2012). A protein sequence analysis hardware accelerator based on divergences, International Journal of Reconfigurable Computing, 2012, (4-4), Online publication date: 1-Jan-2012.
- Bokhari S, Pomeroy L and Janies D (2012). Reassortment Networks and the Evolution of Pandemic H1N1 Swine-Origin Influenza, IEEE/ACM Transactions on Computational Biology and Bioinformatics, 9:1, (214-227), Online publication date: 1-Jan-2012.
- Sukarno P, Bhattacharjee N and Srinivasan B On the commonality of iris biometrics Proceedings of the 9th International Conference on Advances in Mobile Computing and Multimedia, (19-25)
- Drozd A, Maruyama N and Matsuoka S Poster Proceedings of the 2011 companion on High Performance Computing Networking, Storage and Analysis Companion, (21-22)
- Arbelaitz O, Gurrutxaga I, Lojo A, Muguerza J and Perona I SAHN with SEP/COP and SPADE, to build a general web navigation adaptation system using server log information Proceedings of the 14th international conference on Advances in artificial intelligence: spanish association for artificial intelligence, (413-422)
- Ráduly-Baka C, Knuutila T, Johnsson M and Nevalainen O (2011). Organizing the operation of radial machine sequencers for multiple PCB types, Computers and Industrial Engineering, 61:4, (1003-1010), Online publication date: 1-Nov-2011.
- Kucherov G On-line construction of position heaps Proceedings of the 18th international conference on String processing and information retrieval, (326-337)
- 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)
- Goto K, Bannai H, Inenaga S and Takeda M Fast q-gram mining on SLP compressed strings Proceedings of the 18th international conference on String processing and information retrieval, (278-289)
- Beller T, Gog S, Ohlebusch E and Schnattinger T Computing the longest common prefix array based on the burrows-wheeler transform Proceedings of the 18th international conference on String processing and information retrieval, (197-208)
- 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)
- Gomes L and Lopes J Measuring spelling similarity for cognate identification Proceedings of the 15th Portugese conference on Progress in artificial intelligence, (624-633)
- Nakahara M, Maruyama S, Kuboyama T and Sakamoto H Scalable detection of frequent substrings by grammar-based compression Proceedings of the 14th international conference on Discovery science, (236-246)
- Liu Y, Gao B and Zhang X An improved sequential clustering algorithm Proceedings of the Third international conference on Artificial intelligence and computational intelligence - Volume Part I, (444-449)
- Denzumi S, Arimura H and Minato S Implementation of sequence BDDs in Erlang Proceedings of the 10th ACM SIGPLAN workshop on Erlang, (90-91)
- Gipp B and Meuschke N Citation pattern matching algorithms for citation-based plagiarism detection Proceedings of the 11th ACM symposium on Document engineering, (249-258)
- Cohen-Boulakia S and Leser U (2011). Search, adapt, and reuse, ACM SIGMOD Record, 40:2, (6-16), Online publication date: 15-Sep-2011.
- Liwicki M, Thieme S, Kahl G and Dengel A An intelligent shopping list - combining digital paper with product ontologies Proceedings of the 15th international conference on Knowledge-based and intelligent information and engineering systems - Volume Part IV, (187-194)
- Müller U, Metz D, Karadgi S, Grauer M and Schäfer W Interaction techniques for integrated content-based enterprise search Proceedings of the 15th international conference on Knowledge-based and intelligent information and engineering systems - Volume Part III, (56-66)
- Tran T, Giraud M and Varré J Bit-parallel multiple pattern matching Proceedings of the 9th international conference on Parallel Processing and Applied Mathematics - Volume Part II, (292-301)
- 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.
- 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.
- Barbay J, He M, Munro J and Satti S (2011). Succinct indexes for strings, binary relations and multilabeled trees, ACM Transactions on Algorithms, 7:4, (1-27), Online publication date: 1-Sep-2011.
- Uba R, Dumas M, García-Bañuelos L and La Rosa M Clone detection in repositories of business process models Proceedings of the 9th international conference on Business process management, (248-264)
- Hao P, Chen X, Cheng N, Chandramouli R and Subbalakshmi K Adaptive context modeling for deception detection in emails Proceedings of the 7th international conference on Machine learning and data mining in pattern recognition, (458-468)
- 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)
- Loyola P, Román P and Velásquez J Clustering-Based Learning Approach for Ant Colony Optimization Model to Simulate Web User Behavior Proceedings of the 2011 IEEE/WIC/ACM International Conferences on Web Intelligence and Intelligent Agent Technology - Volume 01, (457-464)
- 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)
- He J, Liang H and Yang G Reversing longest previous factor tables is hard Proceedings of the 12th international conference on Algorithms and data structures, (488-499)
- Flouri T, Park K, Frousios K, Pissis S, Iliopoulos C and Tischler G Approximate string-matching with a single gap for sequence alignment Proceedings of the 2nd ACM Conference on Bioinformatics, Computational Biology and Biomedicine, (490-492)
- Li Y, Halpern A and Zhang S TreeLign Proceedings of the 2nd ACM Conference on Bioinformatics, Computational Biology and Biomedicine, (451-456)
- Flouri T, Iliopoulos C and Pissis S DynMap Proceedings of the 2nd ACM Conference on Bioinformatics, Computational Biology and Biomedicine, (330-334)
- Xiao C, Wang W, Lin X, Yu J and Wang G (2011). Efficient similarity joins for near-duplicate detection, ACM Transactions on Database Systems, 36:3, (1-41), Online publication date: 1-Aug-2011.
- Beňuš Š, Cerňak M, Rusko M, Trnka M and Darjaa S Adapting Slovak ASR for native Germans speaking Slovak Proceedings of the First Workshop on Algorithms and Resources for Modelling of Dialects and Language Varieties, (60-64)
- Nederhof M and Satta G Computation of infix probabilities for probabilistic context-free grammars Proceedings of the Conference on Empirical Methods in Natural Language Processing, (1213-1221)
- Beal R and Adjeroh D p-Suffix sorting as arithmetic coding Proceedings of the 22nd international conference on Combinatorial Algorithms, (44-56)
- Beal R and Adjeroh D Parameterized longest previous factor Proceedings of the 22nd international conference on Combinatorial Algorithms, (31-43)
- Condon A and Thachuk C Efficient codon optimization with motif engineering Proceedings of the 22nd international conference on Combinatorial Algorithms, (337-348)
- Nicholson D, Podilchuk C and Bartlett K Facial recognition Proceedings of the 6th international conference on Foundations of augmented cognition: directing the future of adaptive systems, (104-111)
- Alur R and Deshmukh J Nondeterministic streaming string transducers Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II, (1-20)
- Cygan M, Kubica M, Radoszewski J, Rytter W and Waleń T Polynomial-time approximation algorithms for weighted LCS problem Proceedings of the 22nd annual conference on Combinatorial pattern matching, (455-466)
- Bille P and Gørtz I Substring range reporting Proceedings of the 22nd annual conference on Combinatorial pattern matching, (299-308)
- 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)
- Tomohiro I, Inenaga S and Takeda M Palindrome pattern matching Proceedings of the 22nd annual conference on Combinatorial pattern matching, (232-245)
- Striewe M and Goedicke M Using run time traces in automated programming tutoring Proceedings of the 16th annual joint conference on Innovation and technology in computer science education, (303-307)
- Orlandi A and Venturini R Space-efficient substring occurrence estimation Proceedings of the thirtieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, (95-106)
- Menon R, Bhat G and Schatz M Rapid parallel genome indexing with MapReduce Proceedings of the second international workshop on MapReduce and its applications, (51-58)
- Jung C, Rus S, Railing B, Clark N and Pande S Brainy Proceedings of the 32nd ACM SIGPLAN Conference on Programming Language Design and Implementation, (86-97)
- Jung C, Rus S, Railing B, Clark N and Pande S (2011). Brainy, ACM SIGPLAN Notices, 46:6, (86-97), Online publication date: 4-Jun-2011.
- 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)
- Tairas R, Jacob F and Gray J Representing clones in a localized manner Proceedings of the 5th International Workshop on Software Clones, (54-60)
- Brisaboa N, Cánovas R, Claude F, Martínez-Prieto M and Navarro G Compressed string dictionaries Proceedings of the 10th international conference on Experimental algorithms, (136-147)
- 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.
- Mitankin P, Mihov S and Schulz K (2011). Deciding word neighborhood with universal neighborhood automata, Theoretical Computer Science, 412:22, (2340-2355), Online publication date: 1-May-2011.
- 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.
- Grabowski S, Faro S and Giaquinta E (2011). String matching with inversions and translocations in linear average time (most of the time), Information Processing Letters, 111:11, (516-520), Online publication date: 1-May-2011.
- De ilarraza A, Gojenola K, Oronoz M and Alegria I (2011). Syntactic error detection and correction in date expressions using finite-state transducers, Natural Language Engineering, 17:2, (145-161), Online publication date: 1-Apr-2011.
- Ng J, Amir A and Pevzner P Blocked pattern matching problem and its applications in proteomics Proceedings of the 15th Annual international conference on Research in computational molecular biology, (298-319)
- Patil N, Toshniwal D and Garg K Species identification based on approximate matching Proceedings of the Fourth Annual ACM Bangalore Conference, (1-4)
- Xu W, Thompson L and Miranker D Empirical evaluation of excluded middle vantage point forest on biological sequences workload Proceedings of the 1st Workshop on New Trends in Similarity Search, (26-31)
- Costa J, Lopes G, Gomes L and Russo L Representing a bilingual lexicon with suffix trees Proceedings of the 2011 ACM Symposium on Applied Computing, (1164-1165)
- Fu B, Kao M and Wang L (2011). Discovering almost any hidden motif from multiple sequences, ACM Transactions on Algorithms, 7:2, (1-18), Online publication date: 1-Mar-2011.
- Lu W, Fung G, Du X, Zhou X, Chen L and Deng K (2011). Approximate entity extraction in temporal databases, World Wide Web, 14:2, (157-186), Online publication date: 1-Mar-2011.
- Kuruppu S, Puglisi S and Zobel J Optimized relative Lempel-Ziv compression of genomes Proceedings of the Thirty-Fourth Australasian Computer Science Conference - Volume 113, (91-98)
- Wu Y (2011). New Methods for Inference of Local Tree Topologies with Recombinant SNP Sequences in Populations, IEEE/ACM Transactions on Computational Biology and Bioinformatics, 8:1, (182-193), Online publication date: 1-Jan-2011.
- Deorowicz S (2010). Bit-Parallel Algorithm for the Constrained Longest Common Subsequence Problem, Fundamenta Informaticae, 99:4, (409-433), Online publication date: 1-Dec-2010.
- Hemmati H, Briand L, Arcuri A and Ali S An enhanced test case selection approach for model-based testing Proceedings of the eighteenth ACM SIGSOFT international symposium on Foundations of software engineering, (267-276)
- 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.
- 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.
- Crochemore M and Tischler G The gapped suffix array Proceedings of the 17th international conference on String processing and information retrieval, (359-364)
- Ohlebusch E, Gog S and Kügell A Computing matching statistics and maximal exact matches on compressed full-text indexes Proceedings of the 17th international conference on String processing and information retrieval, (347-358)
- Tomohiro I, Inenaga S, Bannai H and Takeda M Counting and verifying maximal palindromes Proceedings of the 17th international conference on String processing and information retrieval, (135-146)
- Matroud A, Hendy M and Tuffley C An algorithm to solve the motif alignment problem for approximate nested tandem repeats Proceedings of the 2010 international conference on Comparative genomics, (188-197)
- Wong A, Zhuang D, Li G and Lee E Discovery of non-induced patterns from sequences Proceedings of the 5th IAPR international conference on Pattern recognition in bioinformatics, (149-160)
- Lu L, Chang E and Chan M Website fingerprinting and identification using ordered feature sequences Proceedings of the 15th European conference on Research in computer security, (199-214)
- Grauer M, Karadgi S, Müller U, Metz D and Schäfer W Proactive control of manufacturing processes using historical data Proceedings of the 14th international conference on Knowledge-based and intelligent information and engineering systems: Part II, (399-408)
- Jansson J and Sung W Constructing the R* consensus tree of two trees in subcubic time Proceedings of the 18th annual European conference on Algorithms: Part I, (573-584)
- Ma F and Deogun J The solution space of genome sequence alignment and LIS graph decomposition Proceedings of the First ACM International Conference on Bioinformatics and Computational Biology, (302-311)
- Ashlock D and Houghten S Ring optimization of edit metric codes in DNA Proceedings of the First ACM International Conference on Bioinformatics and Computational Biology, (222-229)
- Morgado A and Marques-Silva J (2010). Combinatorial Optimization Solutions for the Maximum Quartet Consistency Problem, Fundamenta Informaticae, 102:3-4, (363-389), Online publication date: 1-Aug-2010.
- Raduly-Baka C, Knuutila T, Johnsson M and Nevalainen O (2010). Construction of component tapes for radial placement machines, Computers and Operations Research, 37:8, (1488-1499), Online publication date: 1-Aug-2010.
- Allali J, Chauve C, Ferraro P and Gaillard A Efficient chaining of seeds in ordered trees Proceedings of the 21st international conference on Combinatorial algorithms, (260-273)
- Li Y and Lin J Approximate variable-length time series motif discovery using grammar inference Proceedings of the Tenth International Workshop on Multimedia Data Mining, (1-9)
- Zhang H, Guo Q and Iliopoulos C Varieties of regularities in weighted sequences Proceedings of the 6th international conference on Algorithmic aspects in information and management, (271-280)
- Huang S, Lam T, Sung W, Tam S and Yiu S Indexing similar DNA sequences Proceedings of the 6th international conference on Algorithmic aspects in information and management, (180-190)
- Zaghouani W, Diab M, Mansouri A, Pradhan S and Palmer M The revised Arabic PropBank Proceedings of the Fourth Linguistic Annotation Workshop, (222-226)
- McMinn P, Stevenson M and Harman M Reducing qualitative human oracle costs associated with automatically generated test data Proceedings of the First International Workshop on Software Test Output Validation, (1-4)
- Li S, Lin C, Song Y and Li Z Comparable entity mining from comparative questions Proceedings of the 48th Annual Meeting of the Association for Computational Linguistics, (650-658)
- Deorowicz S (2010). Solving longest common subsequence and related problems on graphical processing units, Software—Practice & Experience, 40:8, (673-700), Online publication date: 1-Jul-2010.
- Chowdhury R, Le H and Ramachandran V (2010). Cache-Oblivious Dynamic Programming for Bioinformatics, IEEE/ACM Transactions on Computational Biology and Bioinformatics, 7:3, (495-510), Online publication date: 1-Jul-2010.
- Rheinländer A, Knobloch M, Hochmuth N and Leser U Prefix tree indexing for similarity search and similarity joins on genomic data Proceedings of the 22nd international conference on Scientific and statistical database management, (519-536)
- Russo L, Navarro G and Oliveira A Parallel and distributed compressed indexes Proceedings of the 21st annual conference on Combinatorial pattern matching, (348-360)
- Lee T, Na J, Park H, Park K and Sim J Finding optimal alignment and consensus of circular strings Proceedings of the 21st annual conference on Combinatorial pattern matching, (310-322)
- Välimäki N, Ladra S and Mäkinen V Approximate all-pairs suffix/prefix overlaps Proceedings of the 21st annual conference on Combinatorial pattern matching, (76-87)
- Xu Z A minimal periods algorithm with applications Proceedings of the 21st annual conference on Combinatorial pattern matching, (51-62)
- Zhai Z, Xu H, Li J and Jia P Feature subsumption for sentiment classification in multiple languages Proceedings of the 14th Pacific-Asia conference on Advances in Knowledge Discovery and Data Mining - Volume Part II, (261-271)
- Orkin J, Smith T, Reckman H and Roy D Semi-automatic task recognition for interactive narratives with EAT & RUN Proceedings of the Intelligent Narrative Technologies III Workshop, (1-8)
- Krusche P and Tiskin A New algorithms for efficient parallel string comparison Proceedings of the twenty-second annual ACM symposium on Parallelism in algorithms and architectures, (209-216)
- Mahmoud H and Aboulnaga A Schema clustering and retrieval for multi-domain pay-as-you-go data integration systems Proceedings of the 2010 ACM SIGMOD International Conference on Management of data, (411-422)
- Barcelo P, Hurtado C, Libkin L and Wood P Expressive languages for path queries over graph-structured data Proceedings of the twenty-ninth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, (3-14)
- Dunlop A, Mitchell M and Roark B Prenominal modifier ordering via multiple sequence alignment Human Language Technologies: The 2010 Annual Conference of the North American Chapter of the Association for Computational Linguistics, (600-608)
- Michael M, Nicolas F and Ukkonen E (2010). On the complexity of finding gapped motifs, Journal of Discrete Algorithms, 8:2, (131-142), Online publication date: 1-Jun-2010.
- Iliopoulos C, Rahman M, Voráček M and Vagner L (2010). Finite automata based algorithms on subsequences and supersequences of degenerate strings, Journal of Discrete Algorithms, 8:2, (117-130), Online publication date: 1-Jun-2010.
- 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.
- Zhang H, Guo Q and Iliopoulos C An algorithmic framework for motif discovery problems in weighted sequences Proceedings of the 7th international conference on Algorithms and Complexity, (335-346)
- Arslan A A fast longest common subsequence algorithm for similar strings Proceedings of the 4th international conference on Language and Automata Theory and Applications, (82-93)
- Milo N, Pinhas T and Ziv-Ukelson M SA-REPC Proceedings of the 4th international conference on Language and Automata Theory and Applications, (451-462)
- Cánovas R and Navarro G Practical compressed suffix trees Proceedings of the 9th international conference on Experimental Algorithms, (94-105)
- Bjørner N, Blass A and Gurevich Y (2010). Content-dependent chunking for differential compression, the local maximum approach, Journal of Computer and System Sciences, 76:3-4, (154-203), Online publication date: 1-May-2010.
- Raidl G and Hu B Enhancing genetic algorithms by a trie-based complete solution archive Proceedings of the 10th European conference on Evolutionary Computation in Combinatorial Optimization, (239-251)
- Yongqing Z, Qing K and Guoqing D A graphical method for reference reconciliation Proceedings of the 15th international conference on Database systems for advanced applications, (156-167)
- Hamdi-Cherif A (2010). Integrating machine learning in intelligent bioinformatics, WSEAS Transactions on Computers, 9:4, (406-417), Online publication date: 1-Apr-2010.
- Jagannathan G, Pillaipakkamnatt K, Wright R and Umano D (2010). Communication-Efficient Privacy-Preserving Clustering, Transactions on Data Privacy, 3:1, (1-25), Online publication date: 1-Apr-2010.
- Almishari M and Yang X (2010). Ads-portal domains, ACM Transactions on the Web, 4:2, (1-34), Online publication date: 1-Apr-2010.
- Bokhari S and Janies D (2010). Reassortment Networks for Investigating the Evolution of Segmented Viruses, IEEE/ACM Transactions on Computational Biology and Bioinformatics, 7:2, (288-298), Online publication date: 1-Apr-2010.
- Fischer J (2010). Wee LCP, Information Processing Letters, 110:8-9, (317-320), Online publication date: 1-Apr-2010.
- Baba K String matching with mismatches by real-valued FFT Proceedings of the 2010 international conference on Computational Science and Its Applications - Volume Part IV, (273-283)
- Rieck K, Schwenk G, Limmer T, Holz T and Laskov P Botzilla Proceedings of the 2010 ACM Symposium on Applied Computing, (1978-1984)
- Tsirogiannis D and Koudas N Suffix tree construction algorithms on modern hardware Proceedings of the 13th International Conference on Extending Database Technology, (263-274)
- Shibuya T (2010). Geometric suffix tree, Journal of the ACM, 57:3, (1-17), Online publication date: 1-Mar-2010.
- Ann H, Yang C, Peng Y and Liaw B (2010). Efficient algorithms for the block edit problems, Information and Computation, 208:3, (221-229), Online publication date: 1-Mar-2010.
- Wu L, Huang J, Horng J and Huang H (2010). An expert system to identify co-regulated gene groups from time-lagged gene clusters using cell cycle expression data, Expert Systems with Applications: An International Journal, 37:3, (2202-2213), Online publication date: 1-Mar-2010.
- Yadwadkar N, Bhattacharyya C, Gopinath K, Niranjan T and Susarla S Discovery of application workloads from network file traces Proceedings of the 8th USENIX conference on File and storage technologies, (14-14)
- Hamdi-Cherif A Machine learning for intelligent bioinformatics Proceedings of the 9th WSEAS international conference on Artificial intelligence, knowledge engineering and data bases, (321-326)
- Hamdi-Cherif A Machine learning for intelligent bioinformatics Proceedings of the 9th WSEAS international conference on Artificial intelligence, knowledge engineering and data bases, (315-320)
- Mahmud J and Lau T Lowering the barriers to website testing with CoTester Proceedings of the 15th international conference on Intelligent user interfaces, (169-178)
- Koppula H, Leela K, Agarwal A, Chitrapura K, Garg S and Sasturkar A Learning URL patterns for webpage de-duplication Proceedings of the third ACM international conference on Web search and data mining, (381-390)
- Crochemore M and Hancart C Pattern matching in strings Algorithms and theory of computation handbook, (13-13)
- Kaczor O, Guéhéneuc Y and Hamel S (2010). Identification of design motifs with pattern matching algorithms, Information and Software Technology, 52:2, (152-168), Online publication date: 1-Feb-2010.
- Tiskin A Fast distance multiplication of unit-Monge matrices Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete algorithms, (1287-1296)
- Yuan H and Atallah M Data structures for range minimum queries in multidimensional arrays Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete algorithms, (150-160)
- Fredriksson K From nondeterministic suffix automaton to lazy suffix tree Algorithms and Applications, (114-129)
- Andoni A, Krauthgamer R and Onak K Polylogarithmic approximation for edit distance and the asymmetric query complexity Property testing, (244-252)
- Andoni A, Krauthgamer R and Onak K Polylogarithmic approximation for edit distance and the asymmetric query complexity Property testing, (244-252)
- Martín G, Vico F, Dassow J and Truthe B (2010). Low Disruption Transformations on Cyclic Automata, Fundamenta Informaticae, 104:1-2, (93-110), Online publication date: 1-Jan-2010.
- Zaki M, Carothers C and Szymanski B (2010). VOGUE, ACM Transactions on Knowledge Discovery from Data, 4:1, (1-31), Online publication date: 1-Jan-2010.
- 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.
- Preissl R, Schulz M, Kranzlmüller D, de Supinski B and Quinlan D (2010). Transforming MPI source code based on communication patterns, Future Generation Computer Systems, 26:1, (147-154), Online publication date: 1-Jan-2010.
- Costa G, Manco G and Ortale R (2010). An incremental clustering scheme for data de-duplication, Data Mining and Knowledge Discovery, 20:1, (152-187), Online publication date: 1-Jan-2010.
- List J SCA Proceedings of the 2010 international conference on New Directions in Logic, Language and Computation, (32-51)
- Umar I, Alqudami N, Rashid N and Abdullah R Parallelisation of sequence comparison algorithms using hybridised parallel techniques Proceedings of the 6th international conference on High capacity optical networks and enabling technologies, (30-35)
- Kim J, Choi S, Na J and Sim J Improved Algorithms for Finding Consistent Superstrings Based on a New Graph Model Proceedings of the 20th International Symposium on Algorithms and Computation, (1185-1194)
- Hsu P, Chen K and Chao K Finding All Approximate Gapped Palindromes Proceedings of the 20th International Symposium on Algorithms and Computation, (1084-1093)
- Jain B and Obermayer K (2009). Structure Spaces, The Journal of Machine Learning Research, 10, (2667-2714), Online publication date: 1-Dec-2009.
- Demaine E, Mozes S, Rossman B and Weimann O (2009). An optimal decomposition algorithm for tree edit distance, ACM Transactions on Algorithms, 6:1, (1-19), Online publication date: 1-Dec-2009.
- 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.
- Fredriksson K and Grabowski S (2009). Average-optimal string matching, Journal of Discrete Algorithms, 7:4, (579-594), Online publication date: 1-Dec-2009.
- Moretti C, Olson M, Emrich S and Thain D Highly scalable genome assembly on campus grids Proceedings of the 2nd Workshop on Many-Task Computing on Grids and Supercomputers, (1-10)
- 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)
- Agarwal A, Koppula H, Leela K, Chitrapura K, Garg S, GM P, Haty C, Roy A and Sasturkar A URL normalization for de-duplication of web pages Proceedings of the 18th ACM conference on Information and knowledge management, (1987-1990)
- Dai D and Zhao G Incremental similarity joins with edit distance constraints Proceedings of the 18th ACM conference on Information and knowledge management, (1449-1452)
- 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)
- du Mouza C, Litwin W, Rigaux P and Schwarz T AS-index Proceedings of the 18th ACM conference on Information and knowledge management, (295-304)
- Kolpakov R and Kucherov G (2009). Searching for gapped palindromes, Theoretical Computer Science, 410:51, (5365-5373), Online publication date: 1-Nov-2009.
- Fischer J, Mäkinen V and Navarro G (2009). Faster entropy-bounded compressed suffix trees, Theoretical Computer Science, 410:51, (5354-5364), Online publication date: 1-Nov-2009.
- Li Y, Bitsakos K, Fermuller C and Aloimonos Y Real-time shape retrieval for robotics using skip Tri-grams Proceedings of the 2009 IEEE/RSJ international conference on Intelligent robots and systems, (4731-4738)
- Hong C and Tewfik A (2009). Heuristic Reusable Dynamic Programming, IEEE/ACM Transactions on Computational Biology and Bioinformatics, 6:4, (570-582), Online publication date: 1-Oct-2009.
- Hassanzadeh O and Miller R (2009). Creating probabilistic databases from duplicated data, The VLDB Journal — The International Journal on Very Large Data Bases, 18:5, (1141-1166), Online publication date: 1-Oct-2009.
- Yang X and Shi Y Enhanced Gestalt Theory Guided Web Page Segmentation for Mobile Browsing Proceedings of the 2009 IEEE/WIC/ACM International Joint Conference on Web Intelligence and Intelligent Agent Technology - Volume 03, (46-49)
- Rastas P A general framework for local pairwise alignment statistics with gaps Proceedings of the 9th international conference on Algorithms in bioinformatics, (233-245)
- Fortnow L (2009). The status of the P versus NP problem, Communications of the ACM, 52:9, (78-86), Online publication date: 1-Sep-2009.
- Liu J, Huang G and Wang Y (2009). A fast algorithm for finding the positions of all squares in a run-length encoded string, Theoretical Computer Science, 410:38-40, (3942-3948), Online publication date: 1-Sep-2009.
- Mohri M, Moreno P and Weinstein E (2009). General suffix automaton construction algorithm and space bounds, Theoretical Computer Science, 410:37, (3553-3562), Online publication date: 1-Sep-2009.
- Crochemore M, Epifanio C, Gabriele A and Mignosi F (2009). From Nerode's congruence to suffix automata with mismatches, Theoretical Computer Science, 410:37, (3471-3480), Online publication date: 1-Sep-2009.
- Curran D An evolutionary neural network approach to intrinsic plagiarism detection Proceedings of the 20th Irish conference on Artificial intelligence and cognitive science, (33-40)
- Amin M and Jamil H FastWrap Proceedings of the 10th IEEE international conference on Information Reuse & Integration, (354-359)
- Hawkins B and Giraud-Carrier C Ranking search results for translated content Proceedings of the 10th IEEE international conference on Information Reuse & Integration, (242-245)
- Liu Y, Wu X, Hu X, Gao J, Wu G, Wang H and Hong X Pattern matching with wildcards based on key character location Proceedings of the 10th IEEE international conference on Information Reuse & Integration, (167-170)
- Banerjee S, Das D and Bandyopadhyay S Bengali verb subcategorization frame acquisition Proceedings of the 7th Workshop on Asian Language Resources, (76-83)
- Hara K, Shimbo M, Okuma H and Matsumoto Y Coordinate structure analysis with global structural constraints and alignment-based local features Proceedings of the Joint Conference of the 47th Annual Meeting of the ACL and the 4th International Joint Conference on Natural Language Processing of the AFNLP: Volume 2 - Volume 2, (967-975)
- Munteanu C, Penn G and Zhu X Improving automatic speech recognition for lectures through transformation-based rules learned from minimal data Proceedings of the Joint Conference of the 47th Annual Meeting of the ACL and the 4th International Joint Conference on Natural Language Processing of the AFNLP: Volume 2 - Volume 2, (764-772)
- Iliopoulos C, Smyth W and Yusufu M (2009). Faster Algorithms for Computing Maximal Multirepeats in Multiple Sequences, Fundamenta Informaticae, 97:3, (311-320), Online publication date: 1-Aug-2009.
- Allali J, Ferraro P, Hanna P, Iliopoulos C and Robine M (2009). Toward a General Framework for Polyphonic Comparison, Fundamenta Informaticae, 97:3, (331-346), Online publication date: 1-Aug-2009.
- Allali J, Ferraro P, Hanna P, Iliopoulos C and Robine M (2009). Toward a General Framework for Polyphonic Comparison, Fundamenta Informaticae, 97:3, (331-346), Online publication date: 1-Aug-2009.
- Iliopoulos C, Smyth W and Yusufu M (2009). Faster Algorithms for Computing Maximal Multirepeats in Multiple Sequences, Fundamenta Informaticae, 97:3, (311-320), Online publication date: 1-Aug-2009.
- Gupta R and Sarawagi S (2009). Answering table augmentation queries from unstructured lists on the web, Proceedings of the VLDB Endowment, 2:1, (289-300), Online publication date: 1-Aug-2009.
- Nicolas F, Mäkinen V and Ukkonen E (2009). Efficient construction of maximal and minimal representations of motifs of a string, Theoretical Computer Science, 410:30-32, (2999-3005), Online publication date: 1-Aug-2009.
- Chan S (2009). Shallow semantic labeling using two-phase feature-enhanced string matching, Expert Systems with Applications: An International Journal, 36:6, (9729-9736), Online publication date: 1-Aug-2009.
- Vinzant C (2009). Lower bounds for optimal alignments of binary sequences, Discrete Applied Mathematics, 157:15, (3341-3346), Online publication date: 1-Aug-2009.
- Stoye J and Wittler R (2009). A Unified Approach for Reconstructing Ancient Gene Clusters, IEEE/ACM Transactions on Computational Biology and Bioinformatics, 6:3, (387-400), Online publication date: 1-Jul-2009.
- Caballero-Gil P and Fúster-Sabater A (2009). A simple attack on some clock-controlled generators, Computers & Mathematics with Applications, 58:1, (179-188), Online publication date: 1-Jul-2009.
- Wong T, Chow K and Lam W Cross Language Information Extraction Knowledge Adaptation Proceedings of the 4th International Conference on Rough Sets and Knowledge Technology, (520-528)
- 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)
- Zhou B, Jiang D, Pei J and Li H OLAP on search logs Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining, (1395-1404)
- Gupta S, Bilenko M and Richardson M Catching the drift Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining, (1165-1174)
- Kärkkäinen J, Manzini G and Puglisi S Permuted Longest-Common-Prefix Array Proceedings of the 20th Annual Symposium on Combinatorial Pattern Matching - Volume 5577, (181-192)
- Bille P Fast Searching in Packed Strings Proceedings of the 20th Annual Symposium on Combinatorial Pattern Matching - Volume 5577, (116-126)
- Landau G, Levy A and Newman I LCS Approximation via Embedding into Local Non-repetitive Strings Proceedings of the 20th Annual Symposium on Combinatorial Pattern Matching - Volume 5577, (92-105)
- Zoumboulakis M and Roussos G Efficient pattern detection in extremely resource-constrained devices Proceedings of the 6th Annual IEEE communications society conference on Sensor, Mesh and Ad Hoc Communications and Networks, (10-18)
- Hanna P, Robine M and Rocher T An alignment based system for chord sequence retrieval Proceedings of the 9th ACM/IEEE-CS joint conference on Digital libraries, (101-104)
- Geleijnse G, Aliakseyeu D and Sarroukh E Comparing text entry methods for interactive television applications Proceedings of the 7th European Conference on Interactive TV and Video, (145-148)
- Su W, Wang J and Lochovsky F (2009). ODE, ACM Transactions on Database Systems, 34:2, (1-35), Online publication date: 1-Jun-2009.
- Schaeckeler S, Shang W and Davis R (2009). Compiler Optimization Pass Visualization, ACM Transactions on Computing Education, 9:2, (1-13), Online publication date: 1-Jun-2009.
- Sakai Y (2009). Computing the longest topological common subsequence of a symbol-wise totally ordered directed acyclic graph and a sequence, Theoretical Computer Science, 410:27-29, (2759-2766), Online publication date: 1-Jun-2009.
- 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.
- Andoni A and Onak K Approximating edit distance in near-linear time Proceedings of the forty-first annual ACM symposium on Theory of computing, (199-204)
- Allali J, Ferraro P, Hanna P and Robine M Polyphonic alignment algorithms for symbolic music retrieval Proceedings of the 6th international conference on Auditory Display, (466-482)
- Fu B, Kao M and Wang L Discovering Almost Any Hidden Motif from Multiple Sequences in Polynomial Time with Low Sample Complexity and High Success Probability Proceedings of the 6th Annual Conference on Theory and Applications of Models of Computation, (231-240)
- Lin J (2009). Detection of cloaked web spam by using tag-based methods, Expert Systems with Applications: An International Journal, 36:4, (7493-7499), Online publication date: 1-May-2009.
- Franklin M, Gondree M and Mohassel P Communication-Efficient Private Protocols for Longest Common Subsequence Proceedings of the The Cryptographers' Track at the RSA Conference 2009 on Topics in Cryptology, (265-278)
- Pearson D and Janodet J String distances and uniformities Proceedings of the 9th international conference on Adaptive and natural computing algorithms, (333-339)
- Pearson D and Janodet J String Distances and Uniformities Proceedings of the 2009 conference on Adaptive and Natural Computing Algorithms - Volume 5495, (333-339)
- Agrawal S, Chakrabarti K, Chaudhuri S, Ganti V, Konig A and Xin D Exploiting web search engines to search structured databases Proceedings of the 18th international conference on World wide web, (501-510)
- Flener P and Pearson J (2009). Solving necklace constraint problems, Journal of Algorithms, 64:2-3, (61-73), Online publication date: 1-Apr-2009.
- Wu Y (2009). An analytical upper bound on the minimum number of recombinations in the history of SNP sequences in populations, Information Processing Letters, 109:9, (427-431), Online publication date: 1-Apr-2009.
- Divakaran S (2009). Approximation algorithms for constrained generalized tree alignment problem, Discrete Applied Mathematics, 157:7, (1407-1422), Online publication date: 1-Apr-2009.
- Prokić J, Wieling M and Nerbonne J Multiple sequence alignments in linguistics Proceedings of the EACL 2009 Workshop on Language Technology and Resources for Cultural Heritage, Social Sciences, Humanities, and Education, (18-25)
- Lee H, Ng R and Shim K Approximate substring selectivity estimation Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology, (827-838)
- Yuan H and Atallah M Efficient data structures for range-aggregate queries on trees Proceedings of the 12th International Conference on Database Theory, (111-120)
- 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)
- Haque W, Aravind A and Reddy B Pairwise sequence alignment algorithms Proceedings of the 2009 conference on Information Science, Technology and Applications, (96-103)
- Cordero F, Visconti A and Botta M A new protein motif extraction framework based on constrained co-clustering Proceedings of the 2009 ACM symposium on Applied Computing, (776-781)
- Lampert C (2009). Kernel Methods in Computer Vision, Foundations and Trends® in Computer Graphics and Vision, 4:3, (193-285), Online publication date: 1-Mar-2009.
- Pizzi C (2009). k-difference matching in amortized linear time for all the words in a text, Theoretical Computer Science, 410:8-10, (983-987), Online publication date: 1-Mar-2009.
- Ferragina P, González R, Navarro G and Venturini R (2009). Compressed text indexes, ACM Journal of Experimental Algorithmics, 13, (1.12-1.31), Online publication date: 1-Feb-2009.
- Brlek S, Provençal X and Fédou J (2009). On the tiling by translation problem, Discrete Applied Mathematics, 157:3, (464-475), Online publication date: 1-Feb-2009.
- Juarez J, Guil F, Palma J and Marin R (2009). Temporal similarity by measuring possibilistic uncertainty in CBR, Fuzzy Sets and Systems, 160:2, (214-230), Online publication date: 15-Jan-2009.
- Golynski A Cell probe lower bounds for succinct data structures Proceedings of the twentieth annual ACM-SIAM symposium on Discrete algorithms, (625-634)
- Matsubara W, Inenaga S and Shinohara A Testing square-freeness of strings compressed by balanced straight line program Proceedings of the Fifteenth Australasian Symposium on Computing: The Australasian Theory - Volume 94, (21-30)
- Balsim I, Eckhardt R, Feder E, Jahangir S and Yarmish G (2009). The pervasive applications of computer science in biomedicine, Journal of Computing Sciences in Colleges, 24:3, (11-18), Online publication date: 1-Jan-2009.
- Mikulski Ł (2009). Transposition Rearrangement, Annales UMCS, Informatica, 9:1, (7-13), Online publication date: 1-Jan-2009.
- Dürr P, Karlen W, Guignard J, Mattiussi C and Floreano D (2009). Evolutionary selection of features for neural sleep/wake discrimination, Journal of Artificial Evolution and Applications, 2009:S1, (1-9), Online publication date: 1-Jan-2009.
- Bar-Yossef Z, Keidar I and Schonfeld U (2009). Do not crawl in the DUST, ACM Transactions on the Web, 3:1, (1-31), Online publication date: 1-Jan-2009.
- Budalakoti S, Srivastava A and Otey M (2009). Anomaly detection and diagnosis algorithms for discrete symbol sequences with applications to airline safety, IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews, 39:1, (101-113), Online publication date: 1-Jan-2009.
- Shyu S and Tsai C (2009). Finding the longest common subsequence for multiple biological sequences by ant colony optimization, Computers and Operations Research, 36:1, (73-91), Online publication date: 1-Jan-2009.
- Tiskin A (2008). Semi-local longest common subsequences in subquadratic time, Journal of Discrete Algorithms, 6:4, (570-581), Online publication date: 1-Dec-2008.
- Perona I, Gurrutxaga I, Arbelaitz O, Martín J, Muguerza J and Pérez J Service-independent payload analysis to improve intrusion detection in network traffic Proceedings of the 7th Australasian Data Mining Conference - Volume 87, (171-178)
- Gurrutxaga I, Arbelaitz O, Pérez J, Muguerza J, Martín J and Perona I Evaluation of malware clustering based on its dynamic behaviour Proceedings of the 7th Australasian Data Mining Conference - Volume 87, (163-170)
- Wang C, Lu J and Zhang G An ontology data matching method for web information integration Proceedings of the 10th International Conference on Information Integration and Web-based Applications & Services, (208-213)
- Chen X, Liu L, Liu Z and Jiang T (2008). On the minimum common integer partition problem, ACM Transactions on Algorithms, 5:1, (1-18), Online publication date: 1-Nov-2008.
- 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.
- Amjad H (2008). Data Compression for Proof Replay, Journal of Automated Reasoning, 41:3-4, (193-218), Online publication date: 1-Nov-2008.
- Zurutuza U, Uribeetxeberria R and Zamboni D A data mining approach for analysis of worm activity through automatic signature generation Proceedings of the 1st ACM workshop on Workshop on AISec, (61-70)
- Barsky M, Stege U, Thomo A and Upton C A new method for indexing genomes using on-disk suffix trees Proceedings of the 17th ACM conference on Information and knowledge management, (649-658)
- Cooper K, Eckhardt J and Kennedy K Redundancy elimination revisited Proceedings of the 17th international conference on Parallel architectures and compilation techniques, (12-21)
- Kim E and Kececioglu J (2008). Learning Scoring Schemes for Sequence Alignment from Partial Examples, IEEE/ACM Transactions on Computational Biology and Bioinformatics, 5:4, (546-556), Online publication date: 1-Oct-2008.
- Mantaci R, Mantaci S and Restivo A Balance Properties and Distribution of Squares in Circular Words Proceedings of the 12th international conference on Developments in Language Theory, (504-515)
- Huson D and Rupp R Summarizing Multiple Gene Trees Using Cluster Networks Proceedings of the 8th international workshop on Algorithms in Bioinformatics, (296-305)
- Menolascina F, Bevilacqua V, Ciminelli C, Armenise M and Mastronardi G A Multi-objective Genetic Algorithm Based Approach to the Optimization of Oligonucleotide Microarray Production Process Proceedings of the 4th international conference on Intelligent Computing: Advanced Intelligent Computing Theories and Applications - with Aspects of Artificial Intelligence, (1039-1046)
- 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.
- Xiao C, Wang W and Lin X (2008). Ed-Join, Proceedings of the VLDB Endowment, 1:1, (933-944), Online publication date: 1-Aug-2008.
- Wensch J, Gerisch A and Posch S (2008). Optimised coupling of hierarchies in image registration, Image and Vision Computing, 26:7, (1000-1011), Online publication date: 1-Jul-2008.
- Flener P and Pearson J Solving Necklace Constraint Problems Proceedings of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence, (520-524)
- Tidemann A and Demiris Y Groovy Neural Networks Proceedings of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence, (271-275)
- Huang G, Liu J and Wang Y Sequence Alignment Algorithms for Run-Length-Encoded Strings Proceedings of the 14th annual international conference on Computing and Combinatorics, (319-330)
- Lin Y Efficient Algorithms for SNP Haplotype Block Selection Problems Proceedings of the 14th annual international conference on Computing and Combinatorics, (309-318)
- Condon A, Maňuch J and Thachuk C Complexity of a Collision-Aware String Partition Problem and Its Relation to Oligo Design for Gene Synthesis Proceedings of the 14th annual international conference on Computing and Combinatorics, (265-275)
- Kolpakov R and Kucherov G Searching for Gapped Palindromes Proceedings of the 19th annual symposium on Combinatorial Pattern Matching, (18-30)
- Russo L, Navarro G and Oliveira A Dynamic Fully-Compressed Suffix Trees Proceedings of the 19th annual symposium on Combinatorial Pattern Matching, (191-203)
- Fischer J, Mäkinen V and Navarro G An(other) Entropy-Bounded Compressed Suffix Tree Proceedings of the 19th annual symposium on Combinatorial Pattern Matching, (152-165)
- 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)
- Babenko M and Starikovskaya T Computing longest common substrings via suffix arrays Proceedings of the 3rd international conference on Computer science: theory and applications, (64-75)
- Becerra-Bonache L, de la Higuera C, Janodet J and Tantini F (2008). Learning Balls of Strings from Edit Corrections, The Journal of Machine Learning Research, 9, (1841-1870), Online publication date: 1-Jun-2008.
- 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.
- Barsky M, Stege U, Thomo A and Upton C (2008). A graph approach to the threshold all-against-all substring matching problem, ACM Journal of Experimental Algorithmics, 12, (1-26), Online publication date: 1-Jun-2008.
- Navarro G and Reyes N (2008). Dynamic spatial approximation trees, ACM Journal of Experimental Algorithmics, 12, (1-68), Online publication date: 1-Jun-2008.
- Rusu I (2008). Converting suffix trees into factor/suffix oracles, Journal of Discrete Algorithms, 6:2, (324-340), Online publication date: 1-Jun-2008.
- Moore N and Prosser P (2008). The ultrametric constraint and its application to phylogenetics, Journal of Artificial Intelligence Research, 32:1, (901-938), Online publication date: 1-May-2008.
- Arslan A (2008). An algorithm with linear expected running time for string editing with substitutions and substring reversals, Information Processing Letters, 106:5, (213-218), Online publication date: 1-May-2008.
- Fu B, Kao M and Wang L Efficient algorithms for model-based motif discovery from multiple sequences Proceedings of the 5th international conference on Theory and applications of models of computation, (234-245)
- 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.
- Iliopoulos C and Sohel Rahman M (2008). Algorithms for computing variants of the longest common subsequence problem, Theoretical Computer Science, 395:2-3, (255-267), Online publication date: 20-Apr-2008.
- Kim J, Amir A, Landau G and Park K (2008). Computing similarity of run-length encoded strings with affine gap penalty, Theoretical Computer Science, 395:2-3, (268-282), Online publication date: 20-Apr-2008.
- Russo L, Navarro G and Oliveira A Fully-compressed suffix trees Proceedings of the 8th Latin American conference on Theoretical informatics, (362-373)
- Park G, Hwang H, Nicodème P and Szpankowski W Profile of tries Proceedings of the 8th Latin American conference on Theoretical informatics, (1-11)
- van Iersel L, Keijsper J, Kelk S and Stougie L (2008). Shorelines of Islands of Tractability, IEEE/ACM Transactions on Computational Biology and Bioinformatics, 5:2, (301-312), Online publication date: 1-Apr-2008.
- Batista R, Boukerche A and de Melo A (2008). A parallel strategy for biological sequence alignment in restricted memory space, Journal of Parallel and Distributed Computing, 68:4, (548-561), Online publication date: 1-Apr-2008.
- 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)
- Gudmundsson J, Levcopoulos C, Narasimhan G and Smid M (2008). Approximate distance oracles for geometric spanners, ACM Transactions on Algorithms, 4:1, (1-34), Online publication date: 1-Mar-2008.
- Biçici E Context-based sentence alignment in parallel corpora Proceedings of the 9th international conference on Computational linguistics and intelligent text processing, (434-444)
- Iliopoulos C and Rahman M Indexing circular patterns Proceedings of the 2nd international conference on Algorithms and computation, (46-57)
- 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.
- 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.
- 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.
- Barzuza T, Beckmann J, Shamir R and Pe'er I (2008). Computational Problems in Perfect Phylogeny Haplotyping, IEEE/ACM Transactions on Computational Biology and Bioinformatics, 5:1, (101-109), Online publication date: 1-Jan-2008.
- Boukerche A, Correa J, de Melo A, Jacobi R and Rocha A An FPGA-based accelerator for multiple biological sequence alignment with DIALIGN Proceedings of the 14th international conference on High performance computing, (71-82)
- Di Gesù V Data analysis and bioinformatics Proceedings of the 2nd international conference on Pattern recognition and machine intelligence, (373-388)
- 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)
- Rasheed F, Alshalalfa M and Alhajj R Adapting machine learning technique for periodicity detection in nucleosomal locations in sequences Proceedings of the 8th international conference on Intelligent data engineering and automated learning, (870-879)
- Galassi U, Botta M and Giordana A (2007). Hierarchical Hidden Markov Models for User/Process Profile Learning, Fundamenta Informaticae, 78:4, (487-505), Online publication date: 1-Dec-2007.
- Galassi U, Botta M and Giordana A (2007). Hierarchical Hidden Markov Models for User/Process Profile Learning, Fundamenta Informaticae, 78:4, (487-505), Online publication date: 1-Dec-2007.
- Maaí M and Nowak J (2007). Text indexing with errors, Journal of Discrete Algorithms, 5:4, (662-681), Online publication date: 1-Dec-2007.
- Giancarlo R, Restivo A and Sciortino M (2007). From first principles to the Burrows and Wheeler transform and beyond, via combinatorial optimization, Theoretical Computer Science, 387:3, (236-248), Online publication date: 20-Nov-2007.
- Gao Q, Qin F and Panda D DMTracker Proceedings of the 2007 ACM/IEEE conference on Supercomputing, (1-12)
- Janson S and Szpankowski W (2007). Partial fillup and search time in LC tries, ACM Transactions on Algorithms, 3:4, (44-es), Online publication date: 1-Nov-2007.
- 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.
- Shibuya T Prefix-shuffled geometric suffix tree Proceedings of the 14th international conference on String processing and information retrieval, (300-309)
- Makris C, Panagis Y, Theodoridis E and Tsakalidis A A web-page usage prediction scheme using weighted suffix trees Proceedings of the 14th international conference on String processing and information retrieval, (242-253)
- Allali J, Ferraro P, Hanna P and Iliopoulos C Local transpositions in alignment of polyphonic musical sequences Proceedings of the 14th international conference on String processing and information retrieval, (26-38)
- Yang C, Guo Y, Sawhney H and Kumar R Learning actions using robust string kernels Proceedings of the 2nd conference on Human motion: understanding, modeling, capture and animation, (313-327)
- Blum C and Mastrolilli M Using branch & bound concepts in construction-based metaheuristics Proceedings of the 4th international conference on Hybrid metaheuristics, (123-139)
- Bereg S and Zhang Y (2007). Phylogenetic Networks Based on the Molecular Clock Hypothesis, IEEE/ACM Transactions on Computational Biology and Bioinformatics, 4:4, (661-667), Online publication date: 1-Oct-2007.
- Sridhar S, Dhamdhere K, Blelloch G, Halperin E, Ravi R and Schwartz R (2007). Algorithms for Efficient Near-Perfect Phylogenetic Tree Reconstruction in Theory and Practice, IEEE/ACM Transactions on Computational Biology and Bioinformatics, 4:4, (561-571), Online publication date: 1-Oct-2007.
- Epifanio C, Gabriele A, Mignosi F, Restivo A and Sciortino M (2007). Languages with mismatches, Theoretical Computer Science, 385:1-3, (152-166), Online publication date: 1-Oct-2007.
- Chen K and Chao K (2007). On the range maximum-sum segment query problem, Discrete Applied Mathematics, 155:16, (2043-2052), Online publication date: 1-Oct-2007.
- Robine M, Hanna P and Ferraro P Music similarity Proceedings of the international workshop on Workshop on multimedia information retrieval, (135-142)
- Suyoto I, Uitdenbogerd A and Scholer F Effective retrieval of polyphonic audio with polyphonic symbolic queries Proceedings of the international workshop on Workshop on multimedia information retrieval, (105-114)
- Lee H, Ng R and Shim K Extending q-grams to estimate selectivity of string matching with low edit distance Proceedings of the 33rd international conference on Very large data bases, (195-206)
- Blum C and Blesa M Probabilistic beam search for the longest common subsequence problem Proceedings of the 2007 international conference on Engineering stochastic local search algorithms: designing, implementing and analyzing effective heuristics, (150-161)
- Yu K, Zhou J, Lin C and Tang C 3-Points relationship based parallel algorithm for minimum ultrametric tree construction Proceedings of the 9th international conference on Parallel Computing Technologies, (615-622)
- 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)
- Günay A and Yolum P Structural and semantic similarity metrics for web service matchmaking Proceedings of the 8th international conference on E-commerce and web technologies, (129-138)
- Sun Z, Mahmud J, Ramakrishnan I and Mukherjee S (2007). Model-directed Web transactions under constrained modalities, ACM Transactions on the Web, 1:3, (12-es), Online publication date: 1-Sep-2007.
- Martínez-Arellano G and Brizuela C Comparison of simple encoding schemes in GA's for the motif finding problem Proceedings of the 2nd Brazilian conference on Advances in bioinformatics and computational biology, (22-33)
- Choi C, Kang J and Choi J Extraction of user-defined data blocks using the regularity of dynamic web pages Proceedings of the intelligent computing 3rd international conference on Advanced intelligent computing theories and applications, (123-133)
- Biçici E Local context selection for aligning sentences in parallel corpora Proceedings of the 6th international and interdisciplinary conference on Modeling and using context, (82-93)
- Althaus E and Canzar S A lagrangian relaxation approach for the multiple sequence alignment problem Proceedings of the 1st international conference on Combinatorial optimization and applications, (267-278)
- 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)
- Aggarwal C and Yu P On string classification in data streams Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining, (36-45)
- Tan G, Xu L, Dai Z, Feng S and Sun N (2007). A Study of Architectural Optimization Methods in Bioinformatics Applications, International Journal of High Performance Computing Applications, 21:3, (371-384), Online publication date: 1-Aug-2007.
- Chen H and Li S (2007). Exploring many-to-one speech-to-text correlation for web-based language learning, ACM Transactions on Multimedia Computing, Communications, and Applications, 3:3, (13-es), Online publication date: 1-Aug-2007.
- Schaeffer S (2007). Survey, Computer Science Review, 1:1, (27-64), Online publication date: 1-Aug-2007.
- Ledergerber C and Dessimoz C Alignments with non-overlapping moves, inversions and tandem duplications in O(n4) time Proceedings of the 13th annual international conference on Computing and Combinatorics, (151-164)
- Gusfield D, Frid Y and Brown D Integer programming formulations and computations solving phylogenetic and population genetic problems with missing or genotypic data Proceedings of the 13th annual international conference on Computing and Combinatorics, (51-64)
- Mohri M, Moreno P and Weinstein E Factor automata of automata and applications Proceedings of the 12th international conference on Implementation and application of automata, (168-179)
- Crochemore M, Epifanio C, Gabriele A and Mignosi F On the suffix automaton with mismatches Proceedings of the 12th international conference on Implementation and application of automata, (144-156)
- Franceschini G and Muthukrishnan S In-place suffix sorting Proceedings of the 34th international conference on Automata, Languages and Programming, (533-545)
- Demaine E, Mozes S, Rossman B and Weimann O An optimal decomposition algorithm for tree edit distance Proceedings of the 34th international conference on Automata, Languages and Programming, (146-157)
- 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)
- Ferragina P and Fischer J Suffix arrays on words Proceedings of the 18th annual conference on Combinatorial Pattern Matching, (328-339)
- Amir A, Fischer J and Lewenstein M Two-dimensional range minimum queries Proceedings of the 18th annual conference on Combinatorial Pattern Matching, (286-294)
- Feng W, Wang Z and Wang L Identification of distinguishing motifs Proceedings of the 18th annual conference on Combinatorial Pattern Matching, (253-264)
- Hunt E Exhaustive peptide searching using relations Proceedings of the 24th British national conference on Databases, (13-24)
- Wong L Manifestation and exploitation of invariants in bioinformatics Proceedings of the 2nd international conference on Algebraic biology, (365-377)
- Suzuki S and Ibaraki T (2007). The complexity of assigning genotypes to people in a pedigree consistently, Discrete Mathematics, 307:16, (2122-2131), Online publication date: 1-Jul-2007.
- Rose Y, Hedlund G, Byrne R, Wareham T and MacWhinney B Phon 1.2 Proceedings of the Workshop on Cognitive Aspects of Computational Language Acquisition, (17-24)
- Nerbonne J, Ellison T and Kondrak G Computing and historical phonology Proceedings of Ninth Meeting of the ACL Special Interest Group in Computational Morphology and Phonology, (1-5)
- Wang C, Lu J and Zhang G Generation and matching of ontology data for the semantic web in a peer-to-peer framework Proceedings of the joint 9th Asia-Pacific web and 8th international conference on web-age information management conference on Advances in data and web management, (136-143)
- Stiefmeier T, Roggen D and Tröster G Gestures are strings Proceedings of the ICST 2nd international conference on Body area networks, (1-8)
- Chandel A, Hassanzadeh O, Koudas N, Sadoghi M and Srivastava D Benchmarking declarative approximate selection predicates Proceedings of the 2007 ACM SIGMOD international conference on Management of data, (353-364)
- Välimäki N, Gerlach W, Dixit K and Mäkinen V Engineering a compressed suffix tree implementation Proceedings of the 6th international conference on Experimental algorithms, (217-228)
- Mörchen F (2007). Unsupervised pattern mining from symbolic temporal data, ACM SIGKDD Explorations Newsletter, 9:1, (41-55), Online publication date: 1-Jun-2007.
- Ferraro P and Hanna P Optimizations of local edition for evaluating similarity between monophonic musical sequences Large Scale Semantic Access to Content (Text, Image, Video, and Sound), (64-69)
- Won J, Hong S, Yoon J, Park S and Kim S A practical method for approximate subsequence search in DNA databases Proceedings of the 11th Pacific-Asia conference on Advances in knowledge discovery and data mining, (921-931)
- Wu B, Wang H, Ta Kuan S and Chao K (2007). On the uniform edge-partition of a tree, Discrete Applied Mathematics, 155:10, (1213-1223), Online publication date: 21-May-2007.
- Sundaresan N, Ganesan K and Grandhi R Multi-factor clustering for a marketplace search interface Proceedings of the 16th international conference on World Wide Web, (1181-1182)
- Gligorov R, ten Kate W, Aleksovski Z and van Harmelen F Using Google distance to weight approximate ontology matches Proceedings of the 16th international conference on World Wide Web, (767-776)
- Bar-Yossef Z, Keidar I and Schonfeld U Do not crawl in the dust Proceedings of the 16th international conference on World Wide Web, (111-120)
- Wu S and Li J Comparative analysis of gene-coexpression networks across species Proceedings of the 3rd international conference on Bioinformatics research and applications, (615-626)
- Balla S and Rajasekaran S Space and time efficient algorithms to discover endogenous RNAi patterns in complete genome data Proceedings of the 3rd international conference on Bioinformatics research and applications, (260-269)
- 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.
- Navarro G and Mäkinen V (2007). Compressed full-text indexes, ACM Computing Surveys, 39:1, (2-es), Online publication date: 12-Apr-2007.
- SutcLiffe P, Solomon A and Edwards J Finding the population variance of costs over the solution space of the TSP in polynomial time Proceedings of the 11th WSEAS International Conference on Applied Mathematics, (23-28)
- 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)
- Adjeroh D, Kandaswamy U, Zhang N, Mukherjee A, Brown M and Bell T BWT-based efficient shape matching Proceedings of the 2007 ACM symposium on Applied computing, (1079-1085)
- Herbordt M, VanCourt T, Gu Y, Sukhwani B, Conti A, Model J and DiSabello D (2007). Achieving High Performance with FPGA-Based Computing, Computer, 40:3, (50-57), Online publication date: 1-Mar-2007.
- Van Court T and Herbordt M (2007). Families of FPGA-based accelerators for approximate string matching, Microprocessors & Microsystems, 31:2, (135-145), Online publication date: 1-Mar-2007.
- Ferré S The efficient computation of complete and concise substring scales with suffix trees Proceedings of the 5th international conference on Formal concept analysis, (98-113)
- Wong T and Lam W (2007). Adapting Web information extraction knowledge via mining site-invariant and site-dependent features, ACM Transactions on Internet Technology, 7:1, (6-es), Online publication date: 1-Feb-2007.
- Ciriani V, Ferragina P, Luccio F and Muthukrishnan S (2007). A data structure for a sequence of string accesses in external memory, ACM Transactions on Algorithms, 3:1, (1-23), Online publication date: 1-Feb-2007.
- Cormode G and Muthukrishnan S (2007). The string edit distance matching problem with moves, ACM Transactions on Algorithms, 3:1, (1-19), Online publication date: 1-Feb-2007.
- Kim J and Park K (2007). An efficient alignment algorithm for masked sequences, Theoretical Computer Science, 370:1-3, (19-33), Online publication date: 1-Feb-2007.
- Nicolas F and Rivals E (2007). Longest common subsequence problem for unoriented and cyclic strings, Theoretical Computer Science, 370:1-3, (1-18), Online publication date: 1-Feb-2007.
- 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)
- 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)
- Gopalan P, Jayram T, Krauthgamer R and Kumar R Estimating the sortedness of a data stream Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms, (318-327)
- Galassi U, Giordana A and Saitta L Incremental construction of structured hidden Markov models Proceedings of the 20th international joint conference on Artifical intelligence, (798-803)
- Wu G, You J and Lin G (2007). Quartet-Based Phylogeny Reconstruction with Answer Set Programming, IEEE/ACM Transactions on Computational Biology and Bioinformatics, 4:1, (139-152), Online publication date: 1-Jan-2007.
- Clark A (2007). Learning deterministic context free grammars, Machine Language, 66:1, (93-110), Online publication date: 1-Jan-2007.
- Wang C, Lu J and Zhang G Integration of Ontology Data through Learning Instance Matching Proceedings of the 2006 IEEE/WIC/ACM International Conference on Web Intelligence, (536-539)
- Maruyama S, Miyagawa H and Sakamoto H Improving time and space complexity for compressed pattern matching Proceedings of the 17th international conference on Algorithms and Computation, (484-493)
- Kelarev A, Kang B and Steane D Clustering algorithms for ITS sequence data with alignment metrics Proceedings of the 19th Australian joint conference on Artificial Intelligence: advances in Artificial Intelligence, (1027-1031)
- Chen C and Schmidt B (2006). Constructing large suffix trees on a computational grid, Journal of Parallel and Distributed Computing, 66:12, (1512-1523), Online publication date: 1-Dec-2006.
- Fredriksson K and Mozgovoy M (2006). Efficient parameterized string matching, Information Processing Letters, 100:3, (91-96), Online publication date: 15-Nov-2006.
- Blazewicz J, Oguz C, Swiercz A and Weglarz J (2006). DNA Sequencing by Hybridization via Genetic Search, Operations Research, 54:6, (1185-1192), Online publication date: 1-Nov-2006.
- 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.
- Bernstein Y and Zobel J (2006). Accurate discovery of co-derivative documents via duplicate text detection, Information Systems, 31:7, (595-609), Online publication date: 1-Nov-2006.
- Dehmer M, Emmert-Streib F and Kilian J (2006). A similarity measure for graphs with low computational complexity, Applied Mathematics and Computation, 182:1, (447-459), Online publication date: 1-Nov-2006.
- Tan G, Xu L, Bu D, Feng S and Sun N (2006). Improvement of performance of MegaBlast algorithm for DNA sequence alignment, Journal of Computer Science and Technology, 21:6, (973-978), Online publication date: 1-Nov-2006.
- Hamid R, Maddi S, Bobick A and Essa I Unsupervised analysis of activity sequences using event-motifs Proceedings of the 4th ACM international workshop on Video surveillance and sensor networks, (71-78)
- Kreibich C and Crowcroft J Efficient sequence alignment of network traffic Proceedings of the 6th ACM SIGCOMM conference on Internet measurement, (307-312)
- Leung H, Peng Z and Ting H (2006). An efficient algorithm for online square detection, Theoretical Computer Science, 363:1, (69-75), Online publication date: 25-Oct-2006.
- Brlek S and Provençal X An optimal algorithm for detecting pseudo-squares Proceedings of the 13th international conference on Discrete Geometry for Computer Imagery, (403-412)
- Crochemore M, Iliopoulos C, Mohamed M and Sagot M (2006). Longest repeats with a block of k don't cares, Theoretical Computer Science, 362:1, (248-254), Online publication date: 11-Oct-2006.
- Hong J and Chen G On-Line repetition detection Proceedings of the 13th international conference on String Processing and Information Retrieval, (74-85)
- Inenaga S and Takeda M Sparse directed acyclic word graphs Proceedings of the 13th international conference on String Processing and Information Retrieval, (61-73)
- Barsky M, Stege U, Thomo A and Upton C A new algorithm for fast all-against-all substring matching Proceedings of the 13th international conference on String Processing and Information Retrieval, (360-366)
- 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)
- Russo L and Oliveira A A compressed self-index using a ziv-lempel dictionary Proceedings of the 13th international conference on String Processing and Information Retrieval, (163-180)
- Aleksovski Z, Klein M, ten Kate W and van Harmelen F Matching unstructured vocabularies using a background ontology Proceedings of the 15th international conference on Managing Knowledge in a World of Networks, (182-197)
- Yuan C, Lao N, Wen J, Li J, Zhang Z, Wang Y and Ma W (2006). Automated known problem diagnosis with event traces, ACM SIGOPS Operating Systems Review, 40:4, (375-388), Online publication date: 1-Oct-2006.
- 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.
- Bilu Y, Agarwal P and Kolodny R (2006). Faster Algorithms for Optimal Multiple Sequence Alignment Based on Pairwise Comparisons, IEEE/ACM Transactions on Computational Biology and Bioinformatics, 3:4, (408-422), Online publication date: 1-Oct-2006.
- Pampapathi R, Mirkin B and Levene M (2006). A suffix tree approach to anti-spam email filtering, Machine Language, 65:1, (309-338), Online publication date: 1-Oct-2006.
- Ma T, Lyuu Y and Ti Y An efficient algorithm for finding long conserved regions between genes Proceedings of the Second international conference on Computational Life Sciences, (42-51)
- Sim J and Park S Transcription factor binding sites prediction based on sequence similarity Proceedings of the Third international conference on Fuzzy Systems and Knowledge Discovery, (1058-1061)
- Parida L A PQ framework for reconstructions of common ancestors and phylogeny Proceedings of the RECOMB 2006 international conference on Comparative Genomics, (141-155)
- Clark A Large scale inference of deterministic transductions Proceedings of the 8th international conference on Grammatical Inference: algorithms and applications, (227-239)
- Sinha S, Jahanian F and Patel J WIND Proceedings of the 9th international conference on Recent Advances in Intrusion Detection, (290-310)
- van Iersel L, Keijsper J, Kelk S and Stougie L Beaches of islands of tractability Proceedings of the 6th international conference on Algorithms in Bioinformatics, (80-91)
- Ye J, Ilinkin I, Janardan R and Isom A Multiple structure alignment and consensus identification for proteins Proceedings of the 6th international conference on Algorithms in Bioinformatics, (115-125)
- 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)
- Steffen P and Giegerich R (2006). Table design in dynamic programming, Information and Computation, 204:9, (1325-1345), Online publication date: 1-Sep-2006.
- Lifshits Y and Lohrey M Querying and embedding compressed texts Proceedings of the 31st international conference on Mathematical Foundations of Computer Science, (681-692)
- Bose A, Beemanapalli K, Srivastava J and Sahar S Incorporating concept hierarchies into usage mining based recommendations Proceedings of the 8th Knowledge discovery on the web international conference on Advances in web mining and web usage analysis, (110-126)
- Zhang D and Lee W Extracting key-substring-group features for text classification Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining, (474-483)
- Fici G, Mignosi F, Restivo A and Sciortino M (2006). Word assembly through minimal forbidden words, Theoretical Computer Science, 359:1, (214-230), Online publication date: 14-Aug-2006.
- Kang B, Kelarev A, Sale A and Williams R A new model for classifying DNA code inspired by neural networks and FSA Proceedings of the 9th Pacific Rim Knowledge Acquisition international conference on Advances in Knowledge Acquisition and Management, (187-198)
- 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.
- 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.
- Gupta R, Mittal A and Gupta S (2006). An efficient algorithm to detect palindromes in DNA sequences using periodicity transform, Signal Processing, 86:8, (2067-2073), Online publication date: 1-Aug-2006.
- Blelloch G, Dhamdhere K, Halperin E, Ravi R, Schwartz R and Sridhar S Fixed parameter tractability of binary near-perfect phylogenetic tree reconstruction Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I, (667-678)
- Böckenhauer H, Hromkovič J, Kneis J and Kupke J On the approximation hardness of some generalizations of TSP Proceedings of the 10th Scandinavian conference on Algorithm Theory, (184-195)
- Kaplan H, Porat E and Shafrir N Finding the position of the k-mismatch and approximate tandem repeats Proceedings of the 10th Scandinavian conference on Algorithm Theory, (90-101)
- Shibuya T Geometric suffix tree Proceedings of the 17th Annual conference on Combinatorial Pattern Matching, (84-93)
- 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)
- Fischer J and Heun V Theoretical and practical improvements on the RMQ-Problem, with applications to LCA and LCE Proceedings of the 17th Annual conference on Combinatorial Pattern Matching, (36-48)
- Backofen R, Hermelin D, Landau G and Weimann O Local alignment of RNA sequences with arbitrary scoring schemes Proceedings of the 17th Annual conference on Combinatorial Pattern Matching, (246-257)
- Teo C and Vishwanathan S Fast and space efficient string kernels using suffix arrays Proceedings of the 23rd international conference on Machine learning, (929-936)
- Jiang M Subsequence packing Proceedings of the Second international conference on Algorithmic Aspects in Information and Management, (314-323)
- Wang D, Wang G, Wu Q, Chen B and Zhao Y A new method for finding approximate repetitions in DNA sequences Proceedings of the 7th international conference on Advances in Web-Age Information Management, (397-409)
- Hendrickson B and Pothen A Combinatorial scientific computing Proceedings of the 7th international conference on High performance computing for computational science, (260-280)
- Zheleva E and Arslan A Fast motif search in protein sequence databases Proceedings of the First international computer science conference on Theory and Applications, (670-681)
- Tiskin A All semi-local longest common subsequences in subquadratic time Proceedings of the First international computer science conference on Theory and Applications, (352-363)
- Chew L Exact computation of protein structure similarity Proceedings of the twenty-second annual symposium on Computational geometry, (468-474)
- Chen X, Liu L, Liu Z and Jiang T On the minimum common integer partition problem Proceedings of the 6th Italian conference on Algorithms and Complexity, (236-247)
- Sridhar S, Dhamdhere K, Blelloch G, Halperin E, Ravi R and Schwartz R Simple reconstruction of binary near-perfect phylogenetic trees Proceedings of the 6th international conference on Computational Science - Volume Part II, (799-806)
- Goan T, Fujioka E, Kaneshiro R and Gasch L Identifying information provenance in support of intelligence analysis, sharing, and protection Proceedings of the 4th IEEE international conference on Intelligence and Security Informatics, (692-693)
- Stein B and Curatolo D Phonetic Spelling and Heuristic Search Proceedings of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy, (829-830)
- Zhang M, Tang J, Guo D, Hu L and Li Q Succinct text indexes on large alphabet Proceedings of the Third international conference on Theory and Applications of Models of Computation, (528-537)
- Semé D A CGM algorithm solving the longest increasing subsequence problem Proceedings of the 2006 international conference on Computational Science and Its Applications - Volume Part V, (10-21)
- Chen Y and Tang C The bottleneck tree alignment problems Proceedings of the 2006 international conference on Computational Science and Its Applications - Volume Part III, (631-637)
- Tan G, Xu L, Feng S and Sun N An experimental study of optimizing bioinformatics applications Proceedings of the 20th international conference on Parallel and distributed processing, (256-256)
- Giegerich R and Steffen P Challenges in the compilation of a domain specific language for dynamic programming Proceedings of the 2006 ACM symposium on Applied computing, (1603-1609)
- Sousa M and Melo A PackageBLAST Proceedings of the 2006 ACM symposium on Applied computing, (156-160)
- Fassetti F, Greco G and Terracina G Efficient discovery of loosely structured motifs in biological data Proceedings of the 2006 ACM symposium on Applied computing, (151-155)
- Yuan C, Lao N, Wen J, Li J, Zhang Z, Wang Y and Ma W Automated known problem diagnosis with event traces Proceedings of the 1st ACM SIGOPS/EuroSys European Conference on Computer Systems 2006, (375-388)
- Efremides O and Ivanov G A fault-tolerant parallel text searching technique on a cluster of workstations Proceedings of the 5th WSEAS international conference on Applied computer science, (368-373)
- Porto A and Barbosa V Multiple sequence alignment based on set covers Proceedings of the 2006 international conference on Applications of Evolutionary Computing, (127-137)
- Freschi V, Seraghiti A and Bogliolo A Filtering obfuscated email spam by means of phonetic string matching Proceedings of the 28th European conference on Advances in Information Retrieval, (505-509)
- Bernstein Y and Cameron M Fast discovery of similar sequences in large genomic collections Proceedings of the 28th European conference on Advances in Information Retrieval, (432-443)
- Moraglio A, Poli R and Seehuus R Geometric crossover for biological sequences Proceedings of the 9th European conference on Genetic Programming, (121-132)
- Zaïane O, Wang Y, Goebel R and Taylor G Frequent subsequence-based protein localization Proceedings of the 2006 international conference on Data Mining for Biomedical Applications, (35-47)
- Ning K, Chong K and Leong H A database search algorithm for identification of peptides with multiple charges using tandem mass spectrometry Proceedings of the 2006 international conference on Data Mining for Biomedical Applications, (2-13)
- Rappoport A and Levent-Levi T Induction of cross-language affix and letter sequence correspondence Proceedings of the International Workshop on Cross-Language Knowledge Induction, (17-24)
- 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)
- Cameron M, Bernstein Y and Williams H Clustering near-identical sequences for fast homology search Proceedings of the 10th annual international conference on Research in Computational Molecular Biology, (175-189)
- Chen D, Eulenstein O, Fernandez-Baca D and Sanderson M (2006). Minimum-Flip Supertrees, IEEE/ACM Transactions on Computational Biology and Bioinformatics, 3:2, (165-173), Online publication date: 1-Apr-2006.
- 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.
- Dai H and Su H A parallel algorithm for finding all successive minimal maximum subsequences Proceedings of the 7th Latin American conference on Theoretical Informatics, (337-348)
- Arslan A Efficient approximate dictionary look-up for long words over small alphabets Proceedings of the 7th Latin American conference on Theoretical Informatics, (118-129)
- Araújo E and Soares J Scoring matrices that induce metrics on sequences Proceedings of the 7th Latin American conference on Theoretical Informatics, (68-79)
- Tairas R and Gray J Phoenix-based clone detection using suffix trees Proceedings of the 44th annual Southeast regional conference, (679-684)
- Kondi S and Dandass Y Scanning workstation memory for malicious codes using dedicated coprocessors Proceedings of the 44th annual Southeast regional conference, (661-666)
- Chen W An efficient hybrid clustering algorithm for molecular sequences classification Proceedings of the 44th annual Southeast regional conference, (428-433)
- 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.
- 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.
- Dal Palú A, Pontelli E and Ranjan D (2006). Sequential and parallel algorithms for the NCA problem on pure pointer machines, Theoretical Computer Science, 352:1, (108-135), Online publication date: 7-Mar-2006.
- 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.
- Guha S, Jagadish H, Koudas N, Srivastava D and Yu T (2006). Integrating XML data sources using approximate joins, ACM Transactions on Database Systems, 31:1, (161-207), Online publication date: 1-Mar-2006.
- Chan S Shallow case role annotation using two-stage feature-enhanced string matching Proceedings of the 7th international conference on Computational Linguistics and Intelligent Text Processing, (263-274)
- Brodal G and Fagerberg R Cache-oblivious string dictionaries Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm, (581-590)
- Wang J, Uchino K, Takahashi T and Okamoto S RSS feed generation from legacy HTML pages Proceedings of the 8th Asia-Pacific Web conference on Frontiers of WWW Research and Development, (1071-1082)
- Gramm J, Guo J and Niedermeier R (2006). Pattern matching for arc-annotated sequences, ACM Transactions on Algorithms, 2:1, (44-65), Online publication date: 1-Jan-2006.
- Jana P and Kumar N Parallel sequence alignment Proceedings of the First international conference on Pattern Recognition and Machine Intelligence, (636-639)
- Arimura H and Uno T A polynomial space and polynomial delay algorithm for enumeration of maximal motifs in a sequence Proceedings of the 16th international conference on Algorithms and Computation, (724-737)
- 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)
- Maaß M and Nowak J (2005). A new method for approximate indexing and dictionarylookup with one error, Information Processing Letters, 96:5, (185-191), Online publication date: 16-Dec-2005.
- Huo H and Ming H Simulated annealing with injecting star-alignment for multiple sequence alignments Proceedings of the 2005 international conference on Computational Intelligence and Security - Volume Part I, (821-826)
- Tan G, Feng S and Sun N Parallel Multiple Sequences Alignment in SMP Cluster Proceedings of the Eighth International Conference on High-Performance Computing in Asia-Pacific Region
- Yu K, Zhou J, Lin C and Tang C Parallel Branch-and-Bound Algorithm for Constructing Evolutionary Trees from Distance Matrix Proceedings of the Eighth International Conference on High-Performance Computing in Asia-Pacific Region
- Fischer J, Heun V and Kramer S Fast Frequent String Mining Using Suffix Arrays Proceedings of the Fifth IEEE International Conference on Data Mining, (609-612)
- Bilenko M, Basu S and Sahami M Adaptive Product Normalization Proceedings of the Fifth IEEE International Conference on Data Mining, (58-65)
- Katsaros D and Manolopoulos Y A suffix tree based prediction scheme for pervasive computing environments Proceedings of the 10th Panhellenic conference on Advances in Informatics, (267-277)
- Herley C Accurate repeat finding and object skipping using fingerprints Proceedings of the 13th annual ACM international conference on Multimedia, (656-665)
- 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)
- Guignon V, Chauve C and Hamel S An edit distance between RNA stem-loops Proceedings of the 12th international conference on String Processing and Information Retrieval, (335-347)
- Kim J, Amir A, Landau G and Park K Computing similarity of run-length encoded strings with affine gap penalty Proceedings of the 12th international conference on String Processing and Information Retrieval, (315-326)
- Peres P and de Moura E Application of clustering technique in multiple sequence alignment Proceedings of the 12th international conference on String Processing and Information Retrieval, (202-205)
- Angelov S and Inenaga S Composite pattern discovery for PCR application Proceedings of the 12th international conference on String Processing and Information Retrieval, (167-178)
- Bialynicka-Birula I and Grossi R Rank-Sensitive data structures Proceedings of the 12th international conference on String Processing and Information Retrieval, (79-90)
- Efraty N and Landau G (2005). Sparse Normalized Local Alignment, Algorithmica, 43:3, (179-194), Online publication date: 1-Nov-2005.
- Simon K and Lausen G ViPER Proceedings of the 14th ACM international conference on Information and knowledge management, (381-388)
- 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)
- 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)
- Kuboyama T, Shin K, Miyahara T and Yasuda H A theoretical analysis of alignment and edit problems for trees Proceedings of the 9th Italian conference on Theoretical Computer Science, (323-337)
- Bannai H, Hatano K, Inenaga S and Takeda M Practical algorithms for pattern based linear regression Proceedings of the 8th international conference on Discovery Science, (44-56)
- Madeira S and Oliveira A A linear time biclustering algorithm for time series gene expression data Proceedings of the 5th International conference on Algorithms in Bioinformatics, (39-52)
- Zhang S, Haas B, Eskin E and Bafna V (2005). Searching Genomes for Noncoding RNA Using FastR, IEEE/ACM Transactions on Computational Biology and Bioinformatics, 2:4, (366-379), Online publication date: 1-Oct-2005.
- Bird R Polymorphic string matching Proceedings of the 2005 ACM SIGPLAN workshop on Haskell, (110-115)
- Krissinel E and Henrick K Multiple alignment of protein structures in three dimensions Proceedings of the First international conference on Computational Life Sciences, (67-78)
- Giordana A, Galassi U and Saitta L Experimental evaluation of hierarchical hidden markov models Proceedings of the 9th conference on Advances in Artificial Intelligence, (249-257)
- Oğul H and Mumcuoğlu Ü Discriminative remote homology detection using maximal unique sequence matches Proceedings of the 6th international conference on Advances in Intelligent Data Analysis, (283-292)
- Wang K, Cretu G and Stolfo S Anomalous payload-based worm detection and signature generation Proceedings of the 8th international conference on Recent Advances in Intrusion Detection, (227-246)
- Yu K, Chang Y, Yang Y, Zhou J, Lin C and Tang C A fast technique for constructing evolutionary tree with the application of compact sets Proceedings of the 8th international conference on Parallel Computing Technologies, (346-354)
- Barzilay R and McKeown K (2019). Sentence fusion for multidocument news summarization, Computational Linguistics, 31:3, (297-328), Online publication date: 1-Sep-2005.
- Besta M and Stomp F (2005). A complete mechanization of correctness of a string-preprocessing algorithm, Formal Methods in System Design, 27:1-2, (5-27), Online publication date: 1-Sep-2005.
- Jin L, Li C, Koudas N and Tung A Indexing mixed types for approximate retrieval Proceedings of the 31st international conference on Very large data bases, (793-804)
- Jin L and Li C Selectivity estimation for fuzzy string predicates in large data sets Proceedings of the 31st international conference on Very large data bases, (397-408)
- Chen C and Schmidt B Parallel construction of large suffix trees on a PC cluster Proceedings of the 11th international Euro-Par conference on Parallel Processing, (1227-1236)
- 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)
- Jagannathan G and Wright R Privacy-preserving distributed k-means clustering over arbitrarily partitioned data Proceedings of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining, (593-599)
- Ishida Y, Inenaga S, Shinohara A and Takeda M Fully incremental LCS computation Proceedings of the 15th international conference on Fundamentals of Computation Theory, (563-574)
- 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)
- Gao F and Zaki M PSIST Proceedings of the 2005 IEEE Computational Systems Bioinformatics Conference, (212-222)
- Mao R, Xu W, Ramakrishnan S, Nuckolls G and Miranker D On Optimizing Distance-Based Similarity Search for Biological Databases Proceedings of the 2005 IEEE Computational Systems Bioinformatics Conference, (351-361)
- Kalyanaraman A and Aluru S Efficient Algorithms and Software for Detection of Full-Length LTR Retrotransposons Proceedings of the 2005 IEEE Computational Systems Bioinformatics Conference, (56-64)
- Berman P, DasGupta B and Kao M (2005). Tight approximability results for test set problems in bioinformatics, Journal of Computer and System Sciences, 71:2, (145-162), Online publication date: 1-Aug-2005.
- Mäkinen V, Navarro G and Ukkonen E (2005). Transposition invariant string matching, Journal of Algorithms, 56:2, (124-153), Online publication date: 1-Aug-2005.
- 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)
- de Castro Miranda R and Ayala-Rincón M A modification of the landau-vishkin algorithm computing longest common extensions via suffix arrays Proceedings of the 2005 Brazilian conference on Advances in Bioinformatics and Computational Biology, (210-213)
- Galassi U and Giordana A Learning regular expressions from noisy sequences Proceedings of the 6th international conference on Abstraction, Reformulation and Approximation, (92-106)
- Zaïane O Relevance of counting in data mining tasks Proceedings of the First international conference on Advanced Data Mining and Applications, (14-18)
- Chen J, Moon Y and Yeung H Palmprint authentication using time series Proceedings of the 5th international conference on Audio- and Video-Based Biometric Person Authentication, (376-385)
- Epifanio C, Gabriele A and Mignosi F Languages with mismatches and an application to approximate indexing Proceedings of the 9th international conference on Developments in Language Theory, (224-235)
- Burger J and Ferro L Generating an entailment corpus from news headlines Proceedings of the ACL Workshop on Empirical Modeling of Semantic Equivalence and Entailment, (49-54)
- McConnell R and de Montgolfier F Algebraic operations on PQ trees and modular decomposition trees Proceedings of the 31st international conference on Graph-Theoretic Concepts in Computer Science, (421-432)
- 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)
- Maaß M and Nowak J Text indexing with errors Proceedings of the 16th annual conference on Combinatorial Pattern Matching, (21-32)
- Chen G, Hong J and Lu H An optimal algorithm for online square detection Proceedings of the 16th annual conference on Combinatorial Pattern Matching, (280-287)
- 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)
- Zhang M, Hu L, Li Q and Ju J Weighted directed word graph Proceedings of the 16th annual conference on Combinatorial Pattern Matching, (156-167)
- Russo L and Oliveira A An efficient algorithm for generating super condensed neighborhoods Proceedings of the 16th annual conference on Combinatorial Pattern Matching, (104-115)
- Ergezer H and Leblebicioğlu K Refining the progressive multiple sequence alignment score using genetic algorithms Proceedings of the 14th Turkish conference on Artificial Intelligence and Neural Networks, (177-184)
- Oğul H and Mumcuoğlu E Protein solvent accessibility prediction using support vector machines and sequence conservations Proceedings of the 14th Turkish conference on Artificial Intelligence and Neural Networks, (141-148)
- Yamamoto T, Matsushita M, Kamiya T and Inoue K Measuring similarity of large software systems based on source code correspondence Proceedings of the 6th international conference on Product Focused Software Process Improvement, (530-544)
- Manthey B and Reischuk R (2005). The intractability of computing the Hamming distance, Theoretical Computer Science, 337:1-3, (331-346), Online publication date: 9-Jun-2005.
- Bille P (2005). A survey on tree edit distance and related problems, Theoretical Computer Science, 337:1-3, (217-239), Online publication date: 9-Jun-2005.
- Mooney R and Bunescu R (2005). Mining knowledge from text using information extraction, ACM SIGKDD Explorations Newsletter, 7:1, (3-10), Online publication date: 1-Jun-2005.
- Bordawekar R and Lang C (2005). Analytical processing of XML documents, ACM SIGMOD Record, 34:2, (27-32), Online publication date: 1-Jun-2005.
- Galassi U, Giordana A, Saitta L and Botta M Learning profiles based on hierarchical hidden markov model Proceedings of the 15th international conference on Foundations of Intelligent Systems, (47-55)
- Chattaraj A and Parida L (2005). An inexact-suffix-tree-based algorithm for detecting extensible patterns, Theoretical Computer Science, 335:1, (3-14), Online publication date: 20-May-2005.
- Gusfield D and Bansal V A fundamental decomposition theory for phylogenetic networks and incompatible characters Proceedings of the 9th Annual international conference on Research in Computational Molecular Biology, (217-232)
- Rasmussen K, Stoye J and Myers E Efficient q-gram filters for finding all ε-matches over a given length Proceedings of the 9th Annual international conference on Research in Computational Molecular Biology, (189-203)
- Sugibuchi T and Tanaka Y Interactive web-wrapper construction for extracting relational information from web documents Special interest tracks and posters of the 14th international conference on World Wide Web, (968-969)
- Zhai Y and Liu B Web data extraction based on partial tree alignment Proceedings of the 14th international conference on World Wide Web, (76-85)
- Park S, Park C, Kim D, Park S and Sim J Protein structure abstractionand automatic clustering using secondary structure element sequences Proceedings of the 2005 international conference on Computational Science and Its Applications - Volume Part II, (1284-1292)
- Gusfield D (2005). Optimal, efficient reconstruction of root-unknown phylogenetic networks with constrained and structured recombination, Journal of Computer and System Sciences, 70:3, (381-398), Online publication date: 1-May-2005.
- Suyoto I and Uitdenbogerd A Effectiveness of note duration information for music retrieval Proceedings of the 10th international conference on Database Systems for Advanced Applications, (265-275)
- Liu N, Wu Y and Chen A An efficient approach to extracting approximate repeating patterns in music databases Proceedings of the 10th international conference on Database Systems for Advanced Applications, (240-252)
- Megalooikonomou V, Wang Q, Li G and Faloutsos C A Multiresolution Symbolic Representation of Time Series Proceedings of the 21st International Conference on Data Engineering, (668-679)
- Muriki K, Underwood K and Sass R RC-BLAST Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 7 - Volume 08
- Michailidis P and Margaritis K (2005). New Processor Array Architectures for the Longest Common Subsequence Problem, The Journal of Supercomputing, 32:1, (51-69), Online publication date: 1-Apr-2005.
- Chen R and Ali H A new approach for gene prediction using comparative sequence analysis Proceedings of the 2005 ACM symposium on Applied computing, (177-184)
- Cohen J (2005). Computer science and bioinformatics, Communications of the ACM, 48:3, (72-78), Online publication date: 1-Mar-2005.
- Aggarwal C and Bradley P (2005). On the Use of Wavelet Decomposition for String Classification, Data Mining and Knowledge Discovery, 10:2, (117-139), Online publication date: 1-Mar-2005.
- Bodirsky M The core of a countably categorical structure Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science, (110-120)
- Sadakane K, Takki-Chebihi N and Tokuyama T (2005). Combinatorics and algorithms for low-discrepancy, roundings of a real sequence, Theoretical Computer Science, 331:1, (23-36), Online publication date: 15-Feb-2005.
- 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.
- Cormode G and Muthukrishnan S Substring compression problems Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms, (321-330)
- Park G and Szpankowski W Towards a complete characterization of tries Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms, (33-42)
- 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)
- Chi Y, Muntz R, Nijssen S and Kok J (2005). Frequent Subtree Mining - An Overview, Fundamenta Informaticae, 66:1-2, (161-198), Online publication date: 1-Jan-2005.
- Anselmo M and Madonia M (2005). A language-theoretic approach to covering problems, Journal of Automata, Languages and Combinatorics, 10:1, (3-24), Online publication date: 1-Jan-2005.
- 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.
- Pisanti N, Crochemore M, Grossi R and Sagot M (2005). Bases of Motifs for Generating Repeated Patterns with Wild Cards, IEEE/ACM Transactions on Computational Biology and Bioinformatics, 2:1, (40-50), Online publication date: 1-Jan-2005.
- Mukherjee A Computational biology – the new frontier of computer science Proceedings of the 6th international conference on Distributed Computing, (204-218)
- Chen K and Chao K On the range maximum-sum segment query problem Proceedings of the 15th international conference on Algorithms and Computation, (294-305)
- Inenaga S, Shinohara A and Takeda M An efficient pattern matching algorithm on a subclass of context free grammars Proceedings of the 8th international conference on Developments in Language Theory, (225-236)
- Chan S Extraction of shallow language patterns Proceedings of the 17th Australian joint conference on Advances in Artificial Intelligence, (574-586)
- Devanbu P, Gertz M, Kwong A, Martel C, Nuckolls G and Stubblebine S (2004). Flexible authentication of XML documents, Journal of Computer Security, 12:6, (841-864), Online publication date: 1-Dec-2004.
- 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.
- 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.
- 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.
- Chi Y, Muntz R, Nijssen S and Kok J (2004). Frequent Subtree Mining - An Overview, Fundamenta Informaticae, 66:1-2, (161-198), Online publication date: 1-Nov-2004.
- Udechukwu A, Barker K and Alhajj R (2004). A framework for representing navigational patterns as full temporal objects, ACM SIGecom Exchanges, 5:2, (23-33), Online publication date: 1-Nov-2004.
- Lu Y and Tan C (2004). Information Retrieval in Document Image Databases, IEEE Transactions on Knowledge and Data Engineering, 16:11, (1398-1410), Online publication date: 1-Nov-2004.
- Duval J, Kolpakov R, Kucherov G, Lecroq T and Lefebvre A (2004). Linear-time computation of local periods, Theoretical Computer Science, 326:1-3, (229-240), Online publication date: 20-Oct-2004.
- Toussaint G The geometry of musical rhythm Proceedings of the 2004 Japanese conference on Discrete and Computational Geometry, (198-212)
- Bannai H, Hyyro H, Shinohara A, Takeda M, Nakai K and Miyano S (2004). An O(N^2) Algorithm for Discovering Optimal Boolean Pattern Pairs, IEEE/ACM Transactions on Computational Biology and Bioinformatics, 1:4, (159-170), Online publication date: 1-Oct-2004.
- Chuang S and Hsu J Tree-Structured Template Generation for Web Pages Proceedings of the 2004 IEEE/WIC/ACM International Conference on Web Intelligence, (327-333)
- Ayala-Rincón M, Jacobi R, Carvalho L, Llanos C and Hartenstein R Modeling and prototyping dynamically reconfigurable systems for efficient computation of dynamic programming methods by rewriting-logic Proceedings of the 17th symposium on Integrated circuits and system design, (248-253)
- 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)
- Argamon S, Akiva N, Amir A and Kapah O Efficient unsupervised recursive word segmentation using minimum description length Proceedings of the 20th international conference on Computational Linguistics, (1058-es)
- Dalli A, Xia Y and Wilks Y FASIL email summarisation system Proceedings of the 20th international conference on Computational Linguistics, (994-es)
- Custers N, De Causmaecker P, Demeester P and Berghe G Semantic components for timetabling Proceedings of the 5th international conference on Practice and Theory of Automated Timetabling, (17-33)
- Adjeroh D and Feng J Locating All Tandem Repeat Families in a Sequence Proceedings of the 2004 IEEE Computational Systems Bioinformatics Conference, (676-681)
- Bergig O, Barash D and Kedem K RNA Motif Search Using the Structure to String (STR2) Method Proceedings of the 2004 IEEE Computational Systems Bioinformatics Conference, (660-661)
- Quest D and Ali H Ontology Specific Data Mining Based on Dynamic Grammars Proceedings of the 2004 IEEE Computational Systems Bioinformatics Conference, (495-496)
- Wang Z and Zhang K Multiple RNA Structure Alignment Proceedings of the 2004 IEEE Computational Systems Bioinformatics Conference, (246-254)
- Bafna V and Zhang S FastR Proceedings of the 2004 IEEE Computational Systems Bioinformatics Conference, (52-61)
- Chen L, Lu S and Ram J Compressed Pattern Matching in DNA Sequences Proceedings of the 2004 IEEE Computational Systems Bioinformatics Conference, (62-68)
- Gams E and Reich S Following your colleagues' footprints Proceedings of the fifteenth ACM conference on Hypertext and hypermedia, (89-90)
- Peng Z and Ting H Time and space efficient algorithms for constrained sequence alignment Proceedings of the 9th international conference on Implementation and Application of Automata, (237-246)
- Cameron M, Williams H and Cannane A (2004). Improved Gapped Alignment in BLAST, IEEE/ACM Transactions on Computational Biology and Bioinformatics, 1:3, (116-129), Online publication date: 1-Jul-2004.
- Middendorf M and Manlove D (2004). Combined super-/substring and super-/subsequence problems, Theoretical Computer Science, 320:2-3, (247-267), Online publication date: 14-Jun-2004.
- Choffrut C and Haddad Y (2004). String-matching with OBDDs, Theoretical Computer Science, 320:2-3, (187-198), Online publication date: 14-Jun-2004.
- Lam W, Cheung P and Huang R Mining events and new name translations from online daily news Proceedings of the 4th ACM/IEEE-CS joint conference on Digital libraries, (287-295)
- D'yachkov A, Macula A, Pogozelski W, Renz T, Rykov V and Torney D A weighted insertion-deletion stacked pair thermodynamic metric for DNA codes Proceedings of the 10th international conference on DNA computing, (90-103)
- Cao X, Li S, Ooi B and Tung A (2004). Piers, ACM SIGMOD Record, 33:2, (39-44), Online publication date: 1-Jun-2004.
- Liu H, Chang Y and Chao K (2004). An optimal algorithm for querying tree structures and its applications in bioinformatics, ACM SIGMOD Record, 33:2, (21-26), Online publication date: 1-Jun-2004.
- Kum H, Duncan D and Wang W Understanding social welfare service patterns using sequential analysis Proceedings of the 2004 annual national conference on Digital government research, (1-2)
- Ramakrishnan I, Stent A and Yang G Hearsay Proceedings of the 13th international conference on World Wide Web, (80-89)
- Morrow C and Wilkins D A bioinformatics course in the computer science curriculum Proceedings of the 2nd annual conference on Mid-south college computing, (192-199)
- Bedathur S and Haritsa J Engineering a Fast Online Persistent Suffix Tree Construction Proceedings of the 20th International Conference on Data Engineering
- Neelapala N, Mittal R and Haritsa J SPINE Proceedings of the 20th International Conference on Data Engineering
- Policriti A, Vitacolonna N, Morgante M and Zuccolo A Structured motifs search Proceedings of the eighth annual international conference on Research in computational molecular biology, (133-139)
- Nagashima H and Yamazaki K (2004). Hardness of approximation for non-overlapping local alignments, Discrete Applied Mathematics, 137:3, (293-309), Online publication date: 15-Mar-2004.
- 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)
- Amir A, Butman A, Crochemore M, Landau G and Schaps M (2004). Two-dimensional pattern matching with rotations, Theoretical Computer Science, 314:1, (173-187), Online publication date: 25-Feb-2004.
- Alber J, Gramm J, Guo J and Niedermeier R (2004). Computing the similarity of two sequences with nested arc annotations, Theoretical Computer Science, 312:2-3, (337-358), Online publication date: 30-Jan-2004.
- Batu T, Kannan S, Khanna S and McGregor A Reconstructing strings from random traces Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms, (910-918)
- Grossi R, Gupta A and Vitter J When indexing equals compression Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms, (636-645)
- Udechukwu A, Barker K and Alhajj R Discovering all frequent trends in time series Proceedings of the winter international synposium on Information and communication technologies, (1-6)
- Xu Y, Wang L and Deng X Exact pattern matching for RNA secondary structures Proceedings of the second conference on Asia-Pacific bioinformatics - Volume 29, (257-263)
- Deogun J, Yang J and Ma F EMAGEN Proceedings of the second conference on Asia-Pacific bioinformatics - Volume 29, (113-122)
- Brown A Constructing chromosome scale suffix trees Proceedings of the second conference on Asia-Pacific bioinformatics - Volume 29, (105-112)
- Nederhof M and Satta G (2004). IDL-expressions, Journal of Artificial Intelligence Research, 21:1, (287-317), Online publication date: 1-Jan-2004.
- Kreibich C and Crowcroft J (2004). Honeycomb, ACM SIGCOMM Computer Communication Review, 34:1, (51-56), Online publication date: 1-Jan-2004.
- Madeira S and Oliveira A (2004). Biclustering Algorithms for Biological Data Analysis, IEEE/ACM Transactions on Computational Biology and Bioinformatics, 1:1, (24-45), Online publication date: 1-Jan-2004.
- Jiang X, Abegglen K, Bunke H and Csirik J (2003). Dynamic computation of generalised median strings, Pattern Analysis & Applications, 6:3, (185-193), Online publication date: 1-Dec-2003.
- Lloyd L and Skiena S Parsing Without a Grammar Proceedings of the Third IEEE International Conference on Data Mining
- Kottapally K, Ngo C, Reddy R, Pontelli E, Son T and Gillan D Towards the creation of accessibility agents for non-visual navigation of the web Proceedings of the 2003 conference on Universal usability, (134-141)
- Buchsbaum A, Fowler G and Giancarlo R (2003). Improving table compression with combinatorial optimization, Journal of the ACM, 50:6, (825-851), Online publication date: 1-Nov-2003.
- Ceroni A, Frasconi P, Passerini A and Vullo A (2003). Predicting the Disulfide Bonding State of Cysteines with Combinations of Kernel Machines, Journal of VLSI Signal Processing Systems, 35:3, (287-295), Online publication date: 1-Nov-2003.
- Chamberlain R, Cytron R, Franklin M and Indeck R The Mercury system Proceedings of the international workshop on Storage network architecture and parallel I/Os, (65-72)
- Reijers N and Langendoen K Efficient code distribution in wireless sensor networks Proceedings of the 2nd ACM international conference on Wireless sensor networks and applications, (60-67)
- D'Antonio L (2003). Incorporating bioinformatics in an algorithms course, ACM SIGCSE Bulletin, 35:3, (211-214), Online publication date: 1-Sep-2003.
- Chen Z, Li C, Pei J, Tao Y, Wang H, Wang W, Yang J, Yang J and Zhang D (2003). Recent progress on selected topics in database research, Journal of Computer Science and Technology, 18:5, (538-552), Online publication date: 1-Sep-2003.
- Liu B, Grossman R and Zhai Y Mining data records in Web pages Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining, (601-606)
- Bilenko M and Mooney R Adaptive duplicate detection using learnable string similarity measures Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining, (39-48)
- Rahmann S Fast and Sensitive Probe Selection for DNA Chips Using Jumps in Matching Statistics Proceedings of the IEEE Computer Society Conference on Bioinformatics
- Adjeroh D and Feng J The SCP and Compressed Domain Analysis of Biological Sequences Proceedings of the IEEE Computer Society Conference on Bioinformatics
- Zhang C, Liu Y, Eschen E and Wu K Identifying Regulatory Signals in DNA-Sequences with a Non-statistical Approximation Approach Proceedings of the IEEE Computer Society Conference on Bioinformatics
- Chin F, Ho N, Lam T, Wong P and Chan M Efficient Constrained Multiple Sequence Alignment with Performance Guarantee Proceedings of the IEEE Computer Society Conference on Bioinformatics
- Gusfield D, Eddhu S and Langley C Efficient Reconstruction of Phylogenetic Networks with Constrained Recombination Proceedings of the IEEE Computer Society Conference on Bioinformatics
- Pietro C, Pietro V, Emmanuele G, Ferro A, Maugeri T, Modica E, Pigola G, Pulvirenti A, Purrello M, Ragusa M, Scalia M, Shasha D, Travali S and Zimmitti V ANTICLUSTAL Proceedings of the IEEE Computer Society Conference on Bioinformatics
- Zavolan M, Socci N, Rajewsky N and Gaasterlamd T SMASHing regulatory sites in DNA by human-mouse sequence comparisons Proceedings of the IEEE Computer Society Conference on Bioinformatics
- Satya R, Mukherjee A and Ranga U A Pattern Matching Algorithm for Codon Optimization and CpG Motif-Engineering in DNA Expression Vectors Proceedings of the IEEE Computer Society Conference on Bioinformatics
- Watson B (2003). A new algorithm for the construction of minimal acyclic DFAs, Science of Computer Programming, 48:2-3, (81-97), Online publication date: 1-Aug-2003.
- 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)
- Fu W, Hon W and Sung W On all-substrings alignment problems Proceedings of the 9th annual international conference on Computing and combinatorics, (80-89)
- Gao Y, Wu J, Niewiadomski R, Wang Y, Chen Z and Lin G A space efficient algorithm for sequence alignment with inversions Proceedings of the 9th annual international conference on Computing and combinatorics, (57-67)
- Chung R and Gusfield D Empirical exploration of perfect phylogeny haplotyping and haplotypers Proceedings of the 9th annual international conference on Computing and combinatorics, (5-19)
- 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)
- Shyu C and Foster J Evolving consensus sequence for multiple sequence alignment with a genetic algorithm Proceedings of the 2003 international conference on Genetic and evolutionary computation: PartII, (2313-2324)
- Anselmo M and Madonia M Covering problems from a formal language point of view Proceedings of the 7th international conference on Developments in language theory, (122-133)
- Lefebvre A, Lecroq T and Alexandre J (2003). An improved algorithm for finding longest repeats with a modified factor oracle, Journal of Automata, Languages and Combinatorics, 8:4, (647-657), Online publication date: 1-Jul-2003.
- 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)
- D'Antonio L Incorporating bioinformatics in an algorithms course Proceedings of the 8th annual conference on Innovation and technology in computer science education, (211-214)
- Kolpakov R and Kucherov G (2003). Finding approximate repetitions under Hamming distance, Theoretical Computer Science, 303:1, (135-156), Online publication date: 28-Jun-2003.
- Sakamoto H A fully linear-time approximation algorithm for grammar-based compression Proceedings of the 14th annual conference on Combinatorial pattern matching, (348-360)
- Nicolas F and Rivals E Complexities of the centre and median string problems Proceedings of the 14th annual conference on Combinatorial pattern matching, (315-327)
- Mauri G and Pavesi G Pattern discovery in RNA secondary structure using affix trees Proceedings of the 14th annual conference on Combinatorial pattern matching, (278-294)
- Landau G, Schieber B and Ziv-Ukelson M Sparse LCS common substring alignment Proceedings of the 14th annual conference on Combinatorial pattern matching, (225-236)
- 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)
- Clifford R and Sergot M Distributed and paged suffix trees for large genetic databases Proceedings of the 14th annual conference on Combinatorial pattern matching, (70-82)
- Amir A, Butman A, Crochemore M, Landau G and Schaps M Two-dimensional pattern matching with rotations Proceedings of the 14th annual conference on Combinatorial pattern matching, (17-31)
- Branting L A comparative evaluation of name-matching algorithms Proceedings of the 9th international conference on Artificial intelligence and law, (224-232)
- 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.
- 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.
- Brlek S and Ladouceur A (2003). A note on differentiable palindromes, Theoretical Computer Science, 302:1-3, (167-178), Online publication date: 13-Jun-2003.
- Grahne G, Hakli R, Nykänen M, Tamm H and Ukkonen E (2003). Design and implementation of a string database query language, Information Systems, 28:4, (311-337), Online publication date: 1-Jun-2003.
- Gabriele A, Mignosi F, Restivo A and Sciortino M Indexing structures for approximate string matching Proceedings of the 5th Italian conference on Algorithms and complexity, (140-151)
- Crescenzi P, Grossi R and Italiano G Search data structures for skewed strings Proceedings of the 2nd international conference on Experimental and efficient algorithms, (81-96)
- Wang J and Lochovsky F Data extraction and label assignment for web databases Proceedings of the 12th international conference on World Wide Web, (187-196)
- Platel M, Clergue M and Collard P Maximum homologous crossover for linear genetic programming Proceedings of the 6th European conference on Genetic programming, (194-203)
- Dalli A Adaptation of the F-measure to cluster based lexicon quality evaluation Proceedings of the EACL 2003 Workshop on Evaluation Initiatives in Natural Language Processing: are evaluation methods, metrics and resources reusable?, (51-56)
- Bafna V, Halldorsson B, Schwartz R, Clark A and Istrail S Haplotypes and informative SNP selection algorithms Proceedings of the seventh annual international conference on Research in computational molecular biology, (19-27)
- Chang C, Hsu C and Lui S (2003). Automatic information extraction from semi-structured Web pages by pattern discovery, Decision Support Systems, 35:1, (129-147), Online publication date: 1-Apr-2003.
- Schwikowski B and Vingron M (2003). Weighted sequence graphs, Discrete Applied Mathematics, 127:1, (95-117), Online publication date: 1-Apr-2003.
- Manthey B (2003). Non-approximability of weighted multiple sequence alignment, Theoretical Computer Science, 296:1, (179-192), Online publication date: 4-Mar-2003.
- Royce T and Necaise R (2003). A parallel algorithm for DNA alignment, XRDS: Crossroads, The ACM Magazine for Students, 9:3, (10-15), Online publication date: 1-Mar-2003.
- Schneider K (2003). Tabular parsing and algebraic transformations, Theoretical Computer Science, 293:2, (365-389), Online publication date: 6-Feb-2003.
- Hoad T and Zobel J Video similarity detection for digital rights management Proceedings of the 26th Australasian computer science conference - Volume 16, (237-245)
- Crochemore M, Hancart C and Lecroq T (2003). A unifying look at the Apostolico--Giancarlo string-matching algorithm, Journal of Discrete Algorithms, 1:1, (37-52), Online publication date: 1-Feb-2003.
- Takeda M, Fukuda T, Nanri I, Yamasaki M and Tamari K (2003). Discovering instances of poetic allusion from anthologies of classical Japanese poems, Theoretical Computer Science, 292:2, (497-524), Online publication date: 27-Jan-2003.
- Crochemore M (2003). Reducing space for index implementation, Theoretical Computer Science, 292:1, (185-197), Online publication date: 21-Jan-2003.
- 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)
- Alt H, Efrat A, Rote G and Wenk C Matching planar maps Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms, (589-598)
- Keith J, Adams P, Bryant D, Mitchelson K, Cochran D and Lala G Inferring an original sequence from erroneous copies Proceedings of the First Asia-Pacific bioinformatics conference on Bioinformatics 2003 - Volume 19, (23-28)
- Williams H Genomic information retrieval Proceedings of the 14th Australasian database conference - Volume 17, (27-35)
- Jansson J and Lingas A (2003). A Fast Algorithm for Optimal Alignment between Similar Ordered Trees, Fundamenta Informaticae, 56:1-2, (105-120), Online publication date: 1-Jan-2003.
- Amir A, Srinivasan S and Efrat A (2003). Search the audio, browse the video, EURASIP Journal on Advances in Signal Processing, 2003, (209-222), Online publication date: 1-Jan-2003.
- Keith J and Kroese D Rare event simulation and combinatorial optimization using cross entropy Proceedings of the 34th conference on Winter simulation: exploring new frontiers, (320-327)
- 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)
- Thiagarajan P and Gao G Visualizing Biosequence Data Using Texture Mapping Proceedings of the IEEE Symposium on Information Visualization (InfoVis'02)
- Bandelt H, Huber K and Moulton V (2002). Quasi-median graphs from sets of partitions, Discrete Applied Mathematics, 122:1-3, (23-35), Online publication date: 15-Oct-2002.
- Antoniol G, Canfora G, Casazza G, De Lucia A and Merlo E (2002). Recovering Traceability Links between Code and Documentation, IEEE Transactions on Software Engineering, 28:10, (970-983), Online publication date: 1-Oct-2002.
- Quasthoff U, Biemann C and Wolff C Named entity learning and verification proceedings of the 6th conference on Natural language learning - Volume 20, (1-7)
- Lin W and Chen H Backward machine transliteration by learning phonetic similarity proceedings of the 6th conference on Natural language learning - Volume 20, (1-7)
- Gusfield D Suffix Trees (and Relatives) Come of Age in Bioinformatics Proceedings of the IEEE Computer Society Conference on Bioinformatics
- Brudnd M and Morgenstern B Fast and Sensitive Alignment of Large Genomic Sequences Proceedings of the IEEE Computer Society Conference on Bioinformatics
- 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
- Yang J and Wang W Towards Automatic Clustering of Protein Sequences Proceedings of the IEEE Computer Society Conference on Bioinformatics
- Rahmann S Rapid Large-Scale Oligonucleotide Selection for Microarrays Proceedings of the IEEE Computer Society Conference on Bioinformatics
- Alstrup S, Gavoille C, Kaplan H and Rauhe T Nearest common ancestors Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures, (258-264)
- Li M, Ma B and Wang L (2002). Finding similar regions in many sequences, Journal of Computer and System Sciences, 65:1, (73-96), Online publication date: 1-Aug-2002.
- Zhou R and Hansen E Multiple sequence alignment using anytime A* Eighteenth national conference on Artificial intelligence, (975-976)
- 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)
- Aggarwal C On effective classification of strings with wavelets Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining, (163-172)
- Munteanu D and Marcu D Processing comparable corpora with Bilingual Suffix Trees Proceedings of the ACL-02 conference on Empirical methods in natural language processing - Volume 10, (289-295)
- Barzilay R and Lee L Bootstrapping lexical choice via multiple-sequence alignment Proceedings of the ACL-02 conference on Empirical methods in natural language processing - Volume 10, (164-171)
- Holub J and Crochemore M On the implementation of compact DAWG's Proceedings of the 7th international conference on Implementation and application of automata, (289-294)
- Mohri M Edit-distance of weighted automata Proceedings of the 7th international conference on Implementation and application of automata, (1-23)
- Kamiya T, Kusumoto S and Inoue K (2002). CCFinder, IEEE Transactions on Software Engineering, 28:7, (654-670), Online publication date: 1-Jul-2002.
- Knessl C and Szpankowski W (2002). Limit laws for the height in PATRICIA tries, Journal of Algorithms, 44:1, (63-97), Online publication date: 1-Jul-2002.
- Kottapally K, Ngo C, Reddy R, Pontelli E, Son T and Gillan D (2002). Towards the creation of accessibility agents for non-visual navigation of the web, ACM SIGCAPH Computers and the Physically Handicapped:73-74, (134-141), Online publication date: 17-Jun-2002.
- Chew L and Kedem K Finding the consensus shape for a protein family Proceedings of the eighteenth annual symposium on Computational geometry, (64-73)
- Dowsing R and Long S Trust and the automated assessment of IT skills Proceedings of the 2002 ACM SIGCPR conference on Computer personnel research, (90-95)
- Huhns M and Buell D (2002). Trusted Autonomy, IEEE Internet Computing, 6:3, (92-95), Online publication date: 1-May-2002.
- Mauri G and Pavesi G (2002). A parallel algorithm for pattern discovery in biological sequences, Future Generation Computer Systems, 18:6, (849-854), Online publication date: 1-May-2002.
- Rash S and Gusfield D String barcoding Proceedings of the sixth annual international conference on Computational biology, (254-261)
- Pachter L and Lam F Picking alignments from (steiner) trees Proceedings of the sixth annual international conference on Computational biology, (246-253)
- Gusfield D Haplotyping as perfect phylogeny Proceedings of the sixth annual international conference on Computational biology, (166-175)
- Caprara A and Lancia G Structural alignment of large—size proteins via lagrangian relaxation Proceedings of the sixth annual international conference on Computational biology, (100-108)
- Adams D, Watson L and Gürdal Z Blending of Composite Panel Designs Using Genetic Algorithms Proceedings of the 16th International Parallel and Distributed Processing Symposium
- Kalyanaraman A, Aluru S and Kothari S Parallel EST Clustering Proceedings of the 16th International Parallel and Distributed Processing Symposium
- Dalli A Biologically inspired Lexicon Structuring Technique Proceedings of the second international conference on Human Language Technology Research, (353-356)
- Gudmundsson J, Levcopoulos C, Narasimhan G and Smid M Approximate distance oracles for geometric graphs Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms, (828-837)
- Crochemore M, Landau G and Ziv-Ukelson M A sub-quadratic sequence alignment algorithm for unrestricted cost matrices Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms, (679-688)
- Berman P, DasGupta B and Muthukrishnan S Simple approximation algorithm for nonoverlapping local alignments Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms, (677-678)
- Cormode G and Muthukrishnan S The string edit distance matching problem with moves Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms, (667-676)
- Muthukrishnan S Efficient algorithms for document retrieval problems Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms, (657-666)
- Sadakane K Succinct representations of lcp information and improvements in the compressed suffix arrays Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms, (225-232)
- Buchsbaum A, Fowler G and Giancarlo R Improving table compression with combinatorial optimization Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms, (213-222)
- 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.
- Milosavljevic A Sciences Handbook of data mining and knowledge discovery, (830-841)
- Monostori K, Zaslavsky A and Schmidt H (2002). Suffix vector, Australian Computer Science Communications, 24:1, (157-165), Online publication date: 1-Jan-2002.
- Monostori K, Zaslavsky A and Schmidt H Suffix vector Proceedings of the twenty-fifth Australasian conference on Computer science - Volume 4, (157-165)
- Devanbu P, Gertz M, Kwong A, Martel C, Nuckolls G and Stubblebine S Flexible authentication of XML documents Proceedings of the 8th ACM conference on Computer and Communications Security, (136-145)
- Amir A, Efrat A and Srinivasan S Advances in phonetic word spotting Proceedings of the tenth international conference on Information and knowledge management, (580-582)
- 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)
- Kahveci T and Singh A Efficient Index Structures for String Databases Proceedings of the 27th International Conference on Very Large Data Bases, (351-360)
- Du W and Atallah M Secure multi-party computation problems and their applications Proceedings of the 2001 workshop on New security paradigms, (13-22)
- Clark A Unsupervised induction of stochastic context-free grammars using distributional clustering Proceedings of the 2001 workshop on Computational Natural Language Learning - Volume 7, (1-8)
- Kamiya T, Ohata F, Kondou K, Kusumoto S and Inoue K Maintenance support tools for JAVA programs Proceedings of the 23rd International Conference on Software Engineering, (837-838)
- Vitter J (2001). External memory algorithms and data structures, ACM Computing Surveys, 33:2, (209-271), Online publication date: 1-Jun-2001.
- Chang C and Lui S IEPAD Proceedings of the 10th international conference on World Wide Web, (681-688)
- Wen J, Nie J and Zhang H Clustering user queries of a search engine Proceedings of the 10th international conference on World Wide Web, (162-168)
- Pachter L, Alexandersson M and Cawley S Applications of generalized pair hidden Markov models to alignment and gene finding problems Proceedings of the fifth annual international conference on Computational biology, (241-248)
- Myers G Comparing sequence scaffolds Proceedings of the fifth annual international conference on Computational biology, (224-230)
- Lin G, Ma B and Zhang K Edit distance between two RNA structures Proceedings of the fifth annual international conference on Computational biology, (211-220)
- Blanchette M Algorithms for phylogenetic footprinting Proceedings of the fifth annual international conference on Computational biology, (49-58)
- Beigel R, Alon N, Kasif S, Apaydin M and Fortnow L An optimal procedure for gap closing in whole genome shotgun sequencing Proceedings of the fifth annual international conference on Computational biology, (22-30)
- 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.
- Marceau C Characterizing the behavior of a program using multiple-length N-grams Proceedings of the 2000 workshop on New security paradigms, (101-110)
- Monostori K, Zaslavsky A and Schmidt H Efficiency of data structures for detecting overlaps in digital documents Proceedings of the 24th Australasian conference on Computer science, (140-147)
- Monostori K, Zaslavsky A and Schmidt H (2001). Efficiency of data structures for detecting overlaps in digital documents, Australian Computer Science Communications, 23:1, (140-147), Online publication date: 1-Jan-2001.
- Rose O General simulation applications in semiconductor manufacturing Proceedings of the 32nd conference on Winter simulation, (1481-1490)
- Caruso F, Cochinwala M, Ganapathy U, Lalk G and Missier P Telcordia's Database Reconciliation and Data Quality Analysis Tool Proceedings of the 26th International Conference on Very Large Data Bases, (615-618)
- Heyer L (2000). A Generalized Erdös-Rényi Law for Sequence Analysis Problems, Methodology and Computing in Applied Probability, 2:3, (309-329), Online publication date: 1-Sep-2000.
- Lemström K and Hella L Approximate Pattern Matching is Expressible in Transitive Closure Logic Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
- Monostori K, Zaslavsky A and Schmidt H Document overlap detection system for distributed digital libraries Proceedings of the fifth ACM conference on Digital libraries, (226-227)
- Li M, Ma B and Wang L Near optimal multiple alignment within a band in polynomial time Proceedings of the thirty-second annual ACM symposium on Theory of computing, (425-434)
- 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)
- 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)
- Nederhof M and Satta G Left-to-right parsing and bilexical context-free grammars Proceedings of the 1st North American chapter of the Association for Computational Linguistics conference, (272-279)
- 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)
- Lanctot J, Li M and Yang E Estimating DNA sequence entropy Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms, (409-418)
- Knessl C and Szpankowski W Height in a digital search tree and the longest phrase of the Lempel-Ziv scheme Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms, (187-196)
- Kim S (1999). A new string-pattern matching algorithm using partitioning and hashing efficiently, ACM Journal of Experimental Algorithmics, 4, (2-es), Online publication date: 31-Dec-2000.
- Salzberg S (1999). Gene Discovery in DNA Sequences, IEEE Intelligent Systems, 14:6, (44-48), Online publication date: 1-Nov-1999.
- Uitdenbogerd A and Zobel J Melodic matching techniques for large music databases Proceedings of the seventh ACM international conference on Multimedia (Part 1), (57-66)
- 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
- 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.
- Li M, Ma B and Wang L Finding similar regions in many strings Proceedings of the thirty-first annual ACM symposium on Theory of Computing, (473-482)
- Floratos A, Rigoutsos I, Parida L, Stolovitzky G and Gao Y Sequence homology detection through large scale pattern discovery Proceedings of the third annual international conference on Computational molecular biology, (164-173)
- Caprara A Formulations and hardness of multiple sorting by reversals Proceedings of the third annual international conference on Computational molecular biology, (84-93)
- Nykänen M and Ukkonen E Finding paths with the right cost Proceedings of the 16th annual conference on Theoretical aspects of computer science, (345-355)
- Csűrös M and Kao M Recovering evolutionary trees through harmonic greedy triplets Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms, (261-270)
- Cole R and Hariharan R Dynamic LCA queries on trees Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms, (235-244)
- Zamir O and Etzioni O Web document clustering Proceedings of the 21st annual international ACM SIGIR conference on Research and development in information retrieval, (46-54)
- Oskin M, Chong F and Sherwood T (1998). Active pages, ACM SIGARCH Computer Architecture News, 26:3, (192-203), Online publication date: 1-Jun-1998.
- Oskin M, Chong F and Sherwood T Active pages Proceedings of the 25th annual international symposium on Computer architecture, (192-203)
- Sankoff D and Blanchette M Multiple genome rearrangements Proceedings of the second annual international conference on Computational molecular biology, (243-247)
- Oliveira R, Damasceno F, Souza R, Santos R, Lima M, Kawasaki R and Sales C GAVGA: A Genetic Algorithm for Viral Genome Assembly Progress in Artificial Intelligence, (395-407)
- de Lima E, Furtado A and Feijó B Storytelling Variants: The Case of Little Red Riding Hood Entertainment Computing - ICEC 2015, (286-300)
Index Terms
- Algorithms on strings, trees, and sequences: computer science and computational biology
Recommendations
Three algorithms on Braun trees
Among the many flavours of balanced binary trees, Braun trees (Braun and Rem, 1983) are perhaps the most circumscribed. For any given node of a Braun tree, the left subtree is either exactly the same size as the right subtree, or one element larger. ...
Signal Processing with temporal sequences in olfactory systems
The olfactory system is a very efficient biological setup capable of odor information processing with neural signals. The nature of neural signals restricts the information representation to multidimensional temporal sequences of spikes. The information ...
On integer sequences derived from balanced k-ary trees
AMERICAN-MATH'12/CEA'12: Proceedings of the 6th WSEAS international conference on Computer Engineering and Applications, and Proceedings of the 2012 American conference on Applied MathematicsThis article investigates numerous integer sequences derived from two special balanced k-ary trees. Main contributions of this article are two fold. The first one is building a taxonomy of various balanced trees. The other pertains to discovering new ...