|
|
Venues (Conferences, Journals, ...)
|
|
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 |
119 | Rao Li 0001 |
A space efficient algorithm for the constrained heaviest common subsequence problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Southeast Regional Conference ![In: Proceedings of the 46th Annual Southeast Regional Conference, 2008, Auburn, Alabama, USA, March 28-29, 2008, pp. 226-230, 2008, ACM, 978-1-60558-105-7. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MLDM ![In: Machine Learning and Data Mining in Pattern Recognition, 5th International Conference, MLDM 2007, Leipzig, Germany, July 18-20, 2007, Proceedings, pp. 585-600, 2007, Springer, 978-3-540-73498-7. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEA/AIE ![In: Innovations in Applied Artificial Intelligence, 18th International Conference on Industrial and Engineering Applications of Artificial Intelligence and Expert Systems, IEA/AIE 2005, Bari, Italy, June 22-24, 2005, Proceedings, pp. 480-489, 2005, Springer, 3-540-26551-1. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIGMOD Conference ![In: Proceedings of the ACM SIGMOD International Conference on Management of Data, Baltimore, Maryland, USA, June 14-16, 2005, pp. 682-693, 2005, ACM, 1-59593-060-4. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
89 | Michael S. Hsiao, Srimat T. Chakradhar |
Test Set Compaction Using Relaxed Subsequence Removal. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Electron. Test. ![In: J. Electron. Test. 16(4), pp. 319-327, 2000. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SPIRE ![In: Seventh International Symposium on String Processing and Information Retrieval, SPIRE 2000, A Coruña, Spain, September 27-29, 2000, pp. 146-152, 2000, IEEE Computer Society, 0-7695-0746-8. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: CONCUR 2008 - Concurrency Theory, 19th International Conference, CONCUR 2008, Toronto, Canada, August 19-22, 2008. Proceedings, pp. 172-186, 2008, Springer, 978-3-540-85360-2. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CIAA ![In: Implementation and Application of Automata, 12th International Conference, CIAA 2007, Prague, Czech Republic, July 16-18, 2007, Revised Selected Papers, pp. 309-311, 2007, Springer, 978-3-540-76335-2. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
79 | Vassilis Athitsos, Panagiotis Papapetrou, Michalis Potamias, George Kollios, Dimitrios Gunopulos |
Approximate embedding-based subsequence matching of time series. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIGMOD Conference ![In: Proceedings of the ACM SIGMOD International Conference on Management of Data, SIGMOD 2008, Vancouver, BC, Canada, June 10-12, 2008, pp. 365-378, 2008, ACM, 978-1-60558-102-6. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DASFAA ![In: Database Systems for Advanced Applications, 11th International Conference, DASFAA 2006, Singapore, April 12-15, 2006, Proceedings, pp. 65-79, 2006, Springer, 3-540-33337-1. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
70 | Vit Niennattrakul, Chotirat Ann Ratanamahatana |
Meaningful Subsequence Matching under Time Warping Distance for Data Stream. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PAKDD ![In: Advances in Knowledge Discovery and Data Mining, 13th Pacific-Asia Conference, PAKDD 2009, Bangkok, Thailand, April 27-30, 2009, Proceedings, pp. 1013-1020, 2009, Springer, 978-3-642-01306-5. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RSKT ![In: Rough Sets and Knowledge Technology, First International Conference, RSKT 2006, Chongqing, China, July 24-26, 2006, Proceedings, pp. 450-455, 2006, Springer, 3-540-36297-5. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Data Min. Knowl. Discov. ![In: Data Min. Knowl. Discov. 9(1), pp. 5-28, 2004. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DATE ![In: 1998 Design, Automation and Test in Europe (DATE '98), February 23-26, 1998, Le Palais des Congrès de Paris, Paris, France, pp. 577-582, 1998, IEEE Computer Society, 0-8186-8359-7. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSKD ![In: Fuzzy Systems and Knowledge Discovery, Third International Conference, FSKD 2006, Xi'an, China, September 24-28, 2006, Proceedings, pp. 568-577, 2006, Springer, 3-540-45916-2. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
60 | Paola Bonizzoni, Gianluca Della Vedova, Riccardo Dondi, Guillaume Fertin, Raffaella Rizzi, Stéphane Vialette |
Exemplar Longest Common Subsequence. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE ACM Trans. Comput. Biol. Bioinform. ![In: IEEE ACM Trans. Comput. Biol. Bioinform. 4(4), pp. 535-543, 2007. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FCT ![In: Fundamentals of Computation Theory, 16th International Symposium, FCT 2007, Budapest, Hungary, August 27-30, 2007, Proceedings, pp. 40-51, 2007, Springer, 978-3-540-74239-5. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GECCO ![In: Genetic and Evolutionary Computation Conference, GECCO 2007, Proceedings, London, England, UK, July 7-11, 2007, pp. 939-946, 2007, ACM, 978-1-59593-697-4. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCSA (5) ![In: Computational Science and Its Applications - ICCSA 2006, International Conference, Glasgow, UK, May 8-11, 2006, Proceedings, Part V, pp. 10-21, 2006, Springer, 3-540-34079-3. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAC ![In: Proceedings of the 2005 ACM Symposium on Applied Computing (SAC), Santa Fe, New Mexico, USA, March 13-17, 2005, pp. 469-473, 2005, ACM, 1-58113-964-0. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAC ![In: Proceedings of the 2005 ACM Symposium on Applied Computing (SAC), Santa Fe, New Mexico, USA, March 13-17, 2005, pp. 581-586, 2005, ACM, 1-58113-964-0. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ADC ![In: Twelfth Australasian Database Conference, ADC2001, Bond University, Queensland, Australia, January 29 - February 1, 2001, pp. 37-44, 2001, IEEE Computer Society, 0-7695-0966-5. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: Combinatorial Pattern Matching, 11th Annual Symposium, CPM 2000, Montreal, Canada, June 21-23, 2000, Proceedings, pp. 154-165, 2000, Springer, 3-540-67633-3. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Pattern Anal. Mach. Intell. ![In: IEEE Trans. Pattern Anal. Mach. Intell. 12(11), pp. 1080-1087, 1990. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PETRA ![In: Proceedings of the 2nd International Conference on Pervasive Technologies Related to Assistive Environments, PETRA 2009, Corfu, Greece, June 9-13, 2009, 2009, ACM, 978-1-60558-409-6. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Knowl. Inf. Syst. ![In: Knowl. Inf. Syst. 7(4), pp. 415-437, 2005. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICDM ![In: Proceedings of the 3rd IEEE International Conference on Data Mining (ICDM 2003), 19-22 December 2003, Melbourne, Florida, USA, pp. 67-74, 2003, IEEE Computer Society, 0-7695-1978-4. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
55 | Sergey Bereg, Marcin Kubica, Tomasz Walen, Binhai Zhu |
RNA multiple structural alignment with longest common subsequences. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Optim. ![In: J. Comb. Optim. 13(2), pp. 179-188, 2007. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PPSN ![In: Parallel Problem Solving from Nature - PPSN IX, 9th International Conference, Reykjavik, Iceland, September 9-13, 2006, Procedings, pp. 930-938, 2006, Springer, 3-540-38990-3. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 45(3), pp. 301-335, 2006. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PAKDD ![In: Advances in Knowledge Discovery and Data Mining, 10th Pacific-Asia Conference, PAKDD 2006, Singapore, April 9-12, 2006, Proceedings, pp. 739-749, 2006, Springer, 3-540-33206-5. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
53 | Huanmei Wu, Betty Salzberg, Donghui Zhang |
Online Event-driven Subsequence Matching over Financial Data Streams. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIGMOD Conference ![In: Proceedings of the ACM SIGMOD International Conference on Management of Data, Paris, France, June 13-18, 2004, pp. 23-34, 2004, ACM, 1-58113-859-8. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIGMOD Conference ![In: Proceedings of the 2002 ACM SIGMOD International Conference on Management of Data, Madison, Wisconsin, USA, June 3-6, 2002, pp. 382-393, 2002, ACM, 1-58113-497-5. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
50 | Todd Easton, Abhilash Singireddy |
A large neighborhood search heuristic for the longest common subsequence problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Heuristics ![In: J. Heuristics 14(3), pp. 271-283, 2008. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GECCO ![In: Genetic and Evolutionary Computation Conference, GECCO 2008, Proceedings, Atlanta, GA, USA, July 12-16, 2008, pp. 803-810, 2008, ACM, 978-1-60558-130-9. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the 23rd ACM Symposium on Computational Geometry, Gyeongju, South Korea, June 6-8, 2007, pp. 310-318, 2007, ACM, 978-1-59593-705-6. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PAKDD ![In: Advances in Knowledge Discovery and Data Mining, 11th Pacific-Asia Conference, PAKDD 2007, Nanjing, China, May 22-25, 2007, Proceedings, pp. 921-931, 2007, Springer, 978-3-540-71700-3. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Supercomput. ![In: J. Supercomput. 32(1), pp. 51-69, 2005. The full citation details ...](Pics/full.jpeg) |
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? ![Search on Bibsonomy](Pics/bibsonomy.png) |
Trans. Comp. Sys. Biology ![In: Transactions on Computational Systems Biology II, pp. 1-36, 2005, Springer, 3-540-29401-5. The full citation details ...](Pics/full.jpeg) |
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? ![Search on Bibsonomy](Pics/bibsonomy.png) |
International Conference on Computational Science (2) ![In: Computational Science - ICCS 2005, 5th International Conference, Atlanta, GA, USA, May 22-25, 2005, Proceedings, Part II, pp. 860-868, 2005, Springer, 3-540-26043-9. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Supercomput. ![In: J. Supercomput. 12(4), pp. 373-385, 1998. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Parallel Distributed Syst. ![In: IEEE Trans. Parallel Distributed Syst. 5(8), pp. 835-848, 1994. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: Combinatorial Pattern Matching, 19th Annual Symposium, CPM 2008, Pisa, Italy, June 18-20, 2008, Proceedings, pp. 255-262, 2008, Springer, 978-3-540-69066-5. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
45 | Alexandre Tiskin |
Semi-local String Comparison: Algorithmic Techniques and Applications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Comput. Sci. ![In: Math. Comput. Sci. 1(4), pp. 571-603, 2008. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 2002, 27th International Symposium, MFCS 2002, Warsaw, Poland, August 26-30, 2002, Proceedings, pp. 459-470, 2002, Springer, 3-540-44040-2. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Knowl. Data Eng. ![In: IEEE Trans. Knowl. Data Eng. 21(3), pp. 321-334, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
44 | Mi Zhou, Man Hon Wong 0001 |
Efficient Online Subsequence Searching in Data Streams under Dynamic Time Warping Distance. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICDE ![In: Proceedings of the 24th International Conference on Data Engineering, ICDE 2008, April 7-12, 2008, Cancún, Mexico, pp. 686-695, 2008, IEEE Computer Society, 978-1-4244-1836-7. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
44 | Costas S. Iliopoulos, Marcin Kubica, M. Sohel Rahman, Tomasz Walen |
Algorithms for Computing the Longest Parameterized Common Subsequence. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: Combinatorial Pattern Matching, 18th Annual Symposium, CPM 2007, London, Canada, July 9-11, 2007, Proceedings, pp. 265-273, 2007, Springer, 978-3-540-73436-9. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
44 | Patrick Cégielski, Irène Guessarian, Yury Lifshits, Yuri V. Matiyasevich |
Window Subsequence Problems for Compressed Texts. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSR ![In: Computer Science - Theory and Applications, First International Symposium on Computer Science in Russia, CSR 2006, St. Petersburg, Russia, June 8-12, 2006, Proceedings, pp. 127-136, 2006, Springer, 3-540-34166-8. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
44 | Paola Bonizzoni, Gianluca Della Vedova, Riccardo Dondi, Guillaume Fertin, Stéphane Vialette |
Exemplar Longest Common Subsequence. ![Search on Bibsonomy](Pics/bibsonomy.png) |
International Conference on Computational Science (2) ![In: Computational Science - ICCS 2006, 6th International Conference, Reading, UK, May 28-31, 2006, Proceedings, Part II, pp. 622-629, 2006, Springer, 3-540-34381-4. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AINA (1) ![In: 20th International Conference on Advanced Information Networking and Applications (AINA 2006), 18-20 April 2006, Vienna, Austria, pp. 255-262, 2006, IEEE Computer Society, 0-7695-2466-4. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
44 | Jason R. Chen |
Making Subsequence Time Series Clustering Meaningful. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICDM ![In: Proceedings of the 5th IEEE International Conference on Data Mining (ICDM 2005), 27-30 November 2005, Houston, Texas, USA, pp. 114-121, 2005, IEEE Computer Society, 0-7695-2278-5. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
44 | Tassos Argyros, Charis Ermopoulos |
Efficient Subsequence Matching in Time Series Databases Under Time and Amplitude Transformations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICDM ![In: Proceedings of the 3rd IEEE International Conference on Data Mining (ICDM 2003), 19-22 December 2003, Melbourne, Florida, USA, pp. 481-484, 2003, IEEE Computer Society, 0-7695-1978-4. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
44 | Haixun Wang, Chang-Shing Perng |
The S2-Tree : An Index Structure for Subsequence Matching of Spatial Objects. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PAKDD ![In: Knowledge Discovery and Data Mining - PAKDD 2001, 5th Pacific-Asia Conference, Hong Kong, China, April 16-18, 2001, Proceedings, pp. 312-323, 2001, Springer, 3-540-41910-1. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discovery Science ![In: Discovery Science, Third International Conference, DS 2000, Kyoto, Japan, December 4-6, 2000, Proceedings, pp. 141-154, 2000, Springer, 3-540-41352-9. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
44 | Mi Lu |
Parallel Computation of Longest-Common-Subsequence. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCI ![In: Advances in Computing and Information - ICCI'90, International Conference on Computing and Information, Niagara Falls, Canada, May 23-26, 1990, Proceedings, pp. 385-394, 1990, Springer, 3-540-53504-7. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
|
44 | Ricardo A. Baeza-Yates |
The Subsequence Graph of a Text. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TAPSOFT, Vol.1 ![In: TAPSOFT'89: Proceedings of the International Joint Conference on Theory and Practice of Software Development, Barcelona, Spain, March 13-17, 1989, Volume 1: Advanced Seminar on Foundations of Innovative Software Development I and Colloquium on Trees in Algebra and Programming (CAAP'89), pp. 104-118, 1989, Springer, 3-540-50939-9. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Data Min. Knowl. Discov. ![In: Data Min. Knowl. Discov. 18(1), pp. 1-29, 2009. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Knowl. Inf. Syst. ![In: Knowl. Inf. Syst. 18(1), pp. 1-27, 2009. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theory Comput. Syst. ![In: Theory Comput. Syst. 45(2), pp. 355-371, 2009. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WWW ![In: Proceedings of the 18th International Conference on World Wide Web, WWW 2009, Madrid, Spain, April 20-24, 2009, pp. 971-980, 2009, ACM, 978-1-60558-487-4. The full citation details ...](Pics/full.jpeg) |
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](Pics/bibsonomy.png) |
Euro-Par ![In: Euro-Par 2008 - Parallel Processing, 14th International Euro-Par Conference, Las Palmas de Gran Canaria, Spain, August 26-29, 2008, Proceedings, pp. 654-664, 2008, Springer, 978-3-540-85450-0. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCS (1) ![In: Computational Science - ICCS 2008, 8th International Conference, Kraków, Poland, June 23-25, 2008, Proceedings, Part I, pp. 499-508, 2008, Springer, 978-3-540-69383-3. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
BMEI (1) ![In: Proceedings of the 2008 International Conference on BioMedical Engineering and Informatics, BMEI 2008, May 28-30, 2008, Sanya, Hainan, China - Volume 1, pp. 57-61, 2008, IEEE Computer Society, 978-0-7695-3118-2. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Optim. ![In: J. Comb. Optim. 13(3), pp. 277-288, 2007. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CIKM ![In: Proceedings of the 2006 ACM CIKM International Conference on Information and Knowledge Management, Arlington, Virginia, USA, November 6-11, 2006, pp. 347-356, 2006, ACM, 1-59593-433-2. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GECCO ![In: Genetic and Evolutionary Computation Conference, GECCO 2006, Proceedings, Seattle, Washington, USA, July 8-12, 2006, pp. 609-610, 2006, ACM, 1-59593-186-4. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
VRCIA ![In: Proceedings VRCIA 2006 ACM International Conference on Virtual Reality Continuum and its Applications, Chinese University of Hong Kong, Hong Kong, China, June 14-17, 2006, pp. 221-228, 2006, ACM, 1-59593-324-7. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IMSCCS (1) ![In: Interdisciplinary and Multidisciplinary Research in Computer Science, IEEE CS Proceeding of the First International Multi-Symposium of Computer and Computational Sciences (IMSCCS|06), June 20-24, 2006, Zhejiang University, Hangzhou, China, Vol. 1, pp. 27-34, 2006, IEEE Computer Society, 0-7695-2581-4. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Great Lakes Symposium on VLSI ![In: Proceedings of the 15th ACM Great Lakes Symposium on VLSI 2005, Chicago, Illinois, USA, April 17-19, 2005, pp. 156-159, 2005, ACM, 1-59593-057-4. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIBGRAPI ![In: XVII Brazilian Symposium on Computer Graphics and Image Processing, (SIBGRAPI 2004) 17-20 October 2004, Curitiba, PR, Brazil, pp. 154-160, 2004, IEEE Computer Society, 0-7695-2227-0. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPDPS ![In: 17th International Parallel and Distributed Processing Symposium (IPDPS 2003), 22-26 April 2003, Nice, France, CD-ROM/Abstracts Proceedings, pp. 57, 2003, IEEE Computer Society, 0-7695-1926-1. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SPIRE ![In: Seventh International Symposium on String Processing and Information Retrieval, SPIRE 2000, A Coruña, Spain, September 27-29, 2000, pp. 39-48, 2000, IEEE Computer Society, 0-7695-0746-8. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PETRA ![In: Proceedings of the 3rd International Conference on Pervasive Technologies Related to Assistive Environments, PETRA 2010, Samos, Greece, June 23-25, 2010, 2010, ACM, 978-1-4503-0071-1. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
time series, dynamic time warping, query-by-humming |
38 | Zvi Gotthilf, Moshe Lewenstein |
Approximating Constrained LCS. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SPIRE ![In: String Processing and Information Retrieval, 14th International Symposium, SPIRE 2007, Santiago, Chile, October 29-31, 2007, Proceedings, pp. 164-172, 2007, Springer, 978-3-540-75529-6. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
38 | Ho-Kwok Dai, Hung-Chi Su |
A Parallel Algorithm for Finding All Successive Minimal Maximum Subsequences. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LATIN ![In: LATIN 2006: Theoretical Informatics, 7th Latin American Symposium, Valdivia, Chile, March 20-24, 2006, Proceedings, pp. 337-348, 2006, Springer, 3-540-32755-X. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
38 | Sergey Bereg, Binhai Zhu |
RNA Multiple Structural Alignment with Longest Common Subsequences. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOON ![In: Computing and Combinatorics, 11th Annual International Conference, COCOON 2005, Kunming, China, August 16-29, 2005, Proceedings, pp. 32-41, 2005, Springer, 3-540-28061-8. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
38 | Zhe Dang, Oscar H. Ibarra, Jianwen Su |
Composability of Infinite-State Activity Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 15th International Symposium, ISAAC 2004, Hong Kong, China, December 20-22, 2004, Proceedings, pp. 377-388, 2004, Springer, 3-540-24131-0. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
38 | Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa, Masahiro Hirao, Hiromasa Hoshino, Shunsuke Inenaga |
Finding Best Patterns Practically. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Progress in Discovery Science ![In: Progress in Discovery Science, Final Report of the Japanese Discovery Science Project, pp. 307-317, 2002, Springer, 3-540-43338-4. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Neural Comput. Appl. ![In: Neural Comput. Appl. 16(6), pp. 571-580, 2007. The full citation details ...](Pics/full.jpeg) |
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). ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOON ![In: Computing and Combinatorics, 9th Annual International Conference, COCOON 2003, Big Sky, MT, USA, July 25-28, 2003, Proceedings, pp. 528-536, 2003, Springer, 3-540-40534-8. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008, San Francisco, California, USA, January 20-22, 2008, pp. 730-736, 2008, SIAM. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP BibTeX RDF |
|
34 | Xiaonan Ji, James Bailey 0001, Guozhu Dong |
Mining minimal distinguishing subsequence patterns with gap constraints. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Knowl. Inf. Syst. ![In: Knowl. Inf. Syst. 11(3), pp. 259-286, 2007. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Knowl. Inf. Syst. ![In: Knowl. Inf. Syst. 11(1), pp. 1-27, 2007. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCV ![In: IEEE 11th International Conference on Computer Vision, ICCV 2007, Rio de Janeiro, Brazil, October 14-20, 2007, pp. 1-8, 2007, IEEE Computer Society, 978-1-4244-1630-1. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
34 | David Semé, Sidney Youlou |
An Efficient Parallel Algorithm for the Longest Increasing Subsequence Problem on a LARPBS. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PDCAT ![In: Eighth International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT 2007), 3-6 December 2007, Adelaide, Australia, pp. 251-258, 2007, IEEE Computer Society, 0-7695-3049-4. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
34 | R. Pradeep Kumar, P. Nagabhushan, Ahlame Douzal Chouakria |
WaveSim and Adaptive WaveSim Transform for Subsequence Time-Series Clustering. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICIT ![In: 9th International Conference in Information Technology, ICIT 2006, Bhubaneswar, Orissa, India, 18-21 December 2006, pp. 197-202, 2006, IEEE Computer Society, 0-7695-2635-7. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
34 | Sven Rahmann |
Subsequence Combinatorics and Applications to Microarray Production, DNA Sequencing and Chaining Algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: Combinatorial Pattern Matching, 17th Annual Symposium, CPM 2006, Barcelona, Spain, July 5-7, 2006, Proceedings, pp. 153-164, 2006, Springer, 3-540-35455-7. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
34 | Witold Andrzejewski, Tadeusz Morzy |
AISS: An Index for Non-timestamped Set Subsequence Queries. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DaWaK ![In: Data Warehousing and Knowledge Discovery, 8th International Conference, DaWaK 2006, Krakow, Poland, September 4-8, 2006, Proceedings., pp. 503-512, 2006, Springer, 3-540-37736-0. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
KES (1) ![In: Knowledge-Based Intelligent Information and Engineering Systems, 10th International Conference, KES 2006, Bournemouth, UK, October 9-11, 2006, Proceedings, Part I, pp. 1043-1050, 2006, Springer, 3-540-46535-9. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
34 | Thorsten Bernholt, Thomas Hofmeister |
An Algorithm for a Generalized Maximum Subsequence Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LATIN ![In: LATIN 2006: Theoretical Informatics, 7th Latin American Symposium, Valdivia, Chile, March 20-24, 2006, Proceedings, pp. 178-189, 2006, Springer, 3-540-32755-X. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
34 | Minghui Jiang 0001 |
Subsequence Packing: Complexity, Approximation, and Application. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AAIM ![In: Algorithmic Aspects in Information and Management, Second International Conference, AAIM 2006, Hong Kong, China, June 20-22, 2006, Proceedings, pp. 314-323, 2006, Springer, 3-540-35157-4. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
34 | Xiaonan Ji, James Bailey 0001, Guozhu Dong |
Mining Minimal Distinguishing Subsequence Patterns with Gap Constraints. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICDM ![In: Proceedings of the 5th IEEE International Conference on Data Mining (ICDM 2005), 27-30 November 2005, Houston, Texas, USA, pp. 194-201, 2005, IEEE Computer Society, 0-7695-2278-5. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICDM ![In: Proceedings of the 5th IEEE International Conference on Data Mining (ICDM 2005), 27-30 November 2005, Houston, Texas, USA, pp. 226-233, 2005, IEEE Computer Society, 0-7695-2278-5. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: Combinatorial Pattern Matching, 16th Annual Symposium, CPM 2005, Jeju Island, Korea, June 19-22, 2005, Proceedings, pp. 11-20, 2005, Springer, 3-540-26201-6. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PVM/MPI ![In: Recent Advances in Parallel Virtual Machine and Message Passing Interface, 11th European PVM/MPI Users' Group Meeting, Budapest, Hungary, September 19-22, 2004, Proceedings, pp. 139-146, 2004, Springer, 3-540-23163-3. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
34 | Borivoj Melichar, Tomás Polcar |
The Longest Common Subsequence Problem A Finite Automata Approach. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CIAA ![In: Implementation and Application of Automata, 8th International Conference, CIAA 2003, Santa Barbara, California, USA, July 16-18, 2003, Proceedings, pp. 294-296, 2003, Springer, 3-540-40561-5. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
34 | Zdenek Tronícek, Ayumi Shinohara |
The Size of Subsequence Automaton. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SPIRE ![In: String Processing and Information Retrieval, 10th International Symposium, SPIRE 2003, Manaus, Brazil, October 8-10, 2003, Proceedings, pp. 304-310, 2003, Springer, 3-540-20177-7. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IDEAS ![In: International Database Engineering & Applications Symposium, IDEAS'02, July 17-19, 2002, Edmonton, Canada, Proceedings, pp. 243-255, 2002, IEEE Computer Society, 0-7695-1638-6. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: Combinatorial Pattern Matching, 13th Annual Symposium, CPM 2002, Fukuoka, Japan, July 3-5, 2002, Proceedings, pp. 99-114, 2002, Springer, 3-540-43862-9. The full citation details ...](Pics/full.jpeg) |
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][ >>] |
|