Search results for "substrings"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
102	Stanislav Angelov, Boulos Harb, Sampath Kannan, Sanjeev Khanna, Junhyong Kim	Efficient Enumeration of Phylogenetically Informative Substrings.	RECOMB	2006	DBLP DOI BibTeX RDF
81	Wilfred J. Hansen	Subsequence References: First-Class Values for Substrings.	ACM Trans. Program. Lang. Syst.	1992	DBLP DOI BibTeX RDF	ATK, AUIS, Andrew Toolkit, Ness, sequences, strings, document processing, programming language design, subsequences, string searching, substrings
79	Ho-Leung Chan, Tak Wah Lam, Wing-Kin Sung, Prudence W. H. Wong, Siu-Ming Yiu	Non-overlapping Common Substrings Allowing Mutations.	Math. Comput. Sci.	2008	DBLP DOI BibTeX RDF	Whole genome alignment, conserved genes, algorithms, mutations
70	Hermilo Sánchez-Cruz	Corner Detection by Searching Two Class Pattern Substrings.	CIARP	2006	DBLP DOI BibTeX RDF	Chain element, Three-symbol chain code, Pattern substrings, Contour, Corner, Freeman chain code
70	Joseph Bates, Alon Lavie	Recognizing Substrings of LR(k) Languages in Linear Time.	ACM Trans. Program. Lang. Syst.	1994	DBLP DOI BibTeX RDF	LR parsing, substrings
68	Takeaki Uno	An Efficient Algorithm for Finding Similar Short Substrings from Large Scale String Data.	PAKDD	2008	DBLP DOI BibTeX RDF
57	Ee-Chien Chang, Chee Liang Lim, Jia Xu 0006	Short Redactable Signatures Using Random Trees.	CT-RSA	2009	DBLP DOI BibTeX RDF	Redactable Signature Scheme, Random Tree, Privacy
48	Mourad Elloumi, Mondher Maddouri	New voting strategies designed for the classification of nucleic sequences.	Knowl. Inf. Syst.	2005	DBLP DOI BibTeX RDF	Biological macromolecules, Discriminant substrings, Primary structures, Vote strategies, Data mining, Classification
47	Dimitris Margaritis 0001, Steven Skiena	Reconstructing Strings from Substrings in Rounds.	FOCS	1995	DBLP DOI BibTeX RDF	string reconstruction, combinatorial bounds, substring queries, sequencing by hybridization, oligonucleotides, de novo sequencing, large DNA fragments, SBH, interaction, parallelism, pattern matching, string matching, DNA, biology computing, rounds, substrings
46	Leszek Gasieniec, Cindy Y. Li, Meng Zhang 0006	Faster Algorithm for the Set Variant of the String Barcoding Problem.	CPM	2008	DBLP DOI BibTeX RDF
46	Kilho Shin	Position-Aware String Kernels with Weighted Shifts and a General Framework to Apply String Kernels to Other Structured Data.	IDEAL	2007	DBLP DOI BibTeX RDF
46	Nadav Efraty, Gad M. Landau	Sparse Normalized Local Alignment.	Algorithmica	2005	DBLP DOI BibTeX RDF	Largest Common Subsequence (LCS), Algorithms, Dynamic programming, String matching, Local alignment
46	Nadav Efraty, Gad M. Landau	Sparse Normalized Local Alignment.	CPM	2004	DBLP DOI BibTeX RDF
46	Daichi Shigemizu, Osamu Maruyama	Searching for Regulatory Elements of Alternative Splicing Events Using Phylogenetic Footprinting.	WABI	2004	DBLP DOI BibTeX RDF
45	Gonzalo Navarro 0001, Leena Salmela	Indexing Variable Length Substrings for Exact and Approximate Matching.	SPIRE	2009	DBLP DOI BibTeX RDF
45	Lukasz Kobylinski, Krzysztof Walczak 0002	Jumping Emerging Substrings in Image Classification.	CAIP	2009	DBLP DOI BibTeX RDF
45	Joseph Bates, Alon Lavie	Recognizing Substrings of LR(k) Languages in Linear Time.	POPL	1992	DBLP DOI BibTeX RDF
37	Hermilo Sánchez-Cruz	A Proposal Method for Corner Detection with an Orthogonal Three-Direction Chain Code.	ACIVS	2006	DBLP DOI BibTeX RDF	Shape corner, Chain element, Symbol chain code, Pattern substrings, Contour, Freeman chain code
37	Manos Theodorakis, Panos Constantopoulos	On Context-based Naming in Information Bases.	CoopIS	1997	DBLP DOI BibTeX RDF	context-based naming, information bases, logical names, external object identification, named object, name readability, name ambiguity resolution, redundant name substrings, update operations, systematic object naming, designer/end-user cooperation, query processing, natural language, consistency checking, semantic data models, object-oriented data models, naming services, structuring mechanisms
34	Kyoji Umemura, Kenneth Ward Church	Substring Statistics.	CICLing	2009	DBLP DOI BibTeX RDF
34	Hendrik Jan Hoogeboom, Walter A. Kosters, Jeroen F. J. Laros	Selection of DNA Markers.	IEEE Trans. Syst. Man Cybern. Part C	2008	DBLP DOI BibTeX RDF
34	Chi-Yuan Chan, Hung-I Yu, Wing-Kai Hon, Biing-Feng Wang	A Faster Query Algorithm for the Text Fingerprinting Problem.	ESA	2007	DBLP DOI BibTeX RDF	Patricia trie, Fingerprints, Text indexing, Combinatorial algorithms on words
34	Sébastien Ferré	The Efficient Computation of Complete and Concise Substring Scales with Suffix Trees.	ICFCA	2007	DBLP DOI BibTeX RDF
34	Shmuel Tomi Klein, Tamar C. Serebro, Dana Shapira	Modeling Delta Encoding of Compressed Files.	DCC	2006	DBLP DOI BibTeX RDF
34	Xia Cao, Beng Chin Ooi, HweeHwa Pang, Kian-Lee Tan, Anthony K. H. Tung	DSIM: A Distance-Based Indexing Method for Genomic Sequences.	BIBE	2005	DBLP DOI BibTeX RDF
34	James Newsome, Brad Karp, Dawn Xiaodong Song	Polygraph: Automatically Generating Signatures for Polymorphic Worms.	S&P	2005	DBLP DOI BibTeX RDF
34	Alberto Apostolico, Cinzia Pizzi	Monotone Scoring of Patterns with Mismatches: (Extended Abstract).	WABI	2004	DBLP DOI BibTeX RDF
34	Alberto Apostolico, Mary Ellen Bock, Stefano Lonardi	Monotony of surprise and large-scale quest for unusual words.	RECOMB	2002	DBLP DOI BibTeX RDF
34	Sam Rash, Dan Gusfield	String barcoding: uncovering optimal virus signatures.	RECOMB	2002	DBLP DOI BibTeX RDF	string barcoding, virus signatures, suffix trees, barcoding, testing set
34	Dana Shapira, James A. Storer	Edit Distance with Move Operations.	CPM	2002	DBLP DOI BibTeX RDF
34	Yasuhiro Yamada, Daisuke Ikeda, Sachio Hirokawa	SCOOP: A Record Extractor without Knowledge on Input.	Discovery Science	2001	DBLP DOI BibTeX RDF
34	Giancarlo Mauri, Giulio Pavesi	Parallel Algorithms for the Analysis of Biological Sequences.	PaCT	2001	DBLP DOI BibTeX RDF
34	Gerth Stølting Brodal, Christian N. S. Pedersen	Finding Maximal Quasiperiodicities in Strings.	CPM	2000	DBLP DOI BibTeX RDF
34	Brenda S. Baker, Raffaele Giancarlo	Longest Common Subsequence from Fragments via Sparse Dynamic Programming.	ESA	1998	DBLP DOI BibTeX RDF
34	Yahiko Kambayashi, Narao Nakatsu, Shuzo Yajima	Data compression procedures utilizing the similarity of data.	AFIPS National Computer Conference	1981	DBLP DOI BibTeX RDF
33	Ge Nong, Sen Zhang, Wai Hong Chan	Linear Time Suffix Array Construction Using D-Critical Substrings.	CPM	2009	DBLP DOI BibTeX RDF
33	Carlos E. R. Alves, Edson Cáceres, Siang Wun Song	A Coarse-Grained Parallel Algorithm for the All-Substrings Longest Common Subsequence Problem.	Algorithmica	2006	DBLP DOI BibTeX RDF
33	Andrey Yu. Rumyantsev, M. A. Ushakov	Forbidden Substrings, Kolmogorov Complexity and Almost Periodic Sequences.	STACS	2006	DBLP DOI BibTeX RDF
33	Carlos E. R. Alves, Edson Cáceres, Siang W. Song	A BSP/CGM Algorithm for the All-Substrings Longest Common Subsequence Problem.	IPDPS	2003	DBLP DOI BibTeX RDF	Parallel algorithms, longest common subsequence, LCS, BSP, CGM
33	Sarah Chan, Ben Kao, Chi Lap Yip, Michael Tang	Mining Emerging Substrings.	DASFAA	2003	DBLP DOI BibTeX RDF
33	Wei Fu, Wing-Kai Hon, Wing-Kin Sung	On All-Substrings Alignment Problems.	COCOON	2003	DBLP DOI BibTeX RDF
33	Alberto Apostolico, Mary Ellen Bock, Stefano Lonardi	Linear Global Detectors of Redundant and Rare Substrings.	Data Compression Conference	1999	DBLP DOI BibTeX RDF
33	Heiko Goeman	On Parsing and Condensing Substrings of LR Languages in Linear Time.	Workshop on Implementing Automata	1998	DBLP DOI BibTeX RDF
25	Süleyman Cenk Sahinalp, Uzi Vishkin	Efficient Approximate and Dynamic Matching of Patterns Using a Labeling Paradigm (extended abstract).	FOCS	1996	DBLP DOI BibTeX RDF	efficient approximate pattern matching, efficient dynamic pattern matching, labeling paradigm, string processing algorithmics, suffix tree construction, dynamic dictionary matching, dynamic text indexing, inserted characters, deleted characters, replaced characters, pattern matching, approximate string matching, optimal parallel algorithm, substrings
25	Sam M. Kim, Robert McNaughton, Robert McCloskey	A Polynomial Time Algorithm for the Local Testability Problem of Deterministic Finite Automata.	IEEE Trans. Computers	1991	DBLP DOI BibTeX RDF	local testability, locally testable language, nonnegative integer, prefix, suffix, computational complexity, polynomial time algorithm, formal languages, finite automata, word, deterministic finite automata, deterministic automata, substrings
25	Ming Li 0001	Towards a DNA Sequencing Theory (Learning a String) (Preliminary Version)	FOCS	1990	DBLP DOI BibTeX RDF	shortest common superstring, superstring learning, randomly drawn substrings, samples, efficient algorithm, DNA sequencing
23	Yury Lifshits, Shay Mozes, Oren Weimann, Michal Ziv-Ukelson	Speeding Up HMM Decoding and Training by Exploiting Sequence Repetitions.	Algorithmica	2009	DBLP DOI BibTeX RDF	Dynamic programming, HMM, Compression, Viterbi
23	Jeff Pasternack, Dan Roth	Learning better transliterations.	CIKM	2009	DBLP DOI BibTeX RDF	multi-lingual information retrieval, probabilistic models, translation, transliteration
23	Orgad Keller, Tsvi Kopelowitz, Shir Landau, Moshe Lewenstein	Generalized Substring Compression.	CPM	2009	DBLP DOI BibTeX RDF
23	Ge Nong, Sen Zhang, Wai Hong Chan	Linear Suffix Array Construction by Almost Pure Induced-Sorting.	DCC	2009	DBLP DOI BibTeX RDF
23	Chunmei Liu, Yinglei Song, Legand L. Burge III	Parameterized lower bound and inapproximability of polylogarithmic string barcoding.	J. Comb. Optim.	2008	DBLP DOI BibTeX RDF	Polylogarithmic string barcoding, Parameterized lower bound, Inapproximability
23	Bhadrachalam Chitturi, Ivan Hal Sudborough	Bounding Prefix Transposition Distance for Strings and Permutations.	HICSS	2008	DBLP DOI BibTeX RDF
23	Roman Kolpakov, Mathieu Raffinot	Faster Text Fingerprinting.	SPIRE	2008	DBLP DOI BibTeX RDF
23	Faraz Rasheed, Mohammed Al-Shalalfa, Reda Alhajj	Adapting Machine Learning Technique for Periodicity Detection in Nucleosomal Locations in Sequences.	IDEAL	2007	DBLP DOI BibTeX RDF
23	Orgad Keller, Tsvi Kopelowitz, Moshe Lewenstein	Range Non-overlapping Indexing and Successive List Indexing.	WADS	2007	DBLP DOI BibTeX RDF
23	Dan He	A Novel Greedy Algorithm for the Minimum Common String Partition Problem.	ISBRA	2007	DBLP DOI BibTeX RDF
23	Danny Hermelin, Dror Rawitz, Romeo Rizzi, Stéphane Vialette	The Minimum Substring Cover Problem.	WAOA	2007	DBLP DOI BibTeX RDF
23	Ayelet Butman, Noa Lewenstein, Benny Porat, Ely Porat	Jump-Matching with Errors.	SPIRE	2007	DBLP DOI BibTeX RDF
23	Roman Kolpakov, Mathieu Raffinot	New Algorithms for Text Fingerprinting.	CPM	2006	DBLP DOI BibTeX RDF
23	L. Paul Chew	Exact computation of protein structure similarity.	SCG	2006	DBLP DOI BibTeX RDF	protein geometry, structure comparison, dynamic programming, global optimization, convex hull, proteins, protein structure, extreme points
23	Dell Zhang, Wee Sun Lee	Extracting key-substring-group features for text classification.	KDD	2006	DBLP DOI BibTeX RDF	machine learning, feature extraction, text mining, text classification, suffix tree
23	Jürgen Kleffe, Friedrich Möller, Burghardt Wittig	ClustDB: A High-Performance Tool for Large Scale Sequence Matching.	DEXA Workshops	2006	DBLP DOI BibTeX RDF
23	Tak-Man Ma, Yuh-Dauh Lyuu, Yen-Wu Ti	An Efficient Algorithm for Finding Long Conserved Regions Between Genes.	CompLife	2006	DBLP DOI BibTeX RDF
23	Jérôme Callut, Pierre Dupont	Sequence Discrimination Using Phase-Type Distributions.	ECML	2006	DBLP DOI BibTeX RDF	Supervised sequence classification, Markov chains, Expectation-Maximization, First passage times, Jensen-Shannon divergence
23	Marek Chrobak, Petr Kolman, Jirí Sgall	The greedy algorithm for the minimum common string partition problem.	ACM Trans. Algorithms	2005	DBLP DOI BibTeX RDF	approximation algorithms, String algorithms
23	Marcello Dalpasso, Giuseppe Lancia, Romeo Rizzi	The String Barcoding Problem is NP-Hard.	Comparative Genomics	2005	DBLP DOI BibTeX RDF
23	Utku Irmak, Torsten Suel	Hierarchical substring caching for efficient content distribution to low-bandwidth clients.	WWW	2005	DBLP DOI BibTeX RDF	WWW, compression, HTTP, web caching, web proxies
23	François Nicolas, Eric Rivals	Hardness of Optimal Spaced Seed Design.	CPM	2005	DBLP DOI BibTeX RDF
23	Yo-Sub Han, Derick Wood	A New Linearizing Restriction in the Pattern Matching Problem.	FCT	2005	DBLP DOI BibTeX RDF	string pattern matching, design and analysis of algorithms, Automata and formal languages
23	Yuji Kawada, Yasubumi Sakakibara	Discriminative Discovery of Transcription Factor Binding Sites from Location Data.	CSB	2005	DBLP DOI BibTeX RDF
23	Simon Sheu, Alan Chang, Webber Huang	Fast Similarity Search in String Databases.	AINA	2005	DBLP DOI BibTeX RDF
23	Vijay Karamcheti, Davi Geiger, Zvi M. Kedem, S. Muthukrishnan 0001	Detecting malicious network traffic using inverse distributions of packet contents.	MineNet	2005	DBLP DOI BibTeX RDF	inverse distribution, worms, content analysis
23	Jinuk Bae, Sukho Lee	Estimating the Number of Substring Matches in Long String Databases.	APWeb	2005	DBLP DOI BibTeX RDF
23	Svante Janson, Stefano Lonardi, Wojciech Szpankowski	On the Average Sequence Complexity.	CPM	2004	DBLP DOI BibTeX RDF
23	Martin Kay	Substring Alignment Using Suffix Trees.	CICLing	2004	DBLP DOI BibTeX RDF
23	Marek Chrobak, Petr Kolman, Jirí Sgall	The Greedy Algorithm for the Minimum Common String Partition Problem.	APPROX-RANDOM	2004	DBLP DOI BibTeX RDF
23	Jiong Yang 0001, Wei Wang 0010, Philip S. Yu	BASS: Approximate Search on Large String Databases.	SSDBM	2004	DBLP DOI BibTeX RDF
23	Avraham Trakhtman	Reducing the Time Complexity of Testing for Local Threshold Testability.	CIAA	2003	DBLP DOI BibTeX RDF	threshold locally testable, algorithm, graph, Automaton
23	Tugkan Batu, Funda Ergün, Joe Kilian, Avner Magen, Sofya Raskhodnikova, Ronitt Rubinfeld, Rahul Sami	A sublinear algorithm for weakly approximating edit distance.	STOC	2003	DBLP DOI BibTeX RDF	approximation, string matching, sublinear algorithms
23	Carlos E. R. Alves, Edson Cáceres, Frank K. H. A. Dehne	Parallel dynamic programming for solving the string editing problem on a CGM/BSP.	SPAA	2002	DBLP DOI BibTeX RDF	parallel algorithms, dynamic programming, BSP, CGM, string editing
23	Stefan Burkhardt, Juha Kärkkäinen	Better Filtering with Gapped q-Grams.	CPM	2001	DBLP DOI BibTeX RDF
23	Masayuki Takeda, Tetsuya Matsumoto, Tomoko Fukuda, Ichiro Nanri	Discovering Characteristic Expressions from Literary Works: A New Text Analysis Method beyond N-Gram Statistics and KWIC.	Discovery Science	2000	DBLP DOI BibTeX RDF
23	A. N. Trahtman	An Algorithm to Verify Local Threshold Testability of Deterministic Finite Automata.	WIA	1999	DBLP DOI BibTeX RDF	locally threshold testable, semigroup AMS subject classification 68Q25, 68Q68, 20M07, algorithm, deterministic finite automaton, 68Q45
23	Rainer Feldmann, Burkhard Monien, Peter Mysliwietz, Stefan Tschöke	A Better Upper Bound on the Bisection Width of de Bruijn Networks (Extended Abstract).	STACS	1997	DBLP DOI BibTeX RDF
23	Süleyman Cenk Sahinalp, Uzi Vishkin	On a Parallel-Algorithms Method for String Matching Problems.	CIAC	1994	DBLP DOI BibTeX RDF
23	Sam M. Kim, Robert McNaughton	Computing the Order of a Locally Testable Automaton.	FSTTCS	1991	DBLP DOI BibTeX RDF
23	Pedro García 0001, Enrique Vidal 0001	Inference of k-Testable Languages in the Strict Sense and Application to Syntactic Pattern Recognition.	IEEE Trans. Pattern Anal. Mach. Intell.	1990	DBLP DOI BibTeX RDF	k-testable languages, deterministic finite-state automation, pattern recognition, computational complexity, inference mechanisms, formal languages, finite automata, grammars, grammars, strings, inductive inference, syntactic pattern recognition, inference algorithm
23	Sam M. Kim, Robert McNaughton, Robert McCloskey	An Upper Bound on the Order of Locally Testable Deterministic Finite Automata.	Optimal Algorithms	1989	DBLP DOI BibTeX RDF
22	Takahiro Ota, Akiko Manada	A Reconstruction of Circular Binary String Using Substrings and Minimal Absent Words.	IEICE Trans. Fundam. Electron. Commun. Comput. Sci.	2024	DBLP DOI BibTeX RDF
22	Zhiwen Lu, Lu Guo, Jianhua Chen, Rongshu Wang	Reference-based genome compression using the longest matched substrings with parallelization consideration.	BMC Bioinform.	2023	DBLP DOI BibTeX RDF
22	Kazuki Mitani, Takuya Mieno, Kazuhisa Seto, Takashi Horiyama	Finding top-k longest palindromes in substrings.	Theor. Comput. Sci.	2023	DBLP DOI BibTeX RDF
22	Yonatan Yehezkeally, Daniella Bar-Lev, Sagi Marcovich, Eitan Yaakobi	Generalized Unique Reconstruction From Substrings.	IEEE Trans. Inf. Theory	2023	DBLP DOI BibTeX RDF
22	Kel Levick, Ilan Shomorony	Fundamental Limits of Multiple Sequence Reconstruction from Substrings.	CoRR	2023	DBLP DOI BibTeX RDF
22	Hengjia Wei, Moshe Schwartz 0001, Gennian Ge	Reconstruction from Noisy Substrings.	CoRR	2023	DBLP DOI BibTeX RDF
22	Ádám Pintér, Sándor Szénási	GPU Acceleration of Longest Common Substrings Algorithm.	SACI	2023	DBLP DOI BibTeX RDF
22	Kel Levick, Ilan Shomorony	Fundamental Limits of Multiple Sequence Reconstruction from Substrings.	ISIT	2023	DBLP DOI BibTeX RDF
22	Travis Gagie, Sana Kashgouli, Gonzalo Navarro 0001	A Simple Grammar-Based Index for Finding Approximately Longest Common Substrings.	SPIRE	2023	DBLP DOI BibTeX RDF
22	Takuya Mieno, Yuta Fujishige, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda	Computing Minimal Unique Substrings for a Sliding Window.	Algorithmica	2022	DBLP DOI BibTeX RDF
22	Michele Bevilacqua, Giuseppe Ottaviano, Patrick S. H. Lewis, Wen-tau Yih, Sebastian Riedel 0001, Fabio Petroni	Autoregressive Search Engines: Generating Substrings as Document Identifiers.	CoRR	2022	DBLP DOI BibTeX RDF
22	Yonatan Yehezkeally, Daniella Bar-Lev, Sagi Marcovich, Eitan Yaakobi	Reconstruction from Substrings with Partial Overlap.	CoRR	2022	DBLP DOI BibTeX RDF