Search results for "substrings"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
22	Eduardo Moreno 0001, Martín Matamala	Minimal de Bruijn Sequence in a Language with Forbidden Substrings.	WG	2004	DBLP DOI BibTeX RDF
22	Patricia A. Evans, Andrew D. Smith, Harold T. Wareham	On the complexity of finding common approximate substrings.	Theor. Comput. Sci.	2003	DBLP DOI BibTeX RDF
22	Heiko Goeman	On parsing and condensing substrings of LR languages in linear time.	Theor. Comput. Sci.	2001	DBLP DOI BibTeX RDF
22	Mikio Yamamoto, Kenneth Ward Church	Using Suffix Arrays to Compute Term Frequency and Document Frequency for All Substrings in a Corpus.	Comput. Linguistics	2001	DBLP DOI BibTeX RDF
22	Frank Ruskey, Joe Sawada	Generating Necklaces and Strings with Forbidden Substrings.	COCOON	2000	DBLP DOI BibTeX RDF
22	Harvey Lloyd-Thomas, Eluned S. Parris, Jeremy H. Wright	Recurrent substrings and data fusion for language recognition.	ICSLP	1998	DBLP DOI BibTeX RDF
22	Mikio Yamamoto, Kenneth Ward Church	Using Suffix Arrays to Compute Term Frequency and Document Frequency for All Substrings in a Corpus.	VLC@COLING/ACL	1998	DBLP BibTeX RDF
22	Art M. Duval, William F. Smyth	Covering a Circular String with Substrings of Fixed Length.	Int. J. Found. Comput. Sci.	1996	DBLP DOI BibTeX RDF
22	Jerry H. Wright, Michael J. Carey 0002, Eluned S. Parris	Statistical models for topic identification using phoneme substrings.	ICASSP	1996	DBLP DOI BibTeX RDF
22	Steven Skiena, Gopalakrishnan Sundaram	Reconstructing Strings from Substrings.	J. Comput. Biol.	1995	DBLP DOI BibTeX RDF
22	Esfandiar Eslami, John N. Mordeson	Structure of Fuzzy Substrings.	Inf. Sci.	1994	DBLP DOI BibTeX RDF
22	Alejandro López-Ortiz	Linear pattern matching of repeated substrings.	SIGACT News	1994	DBLP DOI BibTeX RDF
22	Archie L. Cobbs	Fast Identification of Approximately Matching Substrings.	CPM	1994	DBLP DOI BibTeX RDF
22	Steven Skiena, Gopalakrishnan Sundaram	Reconstructing Strings from Substrings (Extended Abstract).	WADS	1993	DBLP DOI BibTeX RDF
22	Alberto Apostolico, Maxime Crochemore	Optimal Canonization of All Substrings of a String	Inf. Comput.	1991	DBLP DOI BibTeX RDF
22	János Csirik, Horst Bunke	Longest k-distance substrings of two strings.	ICPR	1988	DBLP DOI BibTeX RDF
22	Kellogg S. Booth	Lexicographically Least Circular Substrings.	Inf. Process. Lett.	1980	DBLP DOI BibTeX RDF
22	Witold Lipski Jr.	On strings containing all subsets as substrings.	Discret. Math.	1978	DBLP DOI BibTeX RDF
11	Sai Krishna, Prasad Pingali, Vasudeva Varma	An information retrieval approach to spelling suggestion.	WWW	2010	DBLP DOI BibTeX RDF	spelling suggestion, information retrieval, language independent
11	Costas S. Iliopoulos, M. Sohel Rahman	Indexing Factors with Gaps.	Algorithmica	2009	DBLP DOI BibTeX RDF	String index, Gapped-factor, Algorithms, Data structure, Suffix tree
11	Frédéric Guyon, Céline Brochier-Armanet, Alain Guénoche	Comparison of alignment free string distances for complete genome phylogeny.	Adv. Data Anal. Classif.	2009	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000) 05C05, 68R15, 92B10, 90C27
11	Miad Faezipour, Mehrdad Nourani, Rina Panigrahy	A hardware platform for efficient worm outbreak detection.	ACM Trans. Design Autom. Electr. Syst.	2009	DBLP DOI BibTeX RDF	shared counters, worm outbreak, hashing, false positive, Network Intrusion Detection System, false negative, polymorphic worm
11	Antoon Bronselaer, Guy De Tré	A Possibilistic Approach to String Comparison.	IEEE Trans. Fuzzy Syst.	2009	DBLP DOI BibTeX RDF
11	Verónica Dahl, Erez Maharshak	DNA Replication as a Model for Computational Linguistics.	IWINAC (1)	2009	DBLP DOI BibTeX RDF	DNA replication, long distance dependencies, synthesis, analysis, computational linguistics, molecular biology, constraint handling rules
11	Qian Xi, Kathleen Fisher, David Walker 0001, Kenny Qili Zhu	Ad Hoc Data and the Token Ambiguity Problem.	PADL	2009	DBLP DOI BibTeX RDF
11	Ping-Hui Hsu, Kuan-Yu Chen, Kun-Mao Chao	Finding All Approximate Gapped Palindromes.	ISAAC	2009	DBLP DOI BibTeX RDF	palindrome, incremental string comparison, string matching
11	Minghui Jiang 0001	Inapproximability of Maximal Strip Recovery.	ISAAC	2009	DBLP DOI BibTeX RDF
11	Jiaheng Lu, Jialong Han, Xiaofeng Meng 0001	Efficient algorithms for approximate member extraction using signature-based inverted lists.	CIKM	2009	DBLP DOI BibTeX RDF	approximate member extraction, filtration-verification, approximate string matching, incremental computation
11	Bin Yang, Yu Peng, Henry C. M. Leung, Siu-Ming Yiu, Jing-Chi Chen, Francis Y. L. Chin	Unsupervised binning of environmental genomic fragments based on an error robust selection of l-mers.	DTMBIO	2009	DBLP DOI BibTeX RDF	dna composition features, k-mer, modified chebychev distance, k-mean clustering, metagenomics, binning
11	Paolo Ferragina, Igor Nitto, Rossano Venturini	On the bit-complexity of Lempel-Ziv compression.	SODA	2009	DBLP DOI BibTeX RDF
11	Antti Ukkonen	Mining Local Correlation Patterns in Sets of Sequences.	Discovery Science	2009	DBLP DOI BibTeX RDF
11	Philip Bille	Fast Searching in Packed Strings.	CPM	2009	DBLP DOI BibTeX RDF
11	Francisco Claude, Gonzalo Navarro 0001	Self-indexed Text Compression Using Straight-Line Programs.	MFCS	2009	DBLP DOI BibTeX RDF
11	Makoto Kanazawa	The Pumping Lemma for Well-Nested Multiple Context-Free Languages.	Developments in Language Theory	2009	DBLP DOI BibTeX RDF
11	Alberto Apostolico, Fabio Cunial	Probing the Randomness of Proteins by Their Subsequence Composition.	DCC	2009	DBLP DOI BibTeX RDF
11	Meng Zhang 0006, Yi Zhang 0031, Liang Hu 0001, Peichen Xin	On the Structure of Consistent Partitions of Substring Set of a Word.	FAW	2009	DBLP DOI BibTeX RDF
11	Yoram Adler, Eitan Farchi, Moshe Klausner, Dan Pelleg, Orna Raz, Moran Shochat, Shmuel Ur, Aviad Zlotnick	Advanced code coverage analysis using substring holes.	ISSTA	2009	DBLP DOI BibTeX RDF	software testing, coverage analysis
11	Crystal L. Kahn, Shay Mozes, Benjamin J. Raphael	Efficient Algorithms for Analyzing Segmental Duplications, Deletions, and Inversions in Genomes.	WABI	2009	DBLP DOI BibTeX RDF
11	Adrian Kügel, Enno Ohlebusch	A space efficient solution to the frequent string mining problem for many databases.	Data Min. Knowl. Discov.	2008	DBLP DOI BibTeX RDF	String mining, Enhanced suffix array
11	Alexander Meduna, Jirí Techet	Scattered context grammars that erase nonterminals in a generalized k -limited way.	Acta Informatica	2008	DBLP DOI BibTeX RDF
11	Alexandre Tiskin	Semi-local String Comparison: Algorithmic Techniques and Applications.	Math. Comput. Sci.	2008	DBLP DOI BibTeX RDF	semi-local string comparison, longest common subsequence, String algorithms
11	Hakim Belhaouari, Frédéric Peschanski	Automated Generation of Test Cases from Contract-Oriented Specifications: A CSP-Based Approach.	HASE	2008	DBLP DOI BibTeX RDF
11	Derrick Coetzee	TinyLex: static n-gram index pruning with perfect recall.	CIKM	2008	DBLP DOI BibTeX RDF	TinyLex, phrase searching, static pruning, pruning, n-gram, index
11	Ely Porat, Klim Efremenko	Approximating general metric distances between a pattern and a text.	SODA	2008	DBLP BibTeX RDF
11	Bing Tian Dai, Nick Koudas, Divesh Srivastava, Anthony K. H. Tung, Suresh Venkatasubramanian	Validating Multi-column Schema Matchings by Type.	ICDE	2008	DBLP DOI BibTeX RDF
11	Bingjun Sun, Prasenjit Mitra, C. Lee Giles	Mining, indexing, and searching for textual chemical molecule information on the web.	WWW	2008	DBLP DOI BibTeX RDF	hierarchical text segmentation, independent frequent subsequence, index pruning, substring search, ranking, similarity search, conditional random fields, entity extraction
11	J. Ian Munro	Lower Bounds for Succinct Data Structures.	CPM	2008	DBLP DOI BibTeX RDF
11	Abdulrahman Hijazi, Hajime Inoue, Ashraf Matrawy, Paul C. van Oorschot, Anil Somayaji	Discovering Packet Structure through Lightweight Hierarchical Clustering.	ICC	2008	DBLP DOI BibTeX RDF
11	Pavel P. Kuksa, Pai-Hsi Huang, Vladimir Pavlovic 0001	Fast protein homology and fold detection with sparse spatial sample kernels.	ICPR	2008	DBLP DOI BibTeX RDF
11	Xiaochun Yang 0001, Bin Wang 0015, Chen Li 0001	Cost-based variable-length-gram selection for string collections to support approximate queries efficiently.	SIGMOD Conference	2008	DBLP DOI BibTeX RDF	approximate string query, gram selection, vgram
11	Sen Zhang, Ge Nong	Fast and Space Efficient Linear Suffix Array Construction.	DCC	2008	DBLP DOI BibTeX RDF	algorithm, Suffix array, linear complexity
11	Fei Xia, Yong Dou, Jinbo Xu	Hardware BLAST Algorithms with Multi-seeds Detection and Parallel Extension.	ARC	2008	DBLP DOI BibTeX RDF
11	Mourad Elloumi, Ahmed Mokaddem	An Algorithm for Multiple and Global Alignments.	BIRD	2008	DBLP DOI BibTeX RDF	multiple and global alignments, common subsequence, algorithms, complexities, Strings, divide-and-conquer strategy
11	Fei Xia, Yong Dou, Jiaqing Xu	Families of FPGA-Based Accelerators for BLAST Algorithm with Multi-seeds Detection and Parallel Extension.	BIRD	2008	DBLP DOI BibTeX RDF
11	Graham Cormode, S. Muthukrishnan 0001	The string edit distance matching problem with moves.	ACM Trans. Algorithms	2007	DBLP DOI BibTeX RDF	data streams, embedding, similarity search, string matching, edit distance, Approximate pattern matching
11	Arturas Mazeika, Michael H. Böhlen, Nick Koudas, Divesh Srivastava	Estimating the selectivity of approximate string queries.	ACM Trans. Database Syst.	2007	DBLP DOI BibTeX RDF	Inverse strings, min-wise hash signatures, q-grams
11	Min Cai, Kai Hwang 0001, Jianping Pan 0001, Christos Papadopoulos	WormShield: Fast Worm Signature Generation with Distributed Fingerprint Aggregation.	IEEE Trans. Dependable Secur. Comput.	2007	DBLP DOI BibTeX RDF	distributed aggregation tree, cardinality counting, Network security, distributed hash table, traffic measurement, Internet worms, signature generation, worm containment
11	John Yiannis, Justin Zobel	Compression techniques for fast external sorting.	VLDB J.	2007	DBLP DOI BibTeX RDF	Semi-static compression, Sorting, Query evaluation, External sorting
11	Kazuhiro Ohkura, Toshiyuki Yasuda, Yuichi Kawamatsu, Yoshiyuki Matsumura, Kanji Ueda	MBEANN: Mutation-Based Evolving Artificial Neural Networks.	ECAL	2007	DBLP DOI BibTeX RDF
11	Xiaonan Ji, James Bailey 0001	An Efficient Technique for Mining Approximately Frequent Substring Patterns.	ICDM Workshops	2007	DBLP DOI BibTeX RDF
11	Christopher Previti, Oscar Harari, Igor Zwir, Coral del Val	Novel approaches to the prediction of CpG islands and their methylation status.	SCSC	2007	DBLP BibTeX RDF	CpG islands, data mining, classification, unsupervised learning, methylation
11	Nazar M. Zaki, Safaai Deris, Saleh Alwahaishi	SubSS: A Protein-Protein Interaction Detection Tool.	ACIS-ICIS	2007	DBLP DOI BibTeX RDF
11	Christopher Previti, Oscar Harari, Coral del Val	Mining and Predicting CpG islands.	FUZZ-IEEE	2007	DBLP DOI BibTeX RDF
11	Kazuyuki Narisawa, Hideo Bannai, Kohei Hatano, Masayuki Takeda	Unsupervised Spam Detection Based on String Alienness Measures.	Discovery Science	2007	DBLP DOI BibTeX RDF
11	Shay Mozes, Oren Weimann, Michal Ziv-Ukelson	Speeding Up HMM Decoding and Training by Exploiting Sequence Repetitions.	CPM	2007	DBLP DOI BibTeX RDF	dynamic programming, HMM, compression, Viterbi
11	Kazuyuki Narisawa, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda	Efficient Computation of Substring Equivalence Classes with Suffix Arrays.	CPM	2007	DBLP DOI BibTeX RDF
11	Charu C. Aggarwal, Philip S. Yu	On string classification in data streams.	KDD	2007	DBLP DOI BibTeX RDF	classification, hidden markov models, string
11	Seung-Ho Kang, Mun-Ho Choi, In-Seon Jeong, Hyeong-Seok Lim	An Efficient Two-Phase Algorithm to Find Gene-Specific Probes for Large Genomes.	FBIT	2007	DBLP DOI BibTeX RDF
11	Mehryar Mohri, Pedro J. Moreno 0001, Eugene Weinstein	Factor Automata of Automata and Applications.	CIAA	2007	DBLP DOI BibTeX RDF	suffix automata, factor automata, music identification, information retrieval, finite automata, suffix trees, inverted files, text indexing
11	François Barthélemy	Multi-grain Relations.	CIAA	2007	DBLP DOI BibTeX RDF	rational relation, tree transduction, two-level morphology
11	Tak Wah Lam, Wing-Kin Sung, Siu-Lung Tam, Chi-Kwong Wong, Siu-Ming Yiu	An Experimental Study of Compressed Indexing and Local Alignments of DNA.	COCOA	2007	DBLP DOI BibTeX RDF
11	Sofya Raskhodnikova, Dana Ron, Ronitt Rubinfeld, Adam D. Smith	Sublinear Algorithms for Approximating String Compressibility.	APPROX-RANDOM	2007	DBLP DOI BibTeX RDF
11	Sylvia Halász, Philip Brown, Colin R. Goodall, Arnold Lent, Dennis G. Cochrane, John R. Allegra	Detecting the Start of the Flu Season.	BioSurveillance	2007	DBLP DOI BibTeX RDF
11	Sachin Agarwal 0001, Vikas Chauhan, Ari Trachtenberg	Bandwidth Efficient String Reconciliation Using Puzzles.	IEEE Trans. Parallel Distributed Syst.	2006	DBLP DOI BibTeX RDF	Efficient file synchronization, string reconstruction, rsync
11	Hongbin Lu, Kai Zheng 0003, Bin Liu 0001, Xin Zhang 0003, Y. Liu	A Memory-Efficient Parallel String Matching Architecture for High-Speed Intrusion Detection.	IEEE J. Sel. Areas Commun.	2006	DBLP DOI BibTeX RDF
11	Gerald Tripp	A Parallel "String Matching Engine" for use in High Speed Network Intrusion Detection Systems.	J. Comput. Virol.	2006	DBLP DOI BibTeX RDF
11	Atsuhiro Takasu	An approximate multi-word matching algorithm for robust document retrieval.	CIKM	2006	DBLP DOI BibTeX RDF	dynamic programming, statistical model, suffix tree
11	Alexandr Andoni, Piotr Indyk	Efficient algorithms for substring near neighbor problem.	SODA	2006	DBLP DOI BibTeX RDF
11	Ydo Wexler, Chaya Ben-Zaken Zilberstein, Michal Ziv-Ukelson	A Study of Accessible Motifs and RNA Folding Complexity.	RECOMB	2006	DBLP DOI BibTeX RDF
11	Yasuto Higa, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda	A New Family of String Classifiers Based on Local Relatedness.	Discovery Science	2006	DBLP DOI BibTeX RDF
11	Ho-Leung Chan, Tak Wah Lam, Wing-Kin Sung, Siu-Lung Tam, Swee-Seong Wong	A Linear Size Index for Approximate Pattern Matching.	CPM	2006	DBLP DOI BibTeX RDF
11	Sven Rahmann	Subsequence Combinatorics and Applications to Microarray Production, DNA Sequencing and Chaining Algorithms.	CPM	2006	DBLP DOI BibTeX RDF
11	Ho-Leung Chan, Tak Wah Lam, Wing-Kin Sung, Siu-Lung Tam, Swee-Seong Wong	Compressed Indexes for Approximate String Matching.	ESA	2006	DBLP DOI BibTeX RDF
11	Alexander Clark	PAC-Learning Unambiguous NTS Languages.	ICGI	2006	DBLP DOI BibTeX RDF
11	Jonathan Koberstein, Yiu-Kai Ng	Using Word Clusters to Detect Similar Web Documents.	KSEM	2006	DBLP DOI BibTeX RDF
11	Alexandre Tiskin	All Semi-local Longest Common Subsequences in Subquadratic Time.	CSR	2006	DBLP DOI BibTeX RDF
11	Luca Bortolussi, Francesco Fabris, Alberto Policriti	BuST-Bundled Suffix Trees.	IFIP TCS	2006	DBLP DOI BibTeX RDF
11	Qing Guo 0002, Hui Zhang 0004, Costas S. Iliopoulos	Computing the Minimum Approximate lambda-Cover of a String.	SPIRE	2006	DBLP DOI BibTeX RDF
11	Choon Hui Teo, S. V. N. Vishwanathan	Fast and space efficient string kernels using suffix arrays.	ICML	2006	DBLP DOI BibTeX RDF
11	Qing Guo 0002, Hui Zhang 0004, Costas S. Iliopoulos	Computing the lambda-Seeds of a String.	AAIM	2006	DBLP DOI BibTeX RDF
11	Jedidiah R. Crandall, Zhendong Su 0001, Shyhtsun Felix Wu, Frederic T. Chong	On deriving unknown vulnerabilities from zero-day polymorphic and metamorphic worm exploits.	CCS	2005	DBLP DOI BibTeX RDF	metamorphism, polymorphism, symbolic execution, worms, honeypots, polymorphic worms
11	Sören Sonnenburg, Gunnar Rätsch, Christin Schäfer	Learning Interpretable SVMs for Biological Sequence Classification.	RECOMB	2005	DBLP DOI BibTeX RDF
11	Johan Parent, Ann Nowé, Kris Steenhaut, Anne Defaweux	Linear genetic programming using a compressed genotype representation.	Congress on Evolutionary Computation	2005	DBLP DOI BibTeX RDF
11	Yo-Sub Han, Yajun Wang, Derick Wood	Prefix-Free Regular-Expression Matching.	CPM	2005	DBLP DOI BibTeX RDF
11	Carmit Hazay, Moshe Lewenstein, Dekel Tsur	Two Dimensional Parameterized Matching.	CPM	2005	DBLP DOI BibTeX RDF
11	Meng Zhang 0006, Liang Hu 0001, Qiang Li 0008, Jiubin Ju	Weighted Directed Word Graph.	CPM	2005	DBLP DOI BibTeX RDF
11	Mario Latendresse	Masquerade Detection via Customized Grammars.	DIMVA	2005	DBLP DOI BibTeX RDF
11	Martin Jansche	Algorithms for Minimum Risk Chunking.	FSMNLP	2005	DBLP DOI BibTeX RDF
11	Blaz Fortuna, Dunja Mladenic	Using String Kernels for Classification of Slovenian Web Documents.	GfKl	2005	DBLP DOI BibTeX RDF
11	Giovanni Manzini, Paolo Ferragina	Engineering a Lightweight Suffix Array Construction Algorithm.	Algorithmica	2004	DBLP DOI BibTeX RDF	Space-economical algorithms, Full-text index, Suffix tree, Suffix array, Algorithmic engineering