The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Searching for Subsequence with no syntactic query expansion in all metadata.

Publication years (Num. hits)
1961-1985 (16) 1986-1990 (17) 1991-1994 (19) 1995-1997 (20) 1998 (17) 1999 (15) 2000 (21) 2001 (24) 2002 (31) 2003 (39) 2004 (57) 2005 (77) 2006 (84) 2007 (89) 2008 (72) 2009 (71) 2010 (44) 2011 (24) 2012 (44) 2013 (38) 2014 (27) 2015 (24) 2016 (40) 2017 (30) 2018 (41) 2019 (38) 2020 (58) 2021 (47) 2022 (40) 2023 (62) 2024 (6)
Publication types (Num. hits)
article(512) incollection(3) inproceedings(711) phdthesis(6)
Venues (Conferences, Journals, ...)
CoRR(102) CPM(34) Inf. Process. Lett.(32) Theor. Comput. Sci.(22) ICDE(21) SPIRE(18) ICDM(17) SODA(15) Algorithmica(14) ISAAC(14) IEEE Trans. Knowl. Data Eng.(13) SIGMOD Conference(12) Electron. J. Comb.(9) VLDB J.(9) BIBE(8) J. ACM(8) More (+10 of total 550)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 488 occurrences of 321 keywords

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