Search results for "Subsequence"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
119	Rao Li 0001	A space efficient algorithm for the constrained heaviest common subsequence problem.	ACM Southeast Regional Conference	2008	DBLP DOI BibTeX RDF	constrained heaviest common subsequence, constrained longest common subsequence, heaviest common subsequence, longest common subsequence
101	Tae Sik Han, Seung-Kyu Ko, Jaewoo Kang	Efficient Subsequence Matching Using the Longest Common Subsequence with a Dual Match Index.	MLDM	2007	DBLP DOI BibTeX RDF	Dual Match, Longest Common Subsequence, Subsequence matching
98	Hyun-Gil Koh, Woong-Kee Loh, Sang-Wook Kim	An Efficient Subsequence Matching Method Based on Index Interpolation.	IEA/AIE	2005	DBLP DOI BibTeX RDF	index interpolation, window size effect, time-series database, subsequence matching
91	Huanmei Wu, Betty Salzberg, Gregory C. Sharp, Steve B. Jiang, Hiroki Shirato, David R. Kaeli	Subsequence Matching on Structured Time Series Data.	SIGMOD Conference	2005	DBLP DOI BibTeX RDF
89	Michael S. Hsiao, Srimat T. Chakradhar	Test Set Compaction Using Relaxed Subsequence Removal.	J. Electron. Test.	2000	DBLP DOI BibTeX RDF	static test set compaction, support sets, recurrence subsequence, ATPG
86	Hiromasa Hoshino, Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa	Online Construction of Subsequence Automata for Multiple Texts.	SPIRE	2000	DBLP DOI BibTeX RDF	online construction, subsequence automata, multiple texts, subsequence automaton, minimum automaton, online algorithm, preprocessing, deterministic finite automaton, deterministic automata, alphabet
82	Klaus Dräger, Bernd Finkbeiner	Subsequence Invariants.	CONCUR	2008	DBLP DOI BibTeX RDF
82	Costas S. Iliopoulos, M. Sohel Rahman, Michal Vorácek, Ladislav Vagner	The Constrained Longest Common Subsequence Problem for Degenerate Strings.	CIAA	2007	DBLP DOI BibTeX RDF
79	Vassilis Athitsos, Panagiotis Papapetrou, Michalis Potamias, George Kollios, Dimitrios Gunopulos	Approximate embedding-based subsequence matching of time series.	SIGMOD Conference	2008	DBLP DOI BibTeX RDF	filter-and-refine retrieval, similarity indexing, time series, embeddings, dynamic time warping, subsequence matching
72	Seung-Hwan Lim, Heejin Park, Sang-Wook Kim	Using Multiple Indexes for Efficient Subsequence Matching in Time-Series Databases.	DASFAA	2006	DBLP DOI BibTeX RDF
70	Vit Niennattrakul, Chotirat Ann Ratanamahatana	Meaningful Subsequence Matching under Time Warping Distance for Data Stream.	PAKDD	2009	DBLP DOI BibTeX RDF	Dynamic Time Warping Distance, Data Stream, Normalization, Subsequence Matching
70	Bing Liu 0009, Jianjun Xu, Zhihui Wang 0009, Wei Wang 0009, Baile Shi	Subsequence Similarity Search Under Time Shifting.	RSKT	2006	DBLP DOI BibTeX RDF	Similarity search, subsequence, time shifting
70	Woong-Kee Loh, Sang-Wook Kim, Kyu-Young Whang	A Subsequence Matching Algorithm that Supports Normalization Transform in Time-Series Databases.	Data Min. Knowl. Discov.	2004	DBLP DOI BibTeX RDF	normalization transform, index interpolation, time-series databases, subsequence matching
70	Michael S. Hsiao, Srimat T. Chakradhar	State Relaxation Based Subsequence Removal for Fast Static Compaction in Sequential Circuits.	DATE	1998	DBLP DOI BibTeX RDF	test set compaction, state relaxation, recurrence subsequence removal, sequential circuit
63	Tak-Chung Fu, Hak-pun Chan, Fu-Lai Chung, Chak-man Ng	Time Series Subsequence Searching in Specialized Binary Tree.	FSKD	2006	DBLP DOI BibTeX RDF
60	Paola Bonizzoni, Gianluca Della Vedova, Riccardo Dondi, Guillaume Fertin, Raffaella Rizzi, Stéphane Vialette	Exemplar Longest Common Subsequence.	IEEE ACM Trans. Comput. Biol. Bioinform.	2007	DBLP DOI BibTeX RDF	combinatorial algorithms, comparative genomics, Longest common subsequence, algorithm design and analysis, analysis of algorithms and problem complexity
60	Abdullah N. Arslan	A Largest Common d-Dimensional Subsequence of Two d-Dimensional Strings.	FCT	2007	DBLP DOI BibTeX RDF	common subsequence, multi-dimensional string, dynamic programming, image, NP
60	Thomas Jansen 0001, Dennis Weyland	Analysis of evolutionary algorithms for the longest common subsequence problem.	GECCO	2007	DBLP DOI BibTeX RDF	longest common subsequence problem, crossover, run time analysis
60	David Semé	A CGM Algorithm Solving the Longest Increasing Subsequence Problem.	ICCSA (5)	2006	DBLP DOI BibTeX RDF	Longest Increasing Subsequence, Parallel Algorithms, Coarse Grained Multicomputers
60	Sang-Wook Kim, Byeong-Soo Jeong	Performance bottleneck in time-series subsequence matching.	SAC	2005	DBLP DOI BibTeX RDF	optimization, time-series databases, subsequence matching, performance bottleneck
60	Man-Soon Kim, Sang-Wook Kim, Miyoung Shin	Optimization of subsequence matching under time warping in time-series databases.	SAC	2005	DBLP DOI BibTeX RDF	time warping, time-series databases, subsequence matching
60	Woong-Kee Loh, Sang-Wook Kim	A subsequence matching algorithm supporting moving average transform of arbitrary order in time-series databases using index interpolation.	ADC	2001	DBLP DOI BibTeX RDF	index interpolation, moving average transform, time-series databases, subsequence matching
60	Tao Jiang 0001, Guohui Lin, Bin Ma 0002, Kaizhong Zhang	The Longest Common Subsequence Problem for Arc-Annotated Sequences.	CPM	2000	DBLP DOI BibTeX RDF	Sequence annotation, approximation algorithm, dynamic programming, longest common subsequence, maximum independent set, MAX SNP-hard
59	Yujiun P. Wang, Theodosios Pavlidis	Optimal Correspondence of String Subsequences.	IEEE Trans. Pattern Anal. Mach. Intell.	1990	DBLP DOI BibTeX RDF	string-to-string subsequence, string-to-regular-expression subsequence, string subsequences, optimal correspondent subsequence, finite alphabet editing error minimization matching, infinite alphabet penalty minimization matching, syntactic information, stereo epipolar line matching problem, UPC bar-code recognition, pattern recognition, computational complexity, computational complexity, metric, optimisation, template matching, relaxation, elastic matching, string distance, regular grammar
57	Panagiotis Papapetrou, Paul Doliotis, Vassilis Athitsos	Towards faster activity search using embedding-based subsequence matching.	PETRA	2009	DBLP DOI BibTeX RDF	embedding-based subsequence matching (EBSM), time series, embeddings, dynamic time warping, subsequence matching
57	Robert Gwadera, Mikhail J. Atallah, Wojciech Szpankowski	Reliable detection of episodes in event sequences.	Knowl. Inf. Syst.	2005	DBLP DOI BibTeX RDF	Episode pattern matching, Hidden pattern matching, Overrepresented and Underrepresented patterns, Data mining, Probabilistic analysis
57	Robert Gwadera, Mikhail J. Atallah, Wojciech Szpankowski	Reliable Detection of Episodes in Event Sequences.	ICDM	2003	DBLP DOI BibTeX RDF
55	Sergey Bereg, Marcin Kubica, Tomasz Walen, Binhai Zhu	RNA multiple structural alignment with longest common subsequences.	J. Comb. Optim.	2007	DBLP DOI BibTeX RDF	RNA multiple structure alignment, Dynamic programming, Longest common subsequence
55	Bryant A. Julstrom, Brenda Hinkemeyer	Starting from Scratch: Growing Longest Common Subsequences with Evolution.	PPSN	2006	DBLP DOI BibTeX RDF	initially empty solutions, genetic algorithm, Longest common subsequence
53	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
53	Yang-Sae Moon, Jin-Ho Kim	A Single Index Approach for Time-Series Subsequence Matching That Supports Moving Average Transform of Arbitrary Order.	PAKDD	2006	DBLP DOI BibTeX RDF
53	Huanmei Wu, Betty Salzberg, Donghui Zhang	Online Event-driven Subsequence Matching over Financial Data Streams.	SIGMOD Conference	2004	DBLP DOI BibTeX RDF
53	Yang-Sae Moon, Kyu-Young Whang, Wook-Shin Han	General match: a subsequence matching method in time-series databases based on generalized windows.	SIGMOD Conference	2002	DBLP DOI BibTeX RDF
50	Todd Easton, Abhilash Singireddy	A large neighborhood search heuristic for the longest common subsequence problem.	J. Heuristics	2008	DBLP DOI BibTeX RDF	Large neighborhood search, Dynamic programming, Heuristic, Longest common subsequence
50	Dennis Weyland	Simulated annealing, its parameter settings and the longest common subsequence problem.	GECCO	2008	DBLP DOI BibTeX RDF	longest common subsequence problem, simulated annealing, run time analysis
50	Thorsten Bernholt, Friedrich Eisenbrand, Thomas Hofmeister	A geometric framework for solving subsequence problems in computational biology efficiently.	SCG	2007	DBLP DOI BibTeX RDF	quasiconvex functions, subsequence problems, computational biology, Minkowski sums
50	Jung-Im Won, Sang-Kyoon Hong, Jeehee Yoon, Sanghyun Park 0003, Sang-Wook Kim	A Practical Method for Approximate Subsequence Search in DNA Databases.	PAKDD	2007	DBLP DOI BibTeX RDF	DNA database, approximate subsequence search, suffix tree
50	Panagiotis D. Michailidis, Konstantinos G. Margaritis	New Processor Array Architectures for the Longest Common Subsequence Problem.	J. Supercomput.	2005	DBLP DOI BibTeX RDF	longest common subsequence problem, parallel algorithms, VLSI, parallel architectures, linear processor arrays
50	Guillaume Blin, Guillaume Fertin, Romeo Rizzi, Stéphane Vialette	What Makes the Arc-Preserving Subsequence Problem Hard?	Trans. Comp. Sys. Biology	2005	DBLP DOI BibTeX RDF	Arc-Preserving Subsequence problem, Computational complexity, RNA structures
50	Guillaume Blin, Guillaume Fertin, Romeo Rizzi, Stéphane Vialette	What Makes the Arc-Preserving Subsequence Problem Hard?	International Conference on Computational Science (2)	2005	DBLP DOI BibTeX RDF	Arc-Preserving Subsequence, Computational complexity, RNA structures
50	Yen-Chun Lin, Jyh-Chian Chen	An Efficient Systolic Algorithm for the Longest Common Subsequence Problem.	J. Supercomput.	1998	DBLP DOI BibTeX RDF	parallel algorithm, VLSI, systolic array, multicomputer, Longest common subsequence
50	Mi Lu, Hua Lin	Parallel Algorithms for the Longest Common Subsequence Problem.	IEEE Trans. Parallel Distributed Syst.	1994	DBLP DOI BibTeX RDF	longest common subsequence problem, string subsequences, symbol deletion, decision tree model, CREW-PRAM model, concurrent-read exclusive-write parallel random-access machine, grid directed graph, maximum-cost path, totally monotone array, parallel algorithms, parallel algorithms, computational complexity, directed graphs, complexity bound
48	Zvi Gotthilf, Danny Hermelin, Moshe Lewenstein	Constrained LCS: Hardness and Approximation.	CPM	2008	DBLP DOI BibTeX RDF
45	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
45	Yaw-Ling Lin, Tao Jiang 0001, Kun-Mao Chao	Efficient Algorithms for Locating the Length-Constrained Heaviest Segments, with Applications to Biomolecular Sequence Analysis.	MFCS	2002	DBLP DOI BibTeX RDF	maximum consecutive subsequence, length constraint, biomolecular sequence analysis, ungapped local alignment, Algorithm, efficiency
44	Heng Tao Shen, Jie Shao 0001, Zi Huang, Xiaofang Zhou 0001	Effective and Efficient Query Processing for Video Subsequence Identification.	IEEE Trans. Knowl. Data Eng.	2009	DBLP DOI BibTeX RDF
44	Mi Zhou, Man Hon Wong 0001	Efficient Online Subsequence Searching in Data Streams under Dynamic Time Warping Distance.	ICDE	2008	DBLP DOI BibTeX RDF
44	Costas S. Iliopoulos, Marcin Kubica, M. Sohel Rahman, Tomasz Walen	Algorithms for Computing the Longest Parameterized Common Subsequence.	CPM	2007	DBLP DOI BibTeX RDF
44	Patrick Cégielski, Irène Guessarian, Yury Lifshits, Yuri V. Matiyasevich	Window Subsequence Problems for Compressed Texts.	CSR	2006	DBLP DOI BibTeX RDF
44	Paola Bonizzoni, Gianluca Della Vedova, Riccardo Dondi, Guillaume Fertin, Stéphane Vialette	Exemplar Longest Common Subsequence.	International Conference on Computational Science (2)	2006	DBLP DOI BibTeX RDF
44	Ming Dong Wan, Shou-Hsuan Stephen Huang, Jianhua Yang	Finding the Longest Similar Subsequence of Thumbprints for Intrusion Detection.	AINA (1)	2006	DBLP DOI BibTeX RDF
44	Jason R. Chen	Making Subsequence Time Series Clustering Meaningful.	ICDM	2005	DBLP DOI BibTeX RDF
44	Tassos Argyros, Charis Ermopoulos	Efficient Subsequence Matching in Time Series Databases Under Time and Amplitude Transformations.	ICDM	2003	DBLP DOI BibTeX RDF
44	Haixun Wang, Chang-Shing Perng	The S2-Tree : An Index Structure for Subsequence Matching of Spatial Objects.	PAKDD	2001	DBLP DOI BibTeX RDF
44	Masahiro Hirao, Hiromasa Hoshino, Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa	A Practical Algorithm to Find the Best Subsequence Patterns.	Discovery Science	2000	DBLP DOI BibTeX RDF
44	Mi Lu	Parallel Computation of Longest-Common-Subsequence.	ICCI	1990	DBLP DOI BibTeX RDF
44	Ricardo A. Baeza-Yates	The Subsequence Graph of a Text.	TAPSOFT, Vol.1	1989	DBLP DOI BibTeX RDF
42	Jianyong Wang 0001, Yuzhou Zhang, Lizhu Zhou, George Karypis, Charu C. Aggarwal	CONTOUR: an efficient algorithm for discovering discriminating subsequences.	Data Min. Knowl. Discov.	2009	DBLP DOI BibTeX RDF	Discriminating subsequence, Summarization subsequence, Clustering, Sequence mining
41	Anne Denton, Christopher Besemann, Dietmar H. Dorr	Pattern-based time-series subsequence clustering using radial distribution functions.	Knowl. Inf. Syst.	2009	DBLP DOI BibTeX RDF	Time series subsequence clustering, Clustering noisy data, Time series labeling, Density-based clustering, Noise elimination
41	Costas S. Iliopoulos, Mohammad Sohel Rahman	A New Efficient Algorithm for Computing the Longest Common Subsequence.	Theory Comput. Syst.	2009	DBLP DOI BibTeX RDF	Algorithms, Strings, Longest common subsequence
41	Jeff Pasternack, Dan Roth	Extracting article text from the web with maximum subsequence segmentation.	WWW	2009	DBLP DOI BibTeX RDF	maximum subsequence, page segmentation, text extraction
41		A PGAS-Based Algorithm for the Longest Common Subsequence Problem.	Euro-Par	2008	DBLP DOI BibTeX RDF	Unified Parallel C (UPC), Complexity design and analysis, Parallel computing, Longest common subsequence, Partitioned Global Address Space
41	Krzysztof Fabjanski, Tomasz Kruk	Network Traffic Classification by Common Subsequence Finding.	ICCS (1)	2008	DBLP DOI BibTeX RDF	common subsequence finding, bioinformatics algorithms, Clustal algorithm, Center Star method, automated generation of network attack signatures, anomaly detection, network intrusion detection systems, network traffic analysis
41	Elham Parvinnia, Mohammad Taheri, Koorush Ziarati	An Improved Longest Common Subsequence Algorithm for Reducing Memory Complexity in Global Alignment of DNA Sequences.	BMEI (1)	2008	DBLP DOI BibTeX RDF	Longest Common Subsequence (LCS), global alignment
41	Wun-Tat Chan, Yong Zhang 0001, Stanley P. Y. Fung, Deshi Ye, Hong Zhu 0004	Efficient algorithms for finding a longest common increasing subsequence.	J. Comb. Optim.	2007	DBLP DOI BibTeX RDF	Longest common increasing subsequence, Design and analysis of algorithms
41	Dina Q. Goldin, Ricardo Mardales, George Nagy	In search of meaning for time series subsequence clustering: matching algorithms based on a new distance measure.	CIKM	2006	DBLP DOI BibTeX RDF	K-means subsequence clustering, cluster shape distance, meaningless
41	Brenda Hinkemeyer, Bryant A. Julstrom	A genetic algorithm for the longest common subsequence problem.	GECCO	2006	DBLP DOI BibTeX RDF	genetic algorithm, strings, longest common subsequence
41	Clifford Kwok-Fung So, George Baciu	Hypercube sweeping algorithm for subsequence motion matching in large motion databases.	VRCIA	2006	DBLP DOI BibTeX RDF	motion capture animation, multi-dimensional time-series data, non-uniform time-warping, subsequence matching
41	Wei Liu 0010, Yixin Chen 0001, Ling Chen 0005, Ling Qin	A Fast Parallel Longest Common Subsequence Algorithm Based on Pruning Rules.	IMSCCS (1)	2006	DBLP DOI BibTeX RDF	identical character pair, Bioinformatics, longest common subsequence
41	Rong Liu, Sheqin Dong, Xianlong Hong	Fixed-outline floorplanning based on common subsequence.	ACM Great Lakes Symposium on VLSI	2005	DBLP DOI BibTeX RDF	common subsequence, floorplanning, fixed-outline
41	Francisco Nivando Bezerra	A Longest Common Subsequence Approach to Detect Cut and Wipe Video Transitions.	SIBGRAPI	2004	DBLP DOI BibTeX RDF	video transition detection, video slice, longest common subsequence
41	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
41	Lasse Bergroth, Harri Hakonen, Timo Raita	A Survey of Longest Common Subsequence Algorithms.	SPIRE	2000	DBLP DOI BibTeX RDF	longest common subsequence algorithms, string comparison, data structures, string matching, string matching, execution time, algorithm performance
38	Jefrey Lijffijt, Panagiotis Papapetrou, Jaakko Hollmén, Vassilis Athitsos	Benchmarking dynamic time warping for music retrieval.	PETRA	2010	DBLP DOI BibTeX RDF	time series, dynamic time warping, query-by-humming
38	Zvi Gotthilf, Moshe Lewenstein	Approximating Constrained LCS.	SPIRE	2007	DBLP DOI BibTeX RDF
38	Ho-Kwok Dai, Hung-Chi Su	A Parallel Algorithm for Finding All Successive Minimal Maximum Subsequences.	LATIN	2006	DBLP DOI BibTeX RDF
38	Sergey Bereg, Binhai Zhu	RNA Multiple Structural Alignment with Longest Common Subsequences.	COCOON	2005	DBLP DOI BibTeX RDF
38	Zhe Dang, Oscar H. Ibarra, Jianwen Su	Composability of Infinite-State Activity Automata.	ISAAC	2004	DBLP DOI BibTeX RDF
38	Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa, Masahiro Hirao, Hiromasa Hoshino, Shunsuke Inenaga	Finding Best Patterns Practically.	Progress in Discovery Science	2002	DBLP DOI BibTeX RDF
35	Muhammad Aziz Muslim, Masumi Ishikawa, Tetsuo Furukawa	Task segmentation in a mobile robot by mnSOM: a new approach to training expert modules.	Neural Comput. Appl.	2007	DBLP DOI BibTeX RDF	Task segmentation, Modular network SOM, Mobile robot, Subsequence
35	Ronald I. Greenberg	Fast and Space-Efficient Location of Heavy or Dense Segments in Run-Length Encoded Sequences: (Extended Abstract).	COCOON	2003	DBLP DOI BibTeX RDF	maximum consecutive subsequence sum, maximum-density segments, biomolecular sequence analysis, image processing, bioinformatics, data compression
34	Funda Ergün, Hossein Jowhari	On distance to monotonicity and longest increasing subsequence of a data stream.	SODA	2008	DBLP BibTeX RDF
34	Xiaonan Ji, James Bailey 0001, Guozhu Dong	Mining minimal distinguishing subsequence patterns with gap constraints.	Knowl. Inf. Syst.	2007	DBLP DOI BibTeX RDF	Gap constraint, Contrast pattern, Sequential pattern, Frequent pattern, Emerging pattern, Data mining algorithm
34	Eamonn J. Keogh, Jessica Lin 0001, Sang-Hee Lee, Helga Van Herle	Finding the most unusual time series subsequence: algorithms and applications.	Knowl. Inf. Syst.	2007	DBLP DOI BibTeX RDF	Time series data mining, Clustering, Anomaly detection
34	Sebastian Nowozin, Gökhan H. Bakir, Koji Tsuda	Discriminative Subsequence Mining for Action Classification.	ICCV	2007	DBLP DOI BibTeX RDF
34	David Semé, Sidney Youlou	An Efficient Parallel Algorithm for the Longest Increasing Subsequence Problem on a LARPBS.	PDCAT	2007	DBLP DOI BibTeX RDF
34	R. Pradeep Kumar, P. Nagabhushan, Ahlame Douzal Chouakria	WaveSim and Adaptive WaveSim Transform for Subsequence Time-Series Clustering.	ICIT	2006	DBLP DOI BibTeX RDF
34	Sven Rahmann	Subsequence Combinatorics and Applications to Microarray Production, DNA Sequencing and Chaining Algorithms.	CPM	2006	DBLP DOI BibTeX RDF
34	Witold Andrzejewski, Tadeusz Morzy	AISS: An Index for Non-timestamped Set Subsequence Queries.	DaWaK	2006	DBLP DOI BibTeX RDF
34	Byoungchol Chang, Jaehyuk Cha, Sang-Wook Kim, Miyoung Shin	An Index-Based Time-Series Subsequence Matching Under Time Warping.	KES (1)	2006	DBLP DOI BibTeX RDF
34	Thorsten Bernholt, Thomas Hofmeister	An Algorithm for a Generalized Maximum Subsequence Problem.	LATIN	2006	DBLP DOI BibTeX RDF
34	Minghui Jiang 0001	Subsequence Packing: Complexity, Approximation, and Application.	AAIM	2006	DBLP DOI BibTeX RDF
34	Xiaonan Ji, James Bailey 0001, Guozhu Dong	Mining Minimal Distinguishing Subsequence Patterns with Gap Constraints.	ICDM	2005	DBLP DOI BibTeX RDF
34	Eamonn J. Keogh, Jessica Lin 0001, Ada Wai-Chee Fu	HOT SAX: Efficiently Finding the Most Unusual Time Series Subsequence.	ICDM	2005	DBLP DOI BibTeX RDF	Time Series Data Mining, Clustering, Anomaly Detection
34	Bin Ma 0002, Kaizhong Zhang	On the Longest Common Rigid Subsequence Problem.	CPM	2005	DBLP DOI BibTeX RDF
34	Carlos E. R. Alves, Edson Cáceres, Siang W. Song	BSP/CGM Algorithms for Maximum Subsequence and Maximum Subarray.	PVM/MPI	2004	DBLP DOI BibTeX RDF
34	Borivoj Melichar, Tomás Polcar	The Longest Common Subsequence Problem A Finite Automata Approach.	CIAA	2003	DBLP DOI BibTeX RDF
34	Zdenek Tronícek, Ayumi Shinohara	The Size of Subsequence Automaton.	SPIRE	2003	DBLP DOI BibTeX RDF
34	Beng Chin Ooi, HweeHwa Pang, Hao Wang, Limsoon Wong, Cui Yu	Fast Filter-and-Refine Algorithms for Subsequence Selection.	IDEAS	2002	DBLP DOI BibTeX RDF
34	Jochen Alber, Jens Gramm, Jiong Guo, Rolf Niedermeier	Towards Optimally Solving the LONGEST COMMON SUBSEQUENCE Problem for Sequences with Nested Arc Annotations in Linear Time.	CPM	2002	DBLP DOI BibTeX RDF