| Presentation file |
introducer |
date |
paper |
video |
| Richard Beal and Donald Adjeroh, "Parameterized longest previous factor",Theoretical Computer Science Volume 437, 15 June 2012, Pages 21-34 |
林鑫成 |
Jan. 04 |
 |
 |
| Joakim Blikstad, "On the longest common subsequence of Thue-Morse words",Information Processing Letters, Volume 164, December 2020 |
廖郁儒 |
Jan. 04 |
|
|
| Lei Wang, Xiaodong Wang, Yingjie Wu, Daxin Zhu, "A dynamic programming solution to a generalized LCS problem",Information Processing Letters 113(2013) 723-728 |
何承翰 |
Jan. 04 |
|
|
| Mohammad I.Daoud, NawwafKharma, "A hybrid heuristic–genetic algorithm for task scheduling in heterogeneous processor networks",Journal of Parallel and Distributed Computing Volume 71, Issue 11, November 2011, Pages 1518-1531 |
吳爵君 |
Jan. 11 |
|
|
| Korhan Karabulut, M. Fatih Tasgetiren, "A Variable Iterated Greedy Algorithm for the Traveling Salesman Problem with Time Windows", Information Sciences, 2014 Vol. 279, pp. 383-395 |
呂宗霖 |
Jan. 11 |
|
|
| Szymon Kowalik and Jacek Mańdziuk, "Towards Human-Level Performance in Solving Double Dummy Bridge Problem",28th International Conference, ICONIP 2021, Sanur, Bali, Indonesia, December 8–12, 2021, Proceedings, Part I |
詹敬平 |
Jan. 11 |
|
|
| Noriki Fujisato, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai and Masayuki Takeda, "Direct Linear Time Construction of Parameterized Suffix and LCP Arrays for Constant Alphabets", 26th International Symposium, SPIRE 2019: String Processing and Information Retrieval, Segovia, Spain, October 7–9, 2019 |
林鑫成 |
Jan. 18 |
|
|
| Zhan peng and Yuping Wang, "A Novel Efficient Graph Model for the Multiple Longest Common Subsequences (MLCS) Problem",Frontiers in Genetics, August 2017 |
李健廷 |
Feb. 8 |
|
|
| Yi Zhao, Suzhi Cao and Lei Yan, "List Scheduling Algorithm Based on Pre-scheduling for Heterogeneous Computing", 2019 IEEE Intl Conf on Parallel & Distributed Processing with Applications, Big Data & Cloud Computing, Sustainable Computing & Communications, Social Computing & Networking |
簡志軒 |
Feb. 8 |
|
|
| Chun-Yen Ho and Hsuan-Tien Lin, "Contract Bridge Bidding by Learning",AAAI Workshop: Computer Poker and Imperfect Information, 2015 |
林映妤 |
Feb. 8 |
|
|
| Jinil Kim, Peter Eades, Rudolf Fleischer, Seok-Hee Hong,Costas S. Iliopoulos, Kunsoo Park, Simon J. Puglisi, Takeshi Tok, "Order-Preserving Matching", Theoretical Computer Science 525 (2014) pp.68–79 |
陳冠廷 |
Feb. 16 |
|
|
| Costas S. Iliopoulos, M. Sohel Rahman, "Algorithms for computing variants of the longest common subsequence problem", Theoretical Computer Science 395 (2008) 255–267 |
何承翰 |
Feb. 16 |
|
|
| Amir Carmel, Dekel Tsur, Michal Ziv-Ukelson, "On Almost Monge All Scores Matrices", Algorithmica, 2019 Volume 81, pp. 47-68 |
呂宗霖 |
Feb. 16 |
|
|
| Yanni Li, Yuping Wang, Zhensong Zhang, Yaxin Wang, Ding Ma and Jianbin Huang, "A Novel Fast and Memory Efficient Parallel MLCS Algorithm for Long and Large-Scale Sequences Alignments," 2016 IEEE 32nd International Conference on Data Engineering (ICDE), 16-20 May 2016, Helsinki, Finlan |
李健廷 |
Feb. 22 |
|
|
| Tianhua Jiang and Chao Zhang, "Application of Grey Wolf Optimization for Solving Combinatorial Problems: Job Shop and Flexible Job Shop Scheduling Cses," IEEE Access, vol. 6, no. 4, pp. 26231 - 26240, May. 2018 |
簡志軒 |
Feb. 22 |
|
|
| Jieshan Chen, Mulong Xie, Zhenchang Xing, Chunyang Chen, Xiwei Xu, Liming Zhu and Guoqiang Li, "Object Detection for Graphical User Interface: Old Fashioned or Deep Learning or a Combination?," ESEC/FSE 2020: Proceedings of the 28th ACM Joint Meeting on European Software Engineering Conference and Symposium on the Foundations of Software Engineering, November 2020, Pages 1202–1214 |
廖郁儒 |
Feb. 22 |
|
|
| Md. Mahbubul Hasan, A.S.M. Shohidull Islam, Mohammad Saifur Rahman and M. Sohel Rahman, "Order preserving pattern matching revisited," Pattern Recognition Letters 55 (2015), pp. 15-21 |
陳冠廷 |
Mar. 01 |
|
|
| Chih-Kuan Yeh, Cheng-Yu Hsieh and Hsuan-Tien Lin,"Automatic Bridge Bidding Using Deep Reinforcement Learning," IEEE TRANSACTIONS ON GAMES, VOL. 10, NO. 4, DECEMBER 2018 |
林映妤 |
Mar. 01 |
|
|
| Amr Elmasry, "The longest almost-increasing subsequence," Information Processing Letters 110 (2010) 655–658 |
何承翰 |
Mar. 01 |
|
|
| Md. Mahbubul Hasan, A.S.M. Shohidull Islam, Mohammad Saifur Rahman and M. Sohel Rahman, "Order preserving pattern matching revisited," Pattern Recognition Letters 55 (2015), pp. 15-21 |
陳冠廷 |
Mar. 08 |
|
|
| Chih-Kuan Yeh, Cheng-Yu Hsieh and Hsuan-Tien Lin,"Automatic Bridge Bidding Using Deep Reinforcement Learning," IEEE TRANSACTIONS ON GAMES, VOL. 10, NO. 4, DECEMBER 2018 |
林映妤 |
Mar. 08 |
|
|
| Judea Pearl, "SCOUT: A Simple Game-Searching Algorithm with Proven Optimal Properties," Association for the Advancement of Artificial Intelligence, August 18–21, 1980, Stanford, California |
詹敬平 |
Mar. 08 |
|
|
| Chuan Wang, Yancheng Liu, Qinjin Zhang, Haohao Guo, Xiaoling Liang, Yang Chen, Minyi Xu and Yi Wei, "Association Rule Mining Based Parameter Adaptive Strategy for Differential Evolution Algorithms," Expert Systems With Applications, 2019,Volume 123, pp. 54-69 |
呂宗霖 |
Mar. 16 |
|
|
| Tooru Akagi, Yuki Kuhara, Takuya Mieno, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai and Masayuki Takeda, "Combinatorics of minimal absent words for a sliding window," ArXiv, abs/2105.08496, 2021 |
林鑫成 |
Mar. 16 |
|
|
| Minhaj Ahmad Khan, "Scheduling for heterogeneous systems using constrained critical paths," Parallel Computing Volume 38, Issues 4–5, April–May 2012, pp 175-193 |
吳爵君 |
Mar. 16 |
|
|
| Kuo-Tsung Tseng, De-Sheng Chan, Chang-Biau Yang and Shou-Fu Lo, "Efficient Merged Longest Common Subsequence Algorithms for Similar Sequences," Theoretical Computer Science,Volume 708, 17 January 2018, Pages 75-90 |
李健廷 |
Mar. 23 |
|
|
| Sukhyeun Cho, Joong Chae Na, Kunsoo Park, Jeong Seop Sim, "A Fast Algorithm for Order-Preserving Pattern Matching," Information Processing Letters 115 (2015) pp.397 - 402 |
陳冠廷 |
Apr. 12 |
|
|
| Jiang Rong, Tao Qin, and Bo An, "Competitive Bridge Bidding with Deep Neural Networks," 18th International Conference on Autonomous Agents and Multiagent Systems, AAMAS '19, Montreal, QC, Canada, May 13-17, 2019 |
林映妤 |
Apr. 12 |
|
|
| Anthony J.T. Lee , Han-Pang Chiu, "2D Z-string: A new spatial knowledge representation for image databases," Department of Information Management, National Taiwan University, No. 1, Section 4, Roosevelt Road, Taipei 106, Taiwan, ROC Received 18 February 2003 |
廖郁儒 |
Apr. 12 |
|
|
| Toan Thang Ta, Yi-Kung Shieh, Chin Lung Lu, "Computing a longest common almost-increasing subsequence of two sequences," Theoretical Computer Science 854 (2021) 44–51 |
何承翰 |
Apr. 19 |
|
|
| Rüdiger Rudolf, "Recognition of d-Dimensional Monge Arrays," Discrete Applied Mathematics, 1994 Volume 52, pp. 71-82 |
呂宗霖 |
Apr. 19 |
|
|
| Hamid Arabnejad and Jorge G. Barbosa, "A Budget Constrained Scheduling Algorithm for Workflow Applications," Hamid Arabnejad and Jorge G. BarbosaJournal of Grid Computing, volume 12, pages 665–679 (2014) |
吳爵君 |
Apr. 19 |
|
|
| Shou-Fu Lo, Kuo-Tsung Tseng, Chang-Biau Yang and Kuo-Si Huang, "A Diagonal-Based Algorithm for the Longest Common Increasing Subsequence Problem," Theoretical Computer Science, Volume 815, 2 May 2020, Pages 69-78 |
李健廷 |
Apr. 26 |
|
|
| Zengliang Han, Dongqing Wang, Feng Liu and Zhiyong Zhao, "Multi-AGV Path Planning With Double-Path Constraints By Using An Improved Genetic Algorithm," PLOS ONE, July 26, 2017 |
簡志軒 |
Apr. 26 |
|
|
| Zengliang Han, Dongqing Wang, Feng Liu and Zhiyong Zhao, "Multi-AGV Path Planning With Double-Path Constraints By Using An Improved Genetic Algorithm," PLOS ONE, July 26, 2017 |
簡志軒 |
May. 03 |
|
|
| Swann Legras, C’eline Rouveirol, and V’eronique Ventos, "The Game of Bridge: A Challenge for ILP," 28th International Conference, ILP 2018, Ferrara, Italy, September 2–4, 2018, Proceedings |
林映妤 |
May. 03 |
|
|
| Ziao Wang, Nadim Ghaddar, Lele Wang, "Noisy Sorting Capacity," arXiv:2202.01446v1, Information Theory, Feb. 3, 2022 |
林鑫成 |
May. 03 |
|
|
| M. Kubica, T. Kulczyński, J. Radoszewski, W. Rytter, T. Waleń, "A Linear Time Algorithm for Consecutive Permutation Pattern Matching," Information Processing Letters vol. 113, pp. 430 – 433, 2013 |
陳冠廷 |
May. 10 |
|
|
| Michael H. Albert , Alexander Golynski , Angele M. Hamel, Alejandro Lopez-Ortiz , S. Srinivasa Rao , Mohammad Ali Safari, "Longest increasing subsequences in sliding windows," Theoretical Computer Science 321 (2004) 405–414 |
何承翰 |
May. 10 |
|
|
| Ye-In Chang, Bi-Yen Yang, Wei-Horng Yeh, "A bit-pattern-based matrix strategy for efficient iconic indexing of symbolic pictures," Pattern Recognition Letters 24 (2003) 537–545 |
廖郁儒 |
May. 10 |
|
|
| Alexander Tiskin, "Semi-Local Longest Common Subsequences in Subquadratic Time," Journal of Discrete Algorithms, 2008, Volume 6 , Issue 4, pp. 570-581 |
呂宗霖 |
May. 18 |
|
|
| Shiwei Wei, Yuping Wang, Yuanchao Yang and Sen Liu, Alexander Golynski , Angele M. Hamel, Alejandro Lopez-Ortiz , S. Srinivasa Rao , Mohammad Ali Safari, "A Path Recorder Algorithm for Multiple Longest Common Subsequences (MLCS) Problems," Bioinformatics, Volume 36, Issue 10, 15 May 2020, Pages 3035–3042 |
李健廷 |
May. 18 |
|
|
| Alexander Tiskin, "Semi-Local Longest Common Subsequences in Subquadratic Time," Journal of Discrete Algorithms, 2008, Volume 6 , Issue 4, pp. 570-581 |
呂宗霖 |
May. 25 |
|
|
| Chun-Wei Tsai, "Search Economics: A Solution Space and Computing Resource Aware Search Method," 2015 IEEE International Conference on Systems, Man, and Cybernetics |
簡志軒 |
May. 25 |
|
|
| Shaikhah AlEbrahim , Imtiaz Ahmad, "Task scheduling for heterogeneous computing systems," The Journal of Supercomputing |
吳爵君 |
May. 25 |
|
|
| Chaimae El Hatri, Jaouad Boumhidi, "Fuzzy Deep Learning based Urban Traffic Incident Detection ," Cognitive Systems Research, Volume 50, August 2018, Pages 206-213 |
林映妤 |
Jun. 07 |
|
|
| C. T. Tseng, S. H. Shiau, C. B. Yang, "An Optimal Algorithm for Finding the Longest Increasing Subsequence of Every Substring," Proc. of the 5th Conference on Information Technology and Applications in Outlying Islands, Kinmen, Taiwan, June 2, 2006. |
陳冠廷 |
Jun. 07 |
|
|
| Glenn Manacher, "A New Linear-Time "On-Line" Algorithm for Finding the Smallest Initial Palindrome of a String," Journal of the ACM, Volume 22, Issue 3,July 1975, pp 346–351 |
林鑫成 |
Jun. 07 |
|
|
| Yung-Hsing Peng, Chang-Biau Yang, "Finding the gapped longest common subsequence by incremental suffix maximum queries ," Information and Computation 237 (2014) 95–100 |
何承翰 |
Jun. 14 |
|
|
| Luís M.S. Russo, "Monge Properties of Sequence Alignment," Theoretical Computer Science, 2012,Volume 423, pp. 30-49 |
呂宗霖 |
Jun. 14 |
|
|
| Chunyang Wang, Yuping Wang and Yiuming Cheung, "A Branch and Bound Irredundant Graph Algorithm for Large-Scale MLCS Problems," Pattern Recognition, Volume 119, November 2021, 108059 |
李健廷 |
Jun. 14 |
|
|
| Szymon Kowalik and Jacek Mańdziuk, "Towards Human-Level Performance in Solving Double Dummy Bridge Problem," 28th International Conference, ICONIP 2021, Sanur, Bali, Indonesia, December 8–12, 2021, Proceedings, Part I |
林映妤 |
Jun. 21 |
|
|
| T. Chhabra, J. Tarhio, "Monge Properties of Sequence Alignment, "A Filtration Method for Order-Preserving Matching, Information Processing Letters," Vol. 116, Issue 2, February 2016, pp. 71-74, |
陳冠廷 |
Jun. 21 |
|
|
| Saeid Abrishami, Mahmoud Naghibzadeh, Dick H.J. Epema, "Deadline-constrained workflow scheduling algorithms for Infrastructure as a Service Clouds," Future Generation Computer Systems, Vol. 29, Issue 1, pp. 158- 169, 2013 |
簡志軒 |
Jun. 21 |
|
|
| Tomas Flouri, Emanuele Giaquinta, Kassian Kobert, "Longest common substrings with k mismatches," Information Processing Letters 115 (2015) 643–647 |
何承翰 |
Jun. 28 |
|
|
| Martin Černý, "Interval Matrices with Monge Property," Applications of Mathematics, 2020 Vol. 65, No. 5, pp. 619-643 |
呂宗霖 |
Jun. 28 |
|
|
| Mustafa M. Noaman and Ameera S. Jaradat, "Solving Shortest Common Supersequence Problem Using Artificial Bee Colony Algorithm," Int. J. ACM Jordan, Volume 2 (3) (2011), pp. 180-185 |
李健廷 |
Jun. 28 |
|
|
| Naoki Mizukami and Yoshimasa Tsuruoka, "Building a Computer Mahjong Player Based on Monte Carlo Simulation and Opponent Models," 2015 IEEE Conference on Computational Intelligence and Games (CIG) |
林映妤 |
July 05 |
|
|
| S. Faro, T. Lecroq, "Efficient Pattern Matching on Binary Strings," Proceedings of the 35th International Conference on Current Trends in Theory and Practice of Computer Science, 2009 |
陳冠廷 |
July 05 |
|
|
| Bing Lin, Wenzhong Guo, Naixue Xiong, "A Pretreatment Workflow Scheduling Approach for Big Data Applications in Multicloud Environments," IEEE Transactions on Network and Service Management, vol. 13, no. 3, pp. 581- 594, Sept. 2016 |
簡志軒 |
July 05 |
|
|
| Costas S. Iliopoulos, M. Sohel Rahman, "A New Efficient Algorithm for Computing the Longest Common Subsequence," Theory of Computing Systems 45 (2009) 355–371 |
何承翰 |
July 12 |
|
|
| Mauro Castelli, Riccardo Dondi, Giancarlo Mauri, Italo Zoppis, "Comparing Incomplete Sequences via Longest Common Subsequence," Theoretical Computer Science, 2019 Volume 796, pp. 272-285 |
呂宗霖 |
July 12 |
|
|
| Jin Cao and Dewei Zhong, "A Fast Randomized Algorithm for Finding the Maximal Common Subsequences," arXiv:2009.03352v1, Data Structures and Algorithms, Sept. 7 2020 |
李健廷 |
July 12 |
|
|
| C.T. Tseng, C.B. Yang, H.Y. Ann, "Minimum Height and Sequence Constrained Longest Increasing Subsequence," Journal of Internet Technology, Vol. 10, 2009, pp.173 ~ 178 |
陳冠廷 |
July 20 |
|
|
| Jyoti Sahni and Deo Prakash Vidyarthi, "A Cost-Effective Deadline-Constrained Dynamic Scheduling Algorithm for Scientific Workflows in a Cloud Environment," IEEE Transactions on Cloud Computing, Vol. 6, no. 1, pp. 2- 18, Jan.- March, 1, 2018 |
簡志軒 |
July 26 |
|
|
| Jafar Alzubi, Anand Nayyar, Akshi Kumar, "Machine Learning from Theory to Algorithms: An Overview," Journal of physics: conference series, 2018 (Vol. 1142, No. 1, p. 012012) |
陳韻安 |
July 26 |
|
|
| Richard Groult, Élise Prieur, Gwénaël Richomme, "Counting distinct palindromes in a word in linear time," Information Processing Letters 110 (2010) 908–912 |
何承翰 |
July 26 |
|
|
| Xiaozhou He1 (賀小舟), Yinfeng Xu1 (徐寅峰), "The Longest Commonly Positioned Increasing Subsequences Problem," Journal of Combinatorial Optimization, 2018 Volume 35, pp. 331-340 |
呂宗霖 |
Aug. 02 |
|
|
| Francis Y.L. Chin, Alfredo De Santis, Anna Lisa Ferrara , N.L. Ho and S.K. Kim, "A Simple Algorithm for The Constrained Sequence Problems," Information Processing Letters, Volume 90, Issue 4, 31 May 2004, Pages 175-179 |
李健廷 |
Aug. 02 |
|
|
| YoungSu Yun and Chiung Moon, "Genetic algorithm approach for precedence-constrained sequencing problems," Journal of Intelligent Manufacturing, Vol. 22, pp. 379– 388, 2011 |
簡志軒 |
Aug. 02 |
|
|
| Michael Bowling, Neil Burch, Michael Johanson, Oskari Tammelin, "Heads-up limit hold’em poker is solved," Science Volume 347, Issue 6218, 9 Jan. 2015, pp. 145-149 |
林映妤 |
Aug. 09 |
|
|
| S. Bespamyatnikh, M. Segal, "Enumerating Longest Increasing Subsequences and Patience Sorting," Information Processing Letters, Vol. 76, 2000, pp. 7 ~ 11 |
陳冠廷 |
Aug. 09 |
|
|
| Lori L. DeLooze and James Downey, "Bridge Bidding with Imperfect Information," IEEE Symposium on Computational Intelligence and Games, 2007.p. 368-373. IEEE. |
陳韻安 |
Aug. 09 |
|
|
| Johra Muhammad Moosa, M. Sohel Rahman, Fatema Tuz Zohora, "Computing a longest common subsequence that is almost increasing on sequences having no repeated elements," Journal of Discrete Algorithms 20 (2013) 12–20 |
何承翰 |
Aug. 30 |
|
|
| G.M. Landau, A. Levy, I. Newman, "LCS Approximation via Embedding into Locally Non-Repetitive Strings," Information and Computation, 2011 Volume 209, pp. 705-716 |
呂宗霖 |
Aug. 30 |
|
|
| Sebastian Deorowicz, "Fast Algorithm for Constrained Longest Common Subsequence Problem," Vol. 19 (2007), no. 2 pp. 91–102 |
李健廷 |
Aug. 30 |
|
|
| Johannes Heinrich and David Silver, "Deep Reinforcement Learning from Self-Play in Imperfect-Information Games," Machine Learning, Artificial Intelligence, Computer Science and Game Theory, arXiv:1603.01121 |
林映妤 |
Sept. 06 |
|
|
| Matthew L. Ginsberg, "GIB: Steps Toward an Expert-Level Bridge-Playing Program," IJCAI. 1999. p. 584-593. |
陳韻安 |
Sept. 06 |
|
|
| Shan Ding, Jinhui Wu, Guoqi Xie and Gang Zeng, "A Hybrid Heuristic-Genetic Algorithm with Adaptive Parameters for Static Task Scheduling in Heterogeneous Computing System," 2017 IEEE Trustcom/BigDataSE/ICESS |
簡志軒 |
Sept. 06 |
|
|
| Tomohiro I, Shunsuke Inenaga, Masayuki Takeda, "Palindrome pattern matching," Theoretical Computer Science 483 (2013) 162–170 |
何承翰 |
Sept. 13 |
|
|
| A. V. Aho, M. J. Corasick, "Efficient String Matching an Aid to Bibliographic Search," Communications of the ACM, Vol. 18, 1975, pp. 333~340 |
陳冠廷 |
Sept. 13 |
|
|
| Jalal eddin Aghazadeh heris, Mohammadreza Asgari Oskoei, "Modified Genetic Algorithm for Solving n-Queens Problem," Iranian Conference on Intelligent Systems (ICIS), 2014 |
陳冠傑 |
Sept. 13 |
|
|
| T. Uno and M. Yagiura, "Fast Algorithms to Enumerate All Common Intervals of Two Permutations," Algorithmica, 2000 Volume 26, pp. 290-309 |
呂宗霖 |
Sept. 20 |
|
|
| I-Hsuan Yang, Chien-Pin Huang, Kun-Mao Chao, "A Fast Algorithm for Computing A Longest Common Increasing Subsequence," Information Processing Letters 93 (2005) 249–253 |
李健廷 |
Sept. 20 |
|
|
| Richard Chia-Tung Lee, Jeen-Shang Lin, Fang Rong Hsu, "A Parallel Algorithm for the Single Step Searching Problem," Proceedings of the International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN), December 1994, Kanazawa, Japan |
林鈺宸 |
Sept. 20 |
|
|
| Veronique Ventos, Yves Costel, Olivier Teytaud, and Solène Thépaut Ventos, "Boosting a Bridge Artificial Intelligence," IEEE 29th International Conference on Tools with Artificial Intelligence (ICTAI), 2017 |
朱宥諺 |
Sept. 27 |
|
|
| Noam Brown, Anton Bakhtin, Adam Lerer, Qucheng Gong, "Combining Deep Reinforcement Learning and Search for Imperfect-Information Games," the 34th International Conference on Neural Information Processing Systems, December 2020, pp. 17057–17069 |
林映妤 |
Sept. 27 |
|
|
| D. Sirisha and G.Vijaya Kumari, "A New Heuristic for Minimizing Schedule Length in Heterogeneous Computing Systems," 2015 IEEE International Conference on Electrical, Computer and Communication Technologies (ICECCT) |
簡志軒 |
Sept. 27 |
|
|
| Maxime Crochemore, Lucian Ilie, "Computing Longest Previous Factor in linear time and applications," Information Processing Letters 106 (2008) 75–80 |
何承翰 |
Oct. 04 |
|
|
| Garima Pandey, Mamta Martolia, Nitin Arora, "A Novel String Matching Algorithm and Comparison with KMP Algorithm," International Journal of Computer Applications (0975 – 8887) Volume 179 – No.3, December 2017 |
沈之承 |
Oct. 04 |
|
|
| M. Crochemore, E. Porat, "Fast Computation of a Longest Increasing Subsequence and Application," Information and Computation, Vol. 208, 2010, pp. 1054~1059 |
陳冠廷 |
Oct. 04 |
|
|
| Hwei-Jen Lin (林慧珍), Hung-Hsuan Wu (吳宏宣), Chun-Wei Wang (王駿瑋), "Music Matching Based on Rough Longest Common Subsequence," JOURNAL OF INFORMATION SCIENCE AND ENGINEERING, 2011,Volume 27, pp. 95-110 |
呂宗霖 |
Oct. 12 |
|
|
| Johra Muhammad Moosa, M. Sohel Rahman, Fatema Tuz Zohora, "Computing a Longest Common Subsequence that is Almost Increasing On Sequences Having No Repeated Elements," Journal of Discrete Algorithms Volume 20, May 2013, Pages 12–20 |
李健廷 |
Oct. 12 |
|
|
| Muhammad Rashed Alam, M. Sohel Rahman, "The Substring Inclusion Constraint Longest Common Subsequence Problem Can Be Solved in Quadratic Time," Journal of Discrete Algorithms, Volume 17, December 2012, pp. 67-73 |
廖玟雯 |
Oct. 12 |
|
|
| |
|
|
|
|