Search results for "subsequence"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
34	Zdenek Tronícek	Common Subsequence Automaton.	CIAA	2002	DBLP DOI BibTeX RDF
34	B. John Oommen, R. K. S. Loke	On the Pattern Recognition of Noisy Subsequence Trees.	IEEE Trans. Pattern Anal. Mach. Intell.	2001	DBLP DOI BibTeX RDF
34	Yang-Sae Moon, Kyu-Young Whang, Woong-Kee Loh	Duality-Based Subsequence Matching in Time-Series Databases.	ICDE	2001	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	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
34	Koji Hakata, Hiroshi Imai	The Longest Common Subsequence Problem for Small Alphabet Size Between Many Strings.	ISAAC	1992	DBLP DOI BibTeX RDF
34	Hua Lin, Mi Lu, Jesse Zhixi Fang	An optimal algorithm for the longest common subsequence problem.	SPDP	1991	DBLP DOI BibTeX RDF
34	Alfred V. Aho, Daniel S. Hirschberg, Jeffrey D. Ullman	Bounds on the Complexity of the Longest Common Subsequence Problem.	J. ACM	1976	DBLP DOI BibTeX RDF
33	Carlos Eduardo Rodrigues Alves, Edson Norberto Cáceres, Siang Wun Song	Efficient Representations of Row-Sorted 1-Variant Matrices for Parallel String Applications.	ICA3PP	2007	DBLP DOI BibTeX RDF	row-sorted 1-variant matrices, all-substring longest common subsequence, parallel algorithms, data structure, longest common subsequence
33	Michael S. Hsiao, Elizabeth M. Rudnick, Janak H. Patel	Fast Algorithms for Static Compaction of Sequential Circuit Test Vectors.	VTS	1997	DBLP DOI BibTeX RDF	inert subsequence, recurrence subsequence, test set compaction
31	Wei Liu, Lin Chen	A Fast Longest Common Subsequence Algorithm for Biosequences Alignment.	CCTA	2007	DBLP DOI BibTeX RDF	identical character pair, bioinformatics, longest common subsequence
30	Manuel Lafond, Wenfeng Lai, Adiesha Liyanage, Binhai Zhu	The Longest Subsequence-Repeated Subsequence Problem.	CoRR	2023	DBLP DOI BibTeX RDF
30	Manuel Lafond, Wenfeng Lai, Adiesha Liyanage, Binhai Zhu	The Longest Subsequence-Repeated Subsequence Problem.	COCOA (1)	2023	DBLP DOI BibTeX RDF
30	Alireza Abdi, Mohsen Hooshmand	Longest Common Subsequence: Tabular vs. Closed-Form Equation Computation of Subsequence Probability.	CoRR	2022	DBLP DOI BibTeX RDF
30	Elizabeth J. Itskovich, Vadim E. Levit	What Do a Longest Increasing Subsequence and a Longest Decreasing Subsequence Know about Each Other?	Algorithms	2019	DBLP DOI BibTeX RDF
30	Md. Mahbubul Hasan, A. S. M. Sohidull Islam, M. Sohel Rahman, Ayon Sen	Palindromic Subsequence Automata and Longest Common Palindromic Subsequence.	Math. Comput. Sci.	2017	DBLP DOI BibTeX RDF
30	Xiaodong Wang 0003, Daxin Zhu	Efficient Computation for the Longest Common Subsequence with Substring Inclusion and Subsequence Exclusion Constraints.	SmartCom	2016	DBLP DOI BibTeX RDF
29	Carlos E. R. Alves, Edson Norberto Cáceres, Siang Wun Song	A BSP/CGM Algorithm for Finding All Maximal Contiguous Subsequences of a Sequence of Numbers.	Euro-Par	2006	DBLP DOI BibTeX RDF
29	Longin Jan Latecki, Vasileios Megalooikonomou, Qiang Wang 0010, Rolf Lakämper, Chotirat (Ann) Ratanamahatana, Eamonn J. Keogh	Partial Elastic Matching of Time Series.	ICDM	2005	DBLP DOI BibTeX RDF
29	Haixun Wang, Xiaofeng Meng 0001	On the Sequencing of Tree Structures for XML Indexing.	ICDE	2005	DBLP DOI BibTeX RDF
29	Jiong Yang 0001, Wei Wang 0010, Philip S. Yu	Mining Asynchronous Periodic Patterns in Time Series Data.	IEEE Trans. Knowl. Data Eng.	2003	DBLP DOI BibTeX RDF	Asynchronous periodic pattern, segment-based approach, partial periodicity
29	Amihood Amir, Kenneth Ward Church, Emanuel Dar	Separable attributes: a technique for solving the sub matrices character count problem.	SODA	2002	DBLP BibTeX RDF
29	Tiecheng Liu, John R. Kender	Optimization Algorithms for the Selection of Key Frame Sequences of Variable Length.	ECCV (4)	2002	DBLP DOI BibTeX RDF
29	Dimitrios Gunopulos, Gautam Das 0001	Time Series Similarity Measures and Time Series Indexing.	SIGMOD Conference	2001	DBLP DOI BibTeX RDF
29	Wen-Chen Hu, Mark S. Schmalz, Gerhard X. Ritter	Image Retrieval Using the Longest Approximate Common Subsequences.	ICMCS, Vol. 2	1999	DBLP DOI BibTeX RDF	Longest approximate common subsequences, Line string, Image databases
29	Edward K. Blum, Philip C. Curtis Jr.	Asymptotic Behavior of the Best Polynomial Approximation.	J. ACM	1961	DBLP DOI BibTeX RDF
26	Vinod P. Nair, Vijay Laxmi, Manoj Singh Gaur, G. V. S. S. Phani Kumar, Yadvendra S. Chundawat	Static CFG analyzer for metamorphic Malware code.	SIN	2009	DBLP DOI BibTeX RDF	metamorphic malware, normalization, obfuscation, control flow graph, longest common subsequence
26	Ping Luo 0001, Jian Fan, Sam Liu, Fen Lin, Yuhong Xiong, Jerry Liu	Web article extraction for web printing: a DOM+visual based approach.	ACM Symposium on Document Engineering	2009	DBLP DOI BibTeX RDF	article extraction, maximal scoring subsequence
26	Lian'en Huang, Lei Wang, Xiaoming Li	Achieving both high precision and high recall in near-duplicate detection.	CIKM	2008	DBLP DOI BibTeX RDF	web document repository, similarity, sketch, fingerprint, longest common subsequence, near-duplicate
26	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
26	Francisco Nivando Bezerra, Neucimar Jerônimo Leite	Using string matching to detect video transitions.	Pattern Anal. Appl.	2007	DBLP DOI BibTeX RDF	Video transition detection, Video slice, Longest common subsequence
26	Iman S. H. Suyoto, Alexandra L. Uitdenbogerd, Falk Scholer	Effective retrieval of polyphonic audio with polyphonic symbolic queries.	Multimedia Information Retrieval	2007	DBLP DOI BibTeX RDF	polyphony, dynamic programming, audio, music information retrieval, longest common subsequence, symbolic, transcription
26	Michail Vlachos, Marios Hadjieleftheriou, Dimitrios Gunopulos, Eamonn J. Keogh	Indexing Multidimensional Time-Series.	VLDB J.	2006	DBLP DOI BibTeX RDF	Ensemble index, Motion capture, Trajectories, Dynamic time warping, Longest common subsequence
26	Hsiao Ping Lee, Yin-Te Tsai, Chuan Yi Tang	A seriate coverage filtration approach for homology search.	SAC	2004	DBLP DOI BibTeX RDF	incrementally decreasing covers, longest increasing subsequence problems, lossless filtration, seriate coverage, homology search
26	Michail Vlachos, Marios Hadjieleftheriou, Dimitrios Gunopulos, Eamonn J. Keogh	Indexing multi-dimensional time-series with support for multiple distance measures.	KDD	2003	DBLP DOI BibTeX RDF	trajectories, dynamic time warping, longest common subsequence
26	Francisco Nivando Bezerra, Neucimar Jerônimo Leite	Video Transition Detection Using String Matching: Preliminary Results.	SIBGRAPI	2003	DBLP DOI BibTeX RDF	video transition detection, visual rhythm, longest common subsequence, video parsing
26	Xiaoping Tang, D. F. Wong 0001	Floorplanning with alignment and performance constraints.	DAC	2002	DBLP DOI BibTeX RDF	floorplanning, longest common subsequence, sequence pair
26	Alan A. Bertossi, Alessandro Mei	Constant Time Dynamic Programming on Directed Reconfigurable Networks.	IEEE Trans. Parallel Distributed Syst.	2000	DBLP DOI BibTeX RDF	directed links, VLSI, dynamic programming, shortest paths, Reconfigurable architectures, longest common subsequence
26	Zdenek Tronícek	Problems Related to Subsequences and Supersequences.	SPIRE/CRIWG	1999	DBLP DOI BibTeX RDF	supersequence, Directed Acyclic Supersequence Graph, seaching subsequences, subsequence
26	Minoru Asogawa, Yukiko Fujiwara, Akihiko Konagaya	A combination of a functional motif model and a structural motif model for a database validation.	HICSS (5)	1995	DBLP DOI BibTeX RDF	functional motif model, structural motif model, database validation, leucine zipper motif, twisted alpha helix sequences, DNA binding site, alpha helix region, Swiss Protein database, helical structures, PDB database, neural network, hidden Markov models, HMM, hidden Markov model, database management systems, neural nets, DNA, genetics, biology computing, subsequence
25	Wook-Shin Han, Jinsoo Lee, Yang-Sae Moon, Seung-won Hwang, Hwanjo Yu	A new approach for processing ranked subsequence matching based on ranked union.	SIGMOD Conference	2011	DBLP DOI BibTeX RDF
25	Matthew K. Franklin, Mark A. Gondree, Payman Mohassel	Communication-Efficient Private Protocols for Longest Common Subsequence.	CT-RSA	2009	DBLP DOI BibTeX RDF
25	Orgad Keller, Tsvi Kopelowitz, Moshe Lewenstein	On the Longest Common Parameterized Subsequence.	CPM	2008	DBLP DOI BibTeX RDF
25	Dmitry Korkin, Qingguo Wang, Yi Shang	An Efficient Parallel Algorithm for the Multiple Longest Common Subsequence (MLCS) Problem.	ICPP	2008	DBLP DOI BibTeX RDF
25	Alexander K. Seewald, Florian Kleedorfer	Lambda pruning: an approximation of the string subsequence kernel for practical SVM classification and redundancy clustering.	Adv. Data Anal. Classif.	2007	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000) 68T05, 93A30, 90C59
25	Christian Blum 0001, Maria J. Blesa	Probabilistic Beam Search for the Longest Common Subsequence Problem.	SLS	2007	DBLP DOI BibTeX RDF
25	Longin Jan Latecki, Qiang Wang 0010, Suzan Köknar-Tezel, Vasileios Megalooikonomou	Optimal Subsequence Bijection.	ICDM	2007	DBLP DOI BibTeX RDF
25	Marina Barsky, Ulrike Stege, Alex Thomo, Chris Upton	Shortest Path Approaches for the Longest Common Subsequence of a Set of Strings.	BIBE	2007	DBLP DOI BibTeX RDF
25	Anna Gál, Parikshit Gopalan	Lower Bounds on Streaming Algorithms for Approximating the Length of the Longest Increasing Subsequence.	FOCS	2007	DBLP DOI BibTeX RDF
25	Dariusz Król 0001, Grzegorz Stanislaw Kukla	Distributed Code and Data Propagation Algorithm for Longest Common Subsequence Problem Solving.	KES-AMSTA	2007	DBLP DOI BibTeX RDF
25	M. Sohel Rahman, Costas S. Iliopoulos	Algorithms for Computing Variants of the Longest Common Subsequence Problem.	ISAAC	2006	DBLP DOI BibTeX RDF
25	Tsuyoshi Idé	Why Does Subsequence Time-Series Clustering Produce Sine Waves?	PKDD	2006	DBLP DOI BibTeX RDF
25	Tsuyoshi Idé	Translational Symmetry in Subsequence Time-Series Clustering.	JSAI	2006	DBLP DOI BibTeX RDF
25	Peter Krusche, Alexandre Tiskin	Efficient Longest Common Subsequence Computation Using Bulk-Synchronous Parallelism.	ICCSA (5)	2006	DBLP DOI BibTeX RDF
25	Osmar R. Zaïane, Yang Wang, Randy Goebel, Gregory J. Taylor	Frequent Subsequence-Based Protein Localization.	BioDM	2006	DBLP DOI BibTeX RDF
25	Xiuzhen Huang	Lower Bounds and Parameterized Approach for Longest Common Subsequence.	COCOON	2006	DBLP DOI BibTeX RDF
25	Wun-Tat Chan, Yong Zhang 0001, Stanley P. Y. Fung, Deshi Ye, Hong Zhu 0004	Efficient Algorithms for Finding a Longest Common Increasing Subsequence.	ISAAC	2005	DBLP DOI BibTeX RDF
25	Xiao-hua Xu, Ling Chen 0005, Yi Pan 0001, Ping He 0001	Fast Parallel Algorithms for the Longest Common Subsequence Problem Using an Optical Bus.	ICCSA (3)	2005	DBLP DOI BibTeX RDF
25	Lasse Bergroth	Utilizing Dynamically Updated Estimates in Solving the Longest Common Subsequence Problem.	SPIRE	2005	DBLP DOI BibTeX RDF
25	Jian-Wei Liu, Shou-Jian Yu, Jia-Jin Le	The Dimension-Reduced Multi-scale Histogram: A New Method for Fast and Efficient Retrieval of Similar Time Sequences and Subsequence.	WAIM	2004	DBLP DOI BibTeX RDF
25	Adrian Kosowski	An Efficient Algorithm for the Longest Tandem Scattered Subsequence Problem.	SPIRE	2004	DBLP DOI BibTeX RDF
25	Marcos A. Kiwi, Martin Loebl, Jirí Matousek 0001	Expected Length of the Longest Common Subsequence for Large Alphabets.	LATIN	2004	DBLP DOI BibTeX RDF
25	Thierry Garcia, Jean Frédéric Myoupo, David Semé	A Coarse-Grained Multicomputer Algorithm for the Longest Common Subsequence Problem.	PDP	2003	DBLP DOI BibTeX RDF
25	Teddy Siu Fung Wong, Man Hon Wong 0001	Efficient Subsequence Matching for Sequences Databases under Time Warping.	IDEAS	2003	DBLP DOI BibTeX RDF
25	Lasse Bergroth, Harri Hakonen, Juri Väisänen	New Refinement Techniques for Longest Common Subsequence Algorithms.	SPIRE	2003	DBLP DOI BibTeX RDF
25	Xiaoping Tang, Ruiqi Tian, Martin D. F. Wong	Fast evaluation of sequence pair in block placement by longestcommon subsequence computation.	IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.	2001	DBLP DOI BibTeX RDF
25	Guo-Hui Lin, Zhi-Zhong Chen, Tao Jiang 0001, Jianjun Wen	The Longest Common Subsequence Problem for Sequences with Nested Arc Annotations.	ICALP	2001	DBLP DOI BibTeX RDF
25	Xiaoping Tang, D. F. Wong 0001, Ruiqi Tian	Fast Evaluation of Sequence Pair in Block Placement by Longest Common Subsequence Computation.	DATE	2000	DBLP DOI BibTeX RDF
25	Vlado Dancík, Mike Paterson	Upper Bounds for the Expected Length of a Longest Common Subsequence of Two Binary Sequences.	STACS	1994	DBLP DOI BibTeX RDF	Classification computational complexity, stringmatching, average-case analysis
19	Peter Krusche, Alexander Tiskin	New algorithms for efficient parallel string comparison.	SPAA	2010	DBLP DOI BibTeX RDF	BSP algorithms, longest increasing subsequences, longest common subsequences
19	D. T. Lee, Tien-Ching Lin, Hsueh-I Lu	Fast Algorithms for the Density Finding Problem.	Algorithmica	2009	DBLP DOI BibTeX RDF	Maximum-density segment problem, Density finding problem, Slope selection problem, GC content, Computational geometry, Bioinformatics, Convex hull, DNA sequence
19	Bolin Ding, David Lo 0001, Jiawei Han 0001, Siau-Cheng Khoo	Efficient Mining of Closed Repetitive Gapped Subsequences from a Sequence Database.	ICDE	2009	DBLP DOI BibTeX RDF
19	Niall J. Haslam, Toby J. Gibson	EpiC: A Resource for Integrating Information and Analyses to Enable Selection of Epitopes for Antibody Based Experiments.	DILS	2009	DBLP DOI BibTeX RDF
19	Amihood Amir, Zvi Gotthilf, B. Riva Shalom	Weighted LCS.	IWOCA	2009	DBLP DOI BibTeX RDF
19	Congnan Luo, Soon M. Chung	A scalable algorithm for mining maximal frequent sequences using a sample.	Knowl. Inf. Syst.	2008	DBLP DOI BibTeX RDF	Maximal frequent sequences, Data mining, Performance analysis, Sampling, Signatures, Prefix tree
19	Jan Stola	Unimaximal Sequences of Pairs in Rectangle Visibility Drawing.	GD	2008	DBLP DOI BibTeX RDF
19	Francisco Claude, Gonzalo Navarro 0001, Hannu Peltola, Leena Salmela, Jorma Tarhio	Speeding Up Pattern Matching by Text Sampling.	SPIRE	2008	DBLP DOI BibTeX RDF
19	Cristina G. Fernandes, Carlos Eduardo Ferreira, Christian Tjandraatmadja, Yoshiko Wakabayashi	A Polyhedral Investigation of the LCS Problem and a Repetition-Free Variant.	LATIN	2008	DBLP DOI BibTeX RDF
19	Yueguo Chen, Mario A. Nascimento, Beng Chin Ooi, Anthony K. H. Tung	SpADe: On Shape-based Pattern Detection in Streaming Time Series.	ICDE	2007	DBLP DOI BibTeX RDF
19	Sijung Kim, Geuk Lee, Bonghan Kim	The Design and Testing of Automated Signature Generation Engine for Worms Detection.	KES-AMSTA	2007	DBLP DOI BibTeX RDF
19	Guillaume Blin, Guillaume Fertin, Gaël Herry, Stéphane Vialette	Comparing RNA Structures: Towards an Intermediate Model Between the Editand the LapcsProblems.	BSB	2007	DBLP DOI BibTeX RDF	arc-annotated sequences, motif extraction, RNA structures
19	Hui Wang 0001, Zhiwei Lin 0002	A Novel Algorithm for Counting All Common Subsequences.	GrC	2007	DBLP DOI BibTeX RDF
19	Jens Gramm, Jiong Guo, Rolf Niedermeier	Pattern matching for arc-annotated sequences.	ACM Trans. Algorithms	2006	DBLP DOI BibTeX RDF	Arc-annotated sequences, dynamic programming, pattern matching, RNA secondary structure
19	David J. Grynkiewicz	A Weighted Erdös-Ginzburg-Ziv Theorem.	Comb.	2006	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000): 11B75, 05D99
19	Philippe Flajolet, Wojciech Szpankowski, Brigitte Vallée	Hidden word statistics.	J. ACM	2006	DBLP DOI BibTeX RDF	De Bruijn graph, combinatorial calculus, complex asymptotics, discrete probability, distributional analysis, Pattern matching, languages, generating functions, words, subsequences
19	Wolfgang Merkle, Jan Reimann 0001	Selection Functions that Do Not Preserve Normality.	Theory Comput. Syst.	2006	DBLP DOI BibTeX RDF
19	Eamonn J. Keogh, Jessica Lin 0001, Ada Wai-Chee Fu, Helga Van Herle	Finding Unusual Medical Time-Series Subsequences: Algorithms and Applications.	IEEE Trans. Inf. Technol. Biomed.	2006	DBLP DOI BibTeX RDF
19	David Liben-Nowell, Erik Vee, An Zhu	Finding longest increasing and common subsequences in streaming data.	J. Comb. Optim.	2006	DBLP DOI BibTeX RDF	Data-streaming model, Algorithms, Lower bounds, LCS, LIS
19	Rezaul Alam Chowdhury, Vijaya Ramachandran	Cache-oblivious dynamic programming.	SODA	2006	DBLP DOI BibTeX RDF
19	Gerth Stølting Brodal, Kanela Kaligosi, Irit Katriel, Martin Kutz	Faster Algorithms for Computing Longest Common Increasing Subsequences.	CPM	2006	DBLP DOI BibTeX RDF
19	Sun Wu, Hsien-Tsung Chang, Ting-Chao Hsu, Pei-Shin Liu	Approximate Keyword Search in Web Search Engines.	ICDIM	2006	DBLP DOI BibTeX RDF
19	Longin Jan Latecki, Vasilis Megalooikonomou, Qiang Wang 0010, Rolf Lakämper, Chotirat (Ann) Ratanamahatana, Eamonn J. Keogh	Elastic Partial Matching of Time Series.	PKDD	2005	DBLP DOI BibTeX RDF
19	Koji Iwanuma, Ryuichi Ishihara, Yo Takano, Hidetomo Nabeshima	Extracting Frequent Subsequences from a Single Long Data Sequence: A Novel Anti-Monotonic Measure and a Simple On-Line Algorithm.	ICDM	2005	DBLP DOI BibTeX RDF
19	Ruben G. Lobo, Donald L. Bitzer, Mladen A. Vouk	Locally Invertible Multivariate Polynomial Matrices.	WCC	2005	DBLP DOI BibTeX RDF
19	Grzegorz Kondrak	N-Gram Similarity and Distance.	SPIRE	2005	DBLP DOI BibTeX RDF
19	I-Hsien Ting, Chris Kimble, Daniel Kudenko	UBB Mining: Finding Unexpected Browsing Behaviour in Clickstream Data to Improve a Web Site's Design.	Web Intelligence	2005	DBLP DOI BibTeX RDF
19	David Liben-Nowell, Erik Vee, An Zhu	Finding Longest Increasing and Common Subsequences in Streaming Data.	COCOON	2005	DBLP DOI BibTeX RDF
19	Jeremy Z. Kolter, Marcus A. Maloof	Using additive expert ensembles to cope with concept drift.	ICML	2005	DBLP DOI BibTeX RDF
19	Sen Jia, Yuntao Qian, Guang Dai	An Advanced Segmental Semi-Markov Model Based Online Series Pattern Detection.	ICPR (3)	2004	DBLP DOI BibTeX RDF	online pattern detection, series data mining, segmental semi-Markov model
19	Chia-Hsiung Lee, Chung-Wen Cho, Yi-Hung Wu, Arbee L. P. Chen	A Novel Representation of Sequence Data Based on Structural Information for Effective Music Retrieval.	DASFAA	2004	DBLP DOI BibTeX RDF	Markov-model, Sequential pattern, Music retrieval, Music representation