Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
15 | Zheng Li, Tingjian Ge |
Online windowed subsequence matching over probabilistic sequences. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIGMOD Conference ![In: Proceedings of the ACM SIGMOD International Conference on Management of Data, SIGMOD 2012, Scottsdale, AZ, USA, May 20-24, 2012, pp. 277-288, 2012, ACM, 978-1-4503-1247-9. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
15 | David Becerra, Juan Mendivelso, Yoan J. Pinzón |
A Multiobjective Approach to the Weighted Longest Common Subsequence Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Stringology ![In: Proceedings of the Prague Stringology Conference 2012, Prague, Czech Republic, August 27-28, 2012, pp. 64-74, 2012, Department of Theoretical Computer Science, Faculty of Information Technology, Czech Technical University in Prague, 978-80-01-05095-8. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP BibTeX RDF |
|
15 | Ahmed Amarni, Sylvain Lombardy |
Factor and Subsequence Kernels and Signatures of Rational Languages. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CIAA ![In: Implementation and Application of Automata - 17th International Conference, CIAA 2012, Porto, Portugal, July 17-20, 2012. Proceedings, pp. 313-320, 2012, Springer, 978-3-642-31605-0. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
15 | Majid Sazvar, Mahmoud Naghibzadeh, Nayyereh Saadati |
Quick-MLCS: a new algorithm for the multiple longest common subsequence problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
C3S2E ![In: Fifth International C* Conference on Computer Science & Software Engineering, C3S2E '12, Montreal, QC, Canada, June 27-29, 2012, pp. 61-66, 2012, ACM, 978-1-4503-1084-0. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
15 | Youhei Namiki, Takashi Ishida 0002, Yutaka Akiyama |
Fast DNA Sequence Clustering Based on Longest Common Subsequence. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICIC (3) ![In: Emerging Intelligent Computing Technology and Applications - 8th International Conference, ICIC 2012, Huangshan, China, July 25-29, 2012. Proceedings, pp. 453-460, 2012, Springer, 978-3-642-31836-8. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
15 | Silvio Jamil Ferzoli Guimarães, Zenilton Kleber G. do Patrocínio Jr. |
A two-step video subsequence identification based on bipartite graph matching. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SMC ![In: Proceedings of the IEEE International Conference on Systems, Man, and Cybernetics, SMC 2012, Seoul, Korea (South), October 14-17, 2012, pp. 2330-2335, 2012, IEEE, 978-1-4673-1713-9. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
15 | Shihabur Rahman Chowdhury, Md. Mahbubul Hasan, Sumaiya Iqbal, M. Sohel Rahman |
Computing a Longest Common Palindromic Subsequence. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IWOCA ![In: Combinatorial Algorithms, 23rd International Workshop, IWOCA 2012, Tamil Nadu, India, July 19-21, 2012, Revised Selected Papers, pp. 219-223, 2012, Springer, 978-3-642-35925-5. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
15 | Yonchanok Khaokaew, Sirikarn Pukkawanna |
Time series anomaly detection using recessive subsequence. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICOIN ![In: 2012 International Conference on Information Networking, ICOIN 2012, Bali, Indonesia, February 1-3, 2012, pp. 329-333, 2012, IEEE Computer Society, 978-1-4673-0251-7. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
15 | Meijing Li, Xiuming Yu, Taewook Kim, Keun Ho Ryu |
Prediction of protein disordered regions in a protein sequence based on gap-constraint subsequence patterns. ![Search on Bibsonomy](Pics/bibsonomy.png) |
iCAST ![In: 4th International Conference on Awareness Science and Technology, iCAST 2012, Seoul, South Korea, August 21-24, 2012, pp. 195-199, 2012, IEEE, 978-1-4673-2111-2. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
15 | Sou-Young Jin, Ho-Jin Choi |
Essential Body-Joint and Atomic Action Detection for Human Activity Recognition Using Longest Common Subsequence Algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACCV Workshops (2) ![In: Computer Vision - ACCV 2012 Workshops, ACCV 2012 International Workshops, Daejeon, Korea, November 5-6, 2012, Revised Selected Papers, Part II, pp. 148-159, 2012, Springer, 978-3-642-37483-8. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
15 | Maodi Hu, Yunhong Wang, James J. Little |
Combinational Subsequence Matching for Human Identification from General Actions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACCV (3) ![In: Computer Vision - ACCV 2012 - 11th Asian Conference on Computer Vision, Daejeon, Korea, November 5-9, 2012, Revised Selected Papers, Part III, pp. 453-464, 2012, Springer, 978-3-642-37430-2. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
15 | Witold Andrzejewski, Bartosz Bebel |
FOCUS: An Index FOr ContinuoUS Subsequence Pattern Queries. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ADBIS ![In: Advances in Databases and Information Systems - 16th East European Conference, ADBIS 2012, Poznań, Poland, September 18-21, 2012. Proceedings, pp. 29-42, 2012, Springer, 978-3-642-33073-5. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
15 | Guillaume Blin, Minghui Jiang 0001, Stéphane Vialette |
The Longest Common Subsequence Problem with Crossing-Free Arc-Annotated Sequences. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SPIRE ![In: String Processing and Information Retrieval - 19th International Symposium, SPIRE 2012, Cartagena de Indias, Colombia, October 21-25, 2012. Proceedings, pp. 130-142, 2012, Springer, 978-3-642-34108-3. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
15 | Yingni Duan, Haifeng Zhang, Hong Lv, Junchu Fang |
Research on the First Class M Subsequence. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CIS ![In: Eighth International Conference on Computational Intelligence and Security, CIS 2012, Guangzhou, China, November 17-18, 2012, pp. 503-506, 2012, IEEE Computer Society, 978-1-4673-4725-9. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
15 | Jiaying Wang, Xiaochun Yang 0001, Bin Wang 0015, Huaijie Zhu |
Memory-Aware BWT by Segmenting Sequences to Support Subsequence Search. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APWeb ![In: Web Technologies and Applications - 14th Asia-Pacific Web Conference, APWeb 2012, Kunming, China, April 11-13, 2012. Proceedings, pp. 73-84, 2012, Springer, 978-3-642-29252-1. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
15 | Abdulla-Al-Maruf, Hung-Hsuan Huang, Kyoji Kawagoe |
Time Series Classification Method Based on Longest Common Subsequence and Textual Approximation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICDIM ![In: Seventh International Conference on Digital Information Management, ICDIM 2012, Macau, Macao, August 22-24, 2012, pp. 130-137, 2012, IEEE, 978-1-4673-2428-1. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
15 | Fabio Cunial |
Analysis of the subsequence composition of biosequences. ![Search on Bibsonomy](Pics/bibsonomy.png) |
|
2012 |
RDF |
|
15 | Silvio Jamil Ferzoli Guimarães, Zenilton Kleber Gonçalves do Patrocínio Jr. |
Identification of video subsequence using bipartite graph matching. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Braz. Comput. Soc. ![In: J. Braz. Comput. Soc. 17(3), pp. 175-192, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
15 | Hwei-Jen Lin, Hung-Hsuan Wu, Chun-Wei Wang |
Music Matching Based on Rough Longest Common Subsequence. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Inf. Sci. Eng. ![In: J. Inf. Sci. Eng. 27(1), pp. 95-110, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP BibTeX RDF |
|
15 | Hisashi Koga, Hiroaki Saito, Toshinori Watanabe, Takanori Yokoyama |
New dissimilarity measure for recognizing noisy subsequence trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Int. J. Intell. Syst. ![In: Int. J. Intell. Syst. 26(5), pp. 474-496, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
15 | Alessandro Arlotto, J. Michael Steele |
Optimal Sequential Selection of a Unimodal Subsequence of a Random Sequence. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comb. Probab. Comput. ![In: Comb. Probab. Comput. 20(6), pp. 799-814, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
15 | Sukumar Das Adhikari, Mohan N. Chintamani |
Number of Weighted Subsequence Sums With Weights in {1, -1}. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Integers ![In: Integers 11, pp. A36, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP BibTeX RDF |
|
15 | Myeong-Seon Gil, Yang-Sae Moon, Bum-Soo Kim |
Linear Detrending Subsequence Matching in Time-Series Databases. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEICE Trans. Inf. Syst. ![In: IEICE Trans. Inf. Syst. 94-D(4), pp. 917-920, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
15 | Yllias Chali, Sadid A. Hasan, Shafiq R. Joty |
Improving graph-based random walks for complex question answering using syntactic, shallow semantic and extended string subsequence kernels. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Process. Manag. ![In: Inf. Process. Manag. 47(6), pp. 843-855, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
15 | Qingguo Wang, Dmitry Korkin, Yi Shang |
A Fast Multiple Longest Common Subsequence (MLCS) Algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Knowl. Data Eng. ![In: IEEE Trans. Knowl. Data Eng. 23(3), pp. 321-334, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
15 | Shihabur Rahman Chowdhury, Md. Mahbubul Hasan, Sumaiya Iqbal, M. Sohel Rahman |
Computing a Longest Common Palindromic Subsequence ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1110.5296, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP BibTeX RDF |
|
15 | Alexios Kotsifakos, Panagiotis Papapetrou, Jaakko Hollmén, Dimitrios Gunopulos |
A Subsequence Matching with Gaps-Range-Tolerances Framework: A Query-By-Humming Application. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Proc. VLDB Endow. ![In: Proc. VLDB Endow. 4(11), pp. 761-771, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP BibTeX RDF |
|
15 | Deter de Wet |
Subsequence convergence in subdivision. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Comput. ![In: Math. Comput. 80(274), pp. 973-994, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
15 | Panagiotis Papapetrou, Vassilis Athitsos, Michalis Potamias, George Kollios, Dimitrios Gunopulos |
Embedding-based subsequence matching in time-series databases. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Database Syst. ![In: ACM Trans. Database Syst. 36(3), pp. 17:1-17:39, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
15 | Yi-Ching Chen, Kun-Mao Chao |
On the generalized constrained longest common subsequence problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Optim. ![In: J. Comb. Optim. 21(3), pp. 383-392, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
15 | Chiou-Ting Tseng, Chang-Biau Yang, Hsing-Yen Ann |
Efficient Algorithms for the Longest Common Subsequence Problem with Sequential Substring Constraints. ![Search on Bibsonomy](Pics/bibsonomy.png) |
BIBE ![In: 11th IEEE International Conference on Bioinformatics and Bioengineering, BIBE 2011, Taichung, Taiwan, October 24-26, 2011, pp. 175-180, 2011, IEEE Computer Society, 978-1-61284-975-1. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
15 | Shrikant Kashyap, Mong-Li Lee, Wynne Hsu |
Similar Subsequence Search in Time Series Databases. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DEXA (1) ![In: Database and Expert Systems Applications - 22nd International Conference, DEXA 2011, Toulouse, France, August 29 - September 2, 2011. Proceedings, Part I, pp. 232-246, 2011, Springer, 978-3-642-23087-5. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
15 | Takanori Yamamoto, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda |
Faster Subsequence and Don't-Care Pattern Matching on Compressed Texts. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: Combinatorial Pattern Matching - 22nd Annual Symposium, CPM 2011, Palermo, Italy, June 27-29, 2011. Proceedings, pp. 309-322, 2011, Springer, 978-3-642-21457-8. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
15 | Pramod K. Vemulapalli, Adam J. Dean, Sean N. Brennan |
Pitch based vehicle localization using time series subsequence matching with Multi-scale Extrema Features. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACC ![In: American Control Conference, ACC 2011, San Francisco, CA, USA, June 29 - July 1, 2011, pp. 2405-2410, 2011, IEEE, 978-1-4577-0081-1. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
15 | Juan M. Huerta |
Subsequence similarity language models. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICASSP ![In: Proceedings of the IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2011, May 22-27, 2011, Prague Congress Center, Prague, Czech Republic, pp. 5580-5583, 2011, IEEE, 978-1-4577-0539-7. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
15 | Toshinori Sakai, Jorge Urrutia |
On the Heaviest Increasing or Decreasing Subsequence of a Permutation, and Paths and Matchings on Weighted Point Sets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EGC ![In: Computational Geometry - XIV Spanish Meeting on Computational Geometry, EGC 2011, Dedicated to Ferran Hurtado on the Occasion of His 60th Birthday, Alcalá de Henares, Spain, June 27-30, 2011, Revised Selected Papers, pp. 175-184, 2011, Springer, 978-3-642-34190-8. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
15 | Kouji Shimohira, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda |
Computing Longest Common Substring/Subsequence of Non-linear Texts. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Stringology ![In: Proceedings of the Prague Stringology Conference 2011, Prague, Czech Republic, August 29-31, 2011, pp. 197-208, 2011, Prague Stringology Club, Department of Theoretical Computer Science, Faculty of Information Technology, Czech Technical University in Prague, 978-80-01-04870-2. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP BibTeX RDF |
|
15 | Alexander Tiskin |
Towards Approximate Matching in Compressed Strings: Local Subsequence Recognition. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSR ![In: Computer Science - Theory and Applications - 6th International Computer Science Symposium in Russia, CSR 2011, St. Petersburg, Russia, June 14-18, 2011. Proceedings, pp. 401-414, 2011, Springer, 978-3-642-20711-2. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
15 | Thanh-Son Nguyen 0002, Tuan-Anh Duong |
Time Series Subsequence Matching Based on a Combination of PIP and Clipping. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACIIDS (1) ![In: Intelligent Information and Database Systems - Third International Conference, ACIIDS 2011, Daegu, Korea, April 20-22, 2011, Proceedings, Part I, pp. 149-158, 2011, Springer, 978-3-642-20038-0. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
15 | Katsuya Kawanami, Noriyuki Fujimoto |
GPU Accelerated Computation of the Longest Common Subsequence. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Facing the Multicore-Challenge ![In: Facing the Multicore - Challenge II - Aspects of New Paradigms and Technologies in Parallel Computing [Proceedings of a conference held at the Karlsruhe Institute of Technology (KIT), September 28-30, 2011]., pp. 84-95, 2011, Springer, 978-3-642-30396-8. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
15 | Carlos Eduardo Ferreira, Christian Tjandraatmadja |
A branch-and-cut approach to the repetition-free longest common subsequence problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Notes Discret. Math. ![In: Electron. Notes Discret. Math. 36, pp. 527-534, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
15 | Sebastian Deorowicz |
Bit-Parallel Algorithm for the Constrained Longest Common Subsequence Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Fundam. Informaticae ![In: Fundam. Informaticae 99(4), pp. 409-433, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
15 | Christian Houdré, Ricardo Restrepo |
A Probabilistic Approach to the Asymptotics of the Length of the Longest Alternating Subsequence. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. J. Comb. ![In: Electron. J. Comb. 17(1), 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
15 | Amr Elmasry |
The longest almost-increasing subsequence. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Process. Lett. ![In: Inf. Process. Lett. 110(16), pp. 655-658, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
15 | Paola Bonizzoni, Gianluca Della Vedova, Riccardo Dondi, Yuri Pirola |
Variants of constrained longest common subsequence. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Process. Lett. ![In: Inf. Process. Lett. 110(20), pp. 877-881, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
15 | Sebastian Deorowicz, Joanna Obstój |
Constrained Longest Common Subsequence Computing Algorithms in Practice. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Informatics ![In: Comput. Informatics 29(3), pp. 427-445, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP BibTeX RDF |
|
15 | Mohamed Elhadi, Amjad Al-Tobi |
Detection of Duplication in Documents and WebPages Based Documents Syntactical Structures through an Improved Longest Common Subsequence. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Int. J. Inf. Process. Manag. ![In: Int. J. Inf. Process. Manag. 1(1), pp. 138-147, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP BibTeX RDF |
|
15 | Seonho Kim, Juntae Yoon, Jihoon Yang, Seog Park |
Walk-weighted subsequence kernels for protein-protein interaction extraction. ![Search on Bibsonomy](Pics/bibsonomy.png) |
BMC Bioinform. ![In: BMC Bioinform. 11, pp. 107, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
15 | Thomas Jansen 0001, Dennis Weyland |
Analysis of Evolutionary Algorithms for the Longest Common Subsequence Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 57(1), pp. 170-186, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
15 | Nikhil Bansal 0001, Moshe Lewenstein, Bin Ma 0002, Kaizhong Zhang |
On the Longest Common Rigid Subsequence Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 56(2), pp. 270-280, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
15 | Amit Chakrabarti |
A Note on Randomized Streaming Space Bounds for the Longest Increasing Subsequence Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Colloquium Comput. Complex. ![In: Electron. Colloquium Comput. Complex. TR10, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP BibTeX RDF |
|
15 | Zi Huang, Heng Tao Shen, Jie Shao 0001, Bin Cui 0001, Xiaofang Zhou 0001 |
Practical Online Near-Duplicate Subsequence Detection for Continuous Video Streams. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Multim. ![In: IEEE Trans. Multim. 12(5), pp. 386-398, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
15 | Myeong-Seon Gil, Yang-Sae Moon, Bum-Soo Kim |
Linear Detrending Subsequence Matching in Time-Series Databases ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1006.5273, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP BibTeX RDF |
|
15 | Kang Ning 0001 |
Deposition and extension approach to find longest common subsequence for thousands of long sequences. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Biol. Chem. ![In: Comput. Biol. Chem. 34(3), pp. 149-157, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
15 | Said Sadique Adi, Marília D. V. Braga, Cristina G. Fernandes, Carlos Eduardo Ferreira, Fábio Viduani Martinez, Marie-France Sagot, Marco Aurelio Stefanes, Christian Tjandraatmadja, Yoshiko Wakabayashi |
Repetition-free longest common subsequence. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Appl. Math. ![In: Discret. Appl. Math. 158(12), pp. 1315-1324, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
15 | Yang-Sae Moon, Jinho Kim |
MBR-safe piecewise aggregate approximation for time-series subsequence matching. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Syst. Sci. Eng. ![In: Comput. Syst. Sci. Eng. 25(5), 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP BibTeX RDF |
|
15 | Maxime Crochemore, Ely Porat |
Fast computation of a longest increasing subsequence and application. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Comput. ![In: Inf. Comput. 208(9), pp. 1054-1059, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
15 | Sebastian Deorowicz |
Solving longest common subsequence and related problems on graphical processing units. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Softw. Pract. Exp. ![In: Softw. Pract. Exp. 40(8), pp. 673-700, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
15 | Alberto Apostolico, Fabio Cunial |
The Subsequence Composition of Polypeptides. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comput. Biol. ![In: J. Comput. Biol. 17(8), pp. 1011-1049, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
15 | Anna Gál, Parikshit Gopalan |
Lower Bounds on Streaming Algorithms for Approximating the Length of the Longest Increasing Subsequence. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIAM J. Comput. ![In: SIAM J. Comput. 39(8), pp. 3463-3479, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
15 | Doruk Sart, Abdullah Mueen 0001, Walid A. Najjar, Eamonn J. Keogh, Vit Niennattrakul |
Accelerating Dynamic Time Warping Subsequence Search with GPUs and FPGAs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICDM ![In: ICDM 2010, The 10th IEEE International Conference on Data Mining, Sydney, Australia, 14-17 December 2010, pp. 1001-1006, 2010, IEEE Computer Society, 978-0-7695-4256-0. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
15 | Kanishka Bhaduri, Qiang Zhu 0002, Nikunj C. Oza, Ashok N. Srivastava |
Fast and Flexible Multivariate Time Series Subsequence Search. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICDM ![In: ICDM 2010, The 10th IEEE International Conference on Data Mining, Sydney, Australia, 14-17 December 2010, pp. 48-57, 2010, IEEE Computer Society, 978-0-7695-4256-0. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
15 | Manuel Lozano 0001, Christian Blum 0001 |
A Hybrid Metaheuristic for the Longest Common Subsequence Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Hybrid Metaheuristics ![In: Hybrid Metaheuristics - 7th International Workshop, HM 2010, Vienna, Austria, October 1-2, 2010. Proceedings, pp. 1-15, 2010, Springer, 978-3-642-16053-0. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
15 | Christian Blum 0001 |
Beam-ACO for the longest common subsequence problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Congress on Evolutionary Computation ![In: Proceedings of the IEEE Congress on Evolutionary Computation, CEC 2010, Barcelona, Spain, 18-23 July 2010, pp. 1-8, 2010, IEEE, 978-1-4244-6909-3. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
15 | Alejandro Flores-Méndez, Manuel Bernal-Urbina |
Dynamic signature verification through the Longest Common Subsequence Problem and Genetic Algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Congress on Evolutionary Computation ![In: Proceedings of the IEEE Congress on Evolutionary Computation, CEC 2010, Barcelona, Spain, 18-23 July 2010, pp. 1-6, 2010, IEEE, 978-1-4244-6909-3. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
15 | Vasile Georgescu |
A Computational Intelligence Based Framework for One-Subsequence-Ahead Forecasting of Nonstationary Time Series. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MDAI ![In: Modeling Decisions for Artificial Intelligence - 7th International Conference, MDAI 2010, Perpignan, France, October 27-29, 2010. Proceedings, pp. 187-194, 2010, Springer, 978-3-642-16291-6. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
15 | Abdullah N. Arslan |
A Fast Longest Common Subsequence Algorithm for Similar Strings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LATA ![In: Language and Automata Theory and Applications, 4th International Conference, LATA 2010, Trier, Germany, May 24-28, 2010. Proceedings, pp. 82-93, 2010, Springer, 978-3-642-13088-5. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
15 | Bryan M. Franklin, Steven Seidel |
A parallel longest common subsequence algorithm in UPC. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SpringSim ![In: Proceedings of the 2010 Spring Simulation Multiconference, SpringSim 2010, Orlando, Florida, USA, April 11-15, 2010, pp. 93, 2010, SCS/ACM, 978-1-4503-0069-8. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
15 | Dániel Marx, Ildikó Schlotter |
Parameterized Complexity of the Arc-Preserving Subsequence Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph Theoretic Concepts in Computer Science - 36th International Workshop, WG 2010, Zarós, Crete, Greece, June 28-30, 2010 Revised Papers, pp. 244-255, 2010, 978-3-642-16925-0. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
15 | Qingguo Wang, Mian Pan, Yi Shang, Dmitry Korkin |
A Fast Heuristic Search Algorithm for Finding the Longest Common Subsequence of Multiple Strings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AAAI ![In: Proceedings of the Twenty-Fourth AAAI Conference on Artificial Intelligence, AAAI 2010, Atlanta, Georgia, USA, July 11-15, 2010, pp. 1287-1292, 2010, AAAI Press. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
15 | Shuxia Pang, Rui Li, Zhanting Yuan, Qiuyu Zhang |
Subsequence kernel-based Chinese recommender system. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICNC ![In: Sixth International Conference on Natural Computation, ICNC 2010, Yantai, Shandong, China, 10-12 August 2010, pp. 3652-3655, 2010, IEEE, 978-1-4244-5961-2. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
15 | Jiangde Yu, Chuan Gu, Wenying Ge |
Combining Character-Based and Subsequence-Based Tagging for Chinese Word Segmentation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CIPS-SIGHAN ![In: CIPS-SIGHAN Joint Conference on Chinese Language Processing, Beijing, China, August 28-29, 2010, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP BibTeX RDF |
|
15 | Takuma Nishii, Tomoyuki Hiroyasu, Masato Yoshimi, Mitsunori Miki, Hisatake Yokouchi |
Similar subsequence retrieval from two time series data using homology search. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SMC ![In: Proceedings of the IEEE International Conference on Systems, Man and Cybernetics, Istanbul, Turkey, 10-13 October 2010, pp. 1062-1067, 2010, IEEE, 978-1-4244-6588-0. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
15 | Effat Farhana, Jannatul Ferdous, Tanaeem M. Moosa, M. Sohel Rahman |
Finite Automata Based Algorithms for the Generalized Constrained Longest Common Subsequence Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SPIRE ![In: String Processing and Information Retrieval - 17th International Symposium, SPIRE 2010, Los Cabos, Mexico, October 11-13, 2010. Proceedings, pp. 243-249, 2010, Springer, 978-3-642-16320-3. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
15 | Su-Chen Lin, Mi-Yen Yeh, Ming-Syan Chen |
Subsequence Matching of Stream Synopses under the Time Warping Distance. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PAKDD (2) ![In: Advances in Knowledge Discovery and Data Mining, 14th Pacific-Asia Conference, PAKDD 2010, Hyderabad, India, June 21-24, 2010. Proceedings. Part II, pp. 354-361, 2010, Springer, 978-3-642-13671-9. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
15 | Mohamed Elhadi, Amjad Al-Tobi |
Refinements of Longest Common Subsequence algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AICCSA ![In: The 8th ACS/IEEE International Conference on Computer Systems and Applications, AICCSA 2010, Hammamet, Tunisia, May 16-19, 2010, pp. 1-5, 2010, IEEE Computer Society, 978-1-4244-7716-6. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
15 | Bchira Ben Mabrouk, Hamadi Hasni, Zaher Mahjoub |
Parallelization of the dynamic programming algorithm for solving the longest common subsequence problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AICCSA ![In: The 8th ACS/IEEE International Conference on Computer Systems and Applications, AICCSA 2010, Hammamet, Tunisia, May 16-19, 2010, pp. 1-8, 2010, IEEE Computer Society, 978-1-4244-7716-6. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
15 | Philip Bille, Inge Li Gørtz |
Fast Arc-Annotated Subsequence Matching in Linear Space. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SOFSEM ![In: SOFSEM 2010: Theory and Practice of Computer Science, 36th Conference on Current Trends in Theory and Practice of Computer Science, Spindleruv Mlýn, Czech Republic, January 23-29, 2010. Proceedings, pp. 188-199, 2010, Springer, 978-3-642-11265-2. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
15 | Amr Elmasry |
The Longest Almost-Increasing Subsequence. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOON ![In: Computing and Combinatorics, 16th Annual International Conference, COCOON 2010, Nha Trang, Vietnam, July 19-21, 2010. Proceedings, pp. 338-347, 2010, Springer, 978-3-642-14030-3. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
15 | Nikhil S. Ketkar, G. Michael Youngblood |
A Largest Common Subsequence-based Distance Measure for Classifying Player Motion Traces in Virtual Worlds. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FLAIRS ![In: Proceedings of the Twenty-Third International Florida Artificial Intelligence Research Society Conference, May 19-21, 2010, Daytona Beach, Florida, USA, 2010, AAAI Press. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP BibTeX RDF |
|
15 | Klaus Dräger |
Subsequence invariants. ![Search on Bibsonomy](Pics/bibsonomy.png) |
|
2010 |
RDF |
|
15 | Jason Chen |
Subsequence Time Series Clustering. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Encyclopedia of Data Warehousing and Mining ![In: Encyclopedia of Data Warehousing and Mining, Second Edition (4 Volumes), pp. 1871-1876, 2009, IGI Global, 9781605660103. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP BibTeX RDF |
|
15 | Pingzhi Yuan |
Subsequence Sums of Zero-sum-free Sequences. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. J. Comb. ![In: Electron. J. Comb. 16(1), 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
15 | Sebastian Deorowicz |
An algorithm for solving the longest increasing circular subsequence problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Process. Lett. ![In: Inf. Process. Lett. 109(12), pp. 630-634, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
15 | Sebastian Deorowicz, Szymon Grabowski |
A hybrid algorithm for the longest common transposition-invariant subsequence problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Informatics ![In: Comput. Informatics 28(5), pp. 729-744, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP BibTeX RDF |
|
15 | Christian Blum 0001, Maria J. Blesa, Manuel López-Ibáñez 0001 |
Beam search for the longest common subsequence problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Oper. Res. ![In: Comput. Oper. Res. 36(12), pp. 3178-3186, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
15 | Shyong Jian Shyu, Chun-Yuan Tsai |
Finding the longest common subsequence for multiple biological sequences by ant colony optimization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Oper. Res. ![In: Comput. Oper. Res. 36(1), pp. 73-91, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
15 | Pingzhi Yuan |
Subsequence sums of a zero-sumfree sequence. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Eur. J. Comb. ![In: Eur. J. Comb. 30(2), pp. 439-446, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
15 | Alberto Apostolico, Fabio Cunial |
The subsequence composition of a string. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 410(43), pp. 4360-4371, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
15 | Orgad Keller, Tsvi Kopelowitz, Moshe Lewenstein |
On the longest common parameterized subsequence. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 410(51), pp. 5347-5353, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
15 | Yoshifumi Sakai |
Computing the longest topological common subsequence of a symbol-wise totally ordered directed acyclic graph and a sequence. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 410(27-29), pp. 2759-2766, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
15 | Kang Ning 0001 |
A Deposition and Post Processing Approach for the Longest Common Subsequence Problem ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/0903.2015, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP BibTeX RDF |
|
15 | Majid Fozunbal |
A Subsequence-Histogram Method for Generic Vocabulary Recognition over Deletion Channels ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/0904.3351, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP BibTeX RDF |
|
15 | Philip Bille, Inge Li Gørtz |
Fast Arc-Annotated Subsequence Matching in Linear Space ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/0911.0577, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP BibTeX RDF |
|
15 | |
An $O(n^2)$ Algorithm for Computing Longest Common Cyclic Subsequence ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/0911.5031, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP BibTeX RDF |
|
15 | Paola Bonizzoni, Gianluca Della Vedova, Riccardo Dondi, Yuri Pirola |
Variants of Constrained Longest Common Subsequence ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/0912.0368, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP BibTeX RDF |
|
15 | Yang-Sae Moon, Woong-Kee Loh |
Efficient stream subsequence matching algorithms for handheld devices on streaming time-series data. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Syst. Sci. Eng. ![In: Comput. Syst. Sci. Eng. 24(4), 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP BibTeX RDF |
|
15 | Yang-Sae Moon, Woong-Kee Loh |
Efficient stream subsequence matching algorithms for handheld devices on streaming time-series data. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Syst. Sci. Eng. ![In: Comput. Syst. Sci. Eng. 24(2), 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP BibTeX RDF |
|
15 | Matthew K. Franklin, Mark A. Gondree, Payman Mohassel |
Communication-Efficient Private Protocols for Longest Common Subsequence. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IACR Cryptol. ePrint Arch. ![In: IACR Cryptol. ePrint Arch. 2009, pp. 19, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP BibTeX RDF |
|
15 | Mark A. Gondree, Payman Mohassel |
Longest Common Subsequence as Private Search. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IACR Cryptol. ePrint Arch. ![In: IACR Cryptol. ePrint Arch. 2009, pp. 401, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP BibTeX RDF |
|