Bioinformatics and Computation

1998 1999 2000 2001 2002 2003 2004 2005 2006 2007 2008 2009 2010 2011 2012 2013 2014 2015 2016 2017 2018 2019 2020 2021

2020年

Presentation file introducer date paper video
R. Ranjani Rani and D. Ramyachitra, Antlion optimization algorithm for pairwise structural alignment with bi-objective functions, Neural Computing and Applications, 31(19), 2019, 3139–3146. 蔡豐仰 Jan. 07
H.-T. Chan, C.-B. Yang, and Y.-H. Peng, “The generalized denitions of the twodimensional largest common substructure problems,” Proc. of the 33rd Workshop on Combinatorial Mathematics and Computation Theory, Taipei, Taiwan, pp. 1–12, 2016. 賴冠霖 Jan. 07
Z. Mehmood, T. Mahmood, and M. A. Javid, “Content-based image retrieval and semantic automatic image annotation based on the weighted average of triangular histograms using support vector machine,” Applied Intelligence, vol. 48, no. 1, pp. 166–181, 2017 李子旭 Jan. 07
Kurniawan D H and Munir R (2015), A New String Matching Algorithm Based on Logical Indexing, The 5th International Conference on Electrical Engineering and Informatics, Denpasar, Indonesia, pp. 394-399. 張育誠 Jan. 14
Lei Sha, Xiaodong Zhang, Feng Qian, Baobao Chang, and Zhifang Sui. 2018. A multi-view fusion neural network for answer selection. In Thirty-Second AAAI Conference on Artificial Intelligence. 陳佳琳 Jan. 14
Ratul Bhowmick, Ibrahim Sadek Bhuiyan, Sabir Hossain, Muhammad Kamal Hossen and Ahsan Sadee Tanim , An Approach for Improving Complexity of Longest Common Subsequence Problems using Queue and Divide-and-Conquer Method, 2019 1st International Conference on Advances in Science, Engineering and Robotics Technology (ICASERT), Dhaka, Bangladesh, Bangladesh, 3-5 May 2019. 吳篤承 Jan. 14
Ayad, L.A.K., Bernardini, G., Grossi, R., Iliopoulos, C.S., Pisanti, N., Pissis, S.P., Rosone, G.: Longest property-preserved common factor. In: 25th International Symposium on String Processing and Information Retrieval (SPIRE). pp. 42–49. Springer LNCS 11147 (2018). 李紹瑄 Jan. 21
Yang Y, et al. MiRGOFS: A GO-based functional similarity measure for miRNAs, with applications to the prediction of miRNA subcellular localization and miRNA-disease association. Bioinformatics. 2018. 呂政彥 Jan. 21
Levon Aslanyan, LCS Algorithm with Vector-markers, Institute for Informatics and Automation Problems of the National Academy of Science of Armenia. 蔡元修 Jan. 21
Y.T. Tsai, The Constrained Longest Common Subsequence Problem, Information Processing Letters 88, 2003, 173–176. 吳智愷 Feb. 18
Muhammad Rashed Alam and M. Sohel Rahman. The substring inclusion constraint longest common subsequence problem can be solved in quadratic time. Journal of Discrete Algorithms, 17:67–73, 2012. 宋恩安 Feb. 18
W. R. Pearson, “Selecting the right similarity-scoring matrix,” Current Protocols in Bioinformatics, vol. 43, pp. 3.5.1–3.5.9, 2013. 蔡豐仰 Feb. 18
Huang, Chaolin, et al. "Clinical features of patients infected with 2019 novel coronavirus in Wuhan, China." The lancet 395.10223 (2020): 497-506. 張育誠 Feb. 25
Fici, Gabriele, et al. "A subquadratic algorithm for minimum palindromic factorization." Journal of Discrete Algorithms 28 (2014): 41-48. 賴冠霖 Feb. 25
Nakatsu, N., Kambayashi, Y., & Yajima, S. (1982). A longest common subsequence algorithm suitable for similar text strings. Acta Informatica, 18(2), 171-179. 李子旭 Feb. 25
SHIKDER, Rayhan, et al. An OpenMP-based tool for finding longest common subsequence in bioinformatics. BMC research notes, 2019, 12.1: 220. 蔡元修 Mar. 03
XUAN, Ping, et al. Prediction of microRNAs associated with human diseases based on weighted k most similar neighbors. PloS one, 2013, 8.8. 呂政彥 Mar. 03
INOUE, Takafumi, et al. Computing longest common square subsequences. In: 29th Annual Symposium on Combinatorial Pattern Matching, CPM 2018. Schloss Dagstuhl-Leibniz-Zentrum für Informatik, Dagstuhl Publishing, 2018. 李紹瑄 Mar. 03
Chen, Y. C., & Chao, K. M. (2011). On the generalized constrained longest common subsequence problems. Journal of Combinatorial Optimization, 21(3), 383-392. 吳篤承 Mar. 10
LI, Zhengxin, et al. Speed Up Similarity Search of Time Series Under Dynamic Time Warping. IEEE Access, 2019, 7: 163644-163653. 宋恩安 Mar. 10
LAI, Siwei, et al. Recurrent convolutional neural networks for text classification. In: Twenty-ninth AAAI conference on artificial intelligence. 2015. 陳佳琳 Mar. 10
DONG, Honghui, et al. Traffic speed estimation using mobile phone location data based on longest common subsequence. In: 2018 21st International Conference on Intelligent Transportation Systems (ITSC). IEEE, 2018. p. 2819-2824. 吳智愷 Mar. 17
Wang, X., Wang, L., & Zhu, D. (2019). Efficient Computation of Longest Common Subsequences with Multiple Substring Inclusive Constraints. Journal of Computational Biology, 26(9), 938-947. 張育誠 Mar. 17
Price, G. A., Crooks, G. E., Green, R. E., & Brenner, S. E. (2005). Statistical evaluation of pairwise protein sequence comparison with the Bayesian bootstrap. Bioinformatics, 21(20), 3824-3831. 蔡豐仰 Mar. 17
GEIZHALS, Sara H.; SOKOL, Dina. Finding maximal 2-dimensional palindromes. Information and Computation, 2019, 266: 161-172. 賴冠霖 Mar. 24
Alves, C. E. R., Cáceres, E. N., & Song, S. W. (2008). An all-substrings common subsequence algorithm. Discrete Applied Mathematics, 156(7), 1025-1035. 李紹瑄 Mar. 24
FERREIRA, Carlos E.; TJANDRAATMADJA, Christian. A branch-and-cut approach to the repetition-free longest common subsequence problem. Electronic Notes in Discrete Mathematics, 2010, 36: 527-534. 李子旭 Mar. 24
PEARSON, William R. Selecting the right similarity‐scoring matrix. Current protocols in bioinformatics, 2013, 43.1: 3.5. 1-3.5. 9. 蔡元修 Apr. 07
Li, G., Luo, J., Xiao, Q., Liang, C., Ding, P., & Cao, B. (2017). Predicting microrna-disease associations using network topological similarity based on deepwalk. Ieee Access, 5, 24032-24039. 呂政彥 Apr. 07
Chen, M., Jin, X., & Shen, D. (2011, June). Short text classification improved by learning multi-granularity topics. In Twenty-Second International Joint Conference on Artificial Intelligence. 陳佳琳 Apr. 07
YAMADA, Kohei, et al. Faster STR-EC-LCS Computation. In: International Conference on Current Trends in Theory and Practice of Informatics. Springer, Cham, 2020. p. 125-135. 吳篤承 Apr. 14
Apostolico, A., Landau, G. M., & Skiena, S. (1997). Matching for run-length encoded strings (pp. 348-356). IEEE. 宋恩安 Apr. 14
Neamatollahi, P., Hadi, M., & Naghibzadeh, M. (2020). Simple and Efficient Pattern Matching Algorithms for Biological Sequences. IEEE Access, 8, 23838-23846. 張育誠 Apr. 14
陳冠甫, Workload- and Resource-Aware List-Based Workflow Scheduling. 2019. PhD Thesis. 吳智愷 Apr. 21
LANDAU, Gad M.; ZIV-UKELSON, Michal. On the common substring alignment problem. Journal of Algorithms, 2001, 41.2: 338-359. 李紹瑄 Apr. 21
GREEN, RICHARD E.; BRENNER, STEVEN E. Bootstrapping and normalization for enhanced evaluations of pairwise sequence comparison. Proceedings of the IEEE, 2002, 90.12: 1834-1847. 蔡豐仰 Apr. 21
ZAHID, Saad Khan, et al. A novel structure of the Smith-Waterman Algorithm for efficient sequence alignment. In: 2015 Third International Conference on Digital Information, Networking, and Wireless Communications (DINWC). IEEE, 2015. p. 6-9. 蔡元修 May. 05
PEARSON, William R. An introduction to sequence similarity (“homology”) searching. Current protocols in bioinformatics, 2013, 42.1: 3.1. 1-3.1. 8. 李子旭 May. 05
FELBO, Bjarke, et al. Using millions of emoji occurrences to learn any-domain representations for detecting sentiment, emotion and sarcasm. arXiv preprint arXiv:1708.00524, 2017. 陳佳琳 May. 12
KWON, Yeondae, et al. Associated disease frequency-based measure for finding candidate target genes from the biomedical literature. In: 2011 International Conference on Complex, Intelligent, and Software Intensive Systems. IEEE, 2011. p. 524-529. 呂政彥 May. 12
ANN, Hsing-Yen, et al. A fast and simple algorithm for computing the longest common subsequence of run-length encoded strings. Information Processing Letters, 2008, 108.6: 360-364. 宋恩安 May. 12
TANG, Xiaolu, et al. On the origin and continuing evolution of SARS-CoV-2. National Science Review, 2020. 張育誠 May. 20
TOPCUOGLU, Haluk; HARIRI, Salim; WU, Min-You. Task scheduling algorithms for heterogeneous processors. In: Proceedings. Eighth Heterogeneous Computing Workshop (HCW'99). IEEE, 1999. p. 3-14. 吳智愷 May. 20
LANDAU, Gad M.; MYERS, Eugene W.; SCHMIDT, Jeanette P. Incremental string comparison. SIAM Journal on Computing, 1998, 27.2: 557-582. 李紹瑄 May. 27
HESS, Martin, et al. Addressing inaccuracies in BLOSUM computation improves homology search performance. BMC bioinformatics, 2016, 17.1: 189. 蔡豐仰 May. 27
余清祥. 統計在紅樓夢的應用. 1998. 陳佳琳 Jun. 03
BRENNER, Steven E.; CHOTHIA, Cyrus; HUBBARD, Tim JP. Assessing sequence comparison methods with reliable structurally identified distant evolutionary relationships. Proceedings of the National Academy of Sciences, 1998, 95.11: 6073-6078. 李子旭 Jun. 03
CHAKRABORTY, Angana; BANDYOPADHYAY, Sanghamitra. FOGSAA: Fast optimal global sequence alignment algorithm. Scientific reports, 2013, 3: 1746. 蔡元修 Jun. 03
ALBERT, Michael H., et al. Longest increasing subsequences in sliding windows. Theoretical Computer Science, 2004, 321.2-3: 405-414. 張育誠 Jun. 10
WANG, Lei, et al. A dynamic programming solution to a generalized LCS problem. Information Processing Letters, 2013, 113.19-21: 723-728. 宋恩安 Jun. 10
LANDAU, Gad M.; MYERS, Eugene; ZIV-UKELSON, Michal. Two algorithms for LCS consecutive suffix alignment. In: Annual Symposium on Combinatorial Pattern Matching. Springer, Berlin, Heidelberg, 2004. p. 173-193. 李紹瑄 Jun. 16
Huang, Kuo-Chan, and Meng-Han Tsai. "Task ranking and allocation heuristics for efficient workflow schedules." 2016 International Computer Symposium (ICS). IEEE, 2016. 吳智愷 Jun. 16
JIANG, Nanjiang; DE MARNEFFE, Marie-Catherine. Do you know that florence is packed with visitors? evaluating state-of-the-art models of speaker commitment. In: Proceedings of the 57th Annual Meeting of the Association for Computational Linguistics. 2019. p. 4208-4213. 陳佳琳 Jun. 30
RIZK, Guillaume; LAVENIER, Dominique. GASSST: global alignment short sequence search tool. Bioinformatics, 2010, 26.20: 2534-2540. 蔡元修 Jun. 30
YANG, Xin-She. Firefly algorithm, Levy flights and global optimization. In: Research and development in intelligent systems XXVI. Springer, London, 2010. p. 209-218. 李子旭 Jul. 08
Ann, Hsing-Yen, Chang-Biau Yang, and Chiou-Ting Tseng. "Efficient polynomial-time algorithms for the constrained LCS problem with strings exclusion." Journal of Combinatorial Optimization 28.4 (2014): 800-813. 宋恩安 Jul. 08
DEOROWICZ, Sebastian. An algorithm for solving the longest increasing circular subsequence problem. Information Processing Letters, 2009, 109.12: 630-634. 張育誠 Jul. 15
ISHIDA, Yusuke, et al. Fully incremental LCS computation. In: International Symposium on Fundamentals of Computation Theory. Springer, Berlin, Heidelberg, 2005. p. 563-574. 李紹瑄 Jul. 15
Supeno, Handoko, Pranoto H. Rusmin, and Hilwadi Hindersah. "Optimum scheduling system for container truck based on genetic algorithm on spin (Simulator Pelabuhan Indonesia)." 2015 4th International Conference on Interactive Digital Media (ICIDM). IEEE, 2015. 吳智愷 Jul. 15
TSAI, Chun-Wei. Search economics: A solution space and computing resource aware search method. In: 2015 IEEE International Conference on Systems, Man, and Cybernetics. IEEE, 2015. p. 2555-2560. 李子旭 Jul. 21
Liu, Jia-Jie, Yue-Li Wang, and Yu-Shan Chiu. "Constrained longest common subsequences with run-length-encoded strings." The Computer Journal 58.5 (2015): 1074-1084. 宋恩安 Jul. 28
Smith, Temple F., and Michael S. Waterman. "Identification of common molecular subsequences." Journal of molecular biology 147.1 (1981): 195-197. 蔡元修 Jul. 28
KIM, Jinil, et al. Order-preserving matching. Theoretical Computer Science, 2014, 525: 68-79. 張育誠 Aug. 04
ABDEL-BASSET, Mohamed; ABDEL-FATAH, Laila; SANGAIAH, Arun Kumar. Metaheuristic algorithms: A comprehensive review. In: Computational intelligence for multimedia big data on the cloud with engineering applications. Academic Press, 2018. p. 185-231. 李子旭 Aug. 04
HOU, Edwin SH; ANSARI, Nirwan; REN, Hong. A genetic algorithm for multiprocessor scheduling. IEEE Transactions on Parallel and Distributed systems, 1994, 5.2: 113-120. 吳智愷 Aug. 04
ANN, Hsing-Yen, et al. Fast algorithms for computing the constrained LCS of run-length encoded strings. Theoretical Computer Science, 2012, 432: 1-9. 宋恩安 Aug. 11
CHARTER, Kevin; SCHAEFFER, Jonathan; SZAFRON, Duane. Sequence alignment using FastLSA. In: International conference on mathematics and engineering techniques in medicine and biological sciences. 2000. p. 239-245. 李紹瑄 Aug. 11
AKL, Selim G.; TOUSSAINT, Godfried T. A fast convex hull algorithm. Information processing letters, 1978, 7.5: 219-222. 蔡元修 Aug. 11
Vellozo, Augusto F., Carlos ER Alves, and Alair Pereira do Lago. "Alignment with non-overlapping inversions in O (n 3)-time." International Workshop on Algorithms in Bioinformatics. Springer, Berlin, Heidelberg, 2006. 張育誠 Aug. 18
Issa, Mohamed, et al. "ASCA-PSO: Adaptive sine cosine optimization algorithm integrated with particle swarm for pairwise local sequence alignment." Expert Systems with Applications 99 (2018): 56-70. 李子旭 Aug. 18
Khan, Minhaj Ahmad. "Scheduling for heterogeneous systems using constrained critical paths." Parallel Computing 38.4-5 (2012): 175-193. 吳智愷 Aug. 18
Wei, Shiwei, et al. "A path recorder algorithm for Multiple Longest Common Subsequences (MLCS) problems." Bioinformatics 36.10 (2020): 3035-3042. 李紹瑄 Aug. 25
Liu, Jia Jie, Yue-Li Wang, and Richard CT Lee. "Finding a longest common subsequence between a run-length-encoded string and an uncompressed string." Journal of Complexity 24.2 (2008): 173-184. 宋恩安 Aug. 25
Lakhani, Jyoti, et al. "MPSAGA: a matrix-based pair-wise sequence alignment algorithm for global alignment with position based sequence representation." Sādhanā 44.7 (2019): 171. 蔡元修 Aug. 25
Crochemore, Maxime, and Ely Porat. "Fast computation of a longest increasing subsequence and application." Information and computation 208.9 (2010): 1054-1059. 張育誠 Sept. 01
Goldberg, David E., et al. "RapidAccurate Optimization of Difficult Problems Using Fast Messy Genetic Algorithms." ICGA. Vol. 5. 1993. 李子旭 Sept. 08
Arnold, Michael, and Enno Ohlebusch. "Linear time algorithms for generalizations of the longest common substring problem." Algorithmica 60.4 (2011): 806-818. 宋恩安 Sept. 08
Ilavarasan, E., P. Thambidurai, and R. Mahilmannan. "Performance effective task scheduling algorithm for heterogeneous computing system." The 4th international symposium on parallel and distributed computing (ISPDC'05). IEEE, 2005. 吳智愷 Sept. 08
Juola, Patrick. Authorship attribution. Vol. 3. Now Publishers Inc, 2008. 陳佳琳 Sept. 15
Kuo, Chih-En, et al. "Resequencing a set of strings based on a target string." Algorithmica 72.2 (2015): 430-449. 李紹瑄 Sept. 15
Bandyopadhyay, Sanghamitra, and Ramkrishna Mitra. "A parallel pairwise local sequence alignment algorithm." IEEE Transactions on NanoBioscience 8.2 (2009): 139-146. 林鑫成 Sept. 15
Chakraborty, Angana, and Sanghamitra Bandyopadhyay. "conLSH: Context based Locality Sensitive Hashing for mapping of noisy SMRT reads." Computational Biology and Chemistry 85 (2020): 107206. 蔡元修 Sept. 22
Yang, I-Hsuan, and Yi-Ching Chen. "Fast algorithms for the constrained longest increasing subsequence problems." Proceedings of the 25th Workshop on Combinatorial Mathematics and Computing Theory. 2008. 張育誠 Sept. 22
Matarazzo, Ury, Dekel Tsur, and Michal Ziv-Ukelson. "Efficient all path score computations on grid graphs." Theoretical Computer Science 525 (2014): 138-149. 廖郁儒 Sept. 29
Topcuoglu, Haluk, Salim Hariri, and Min-you Wu. "Performance-effective and low-complexity task scheduling for heterogeneous computing." IEEE transactions on parallel and distributed systems 13.3 (2002): 260-274. 吳智愷 Sept. 29
Javidy, Behzad, Abdolreza Hatamlou, and Seyedali Mirjalili. "Ions motion algorithm for solving optimization problems." Applied Soft Computing 32 (2015): 72-79. 李子旭 Oct. 06
Babenko, Maxim A., and Tatiana A. Starikovskaya. "Computing the longest common substring with one mismatch." Problems of Information Transmission 47.1 (2011): 28-33. 宋恩安 Oct. 06
Tseng, Chiou-Ting, Chang-Biau Yang, and Hsing-Yen Ann. "Minimum height and sequence constrained longest increasing subsequence." Journal of Internet Technology 10.2 (2009): 173-178. 詹敬平 Oct. 06
Arabi E. keshk. "Enhanced dynamic algorithm of genome sequence alignments."International Journal of Emerging Trends & Technology in Computer Science, 2014, Vol. 2, Issue 6. 吳爵君 Oct. 14
Peng, Zhan, and Yuping Wang. "A novel efficient graph model for the multiple longest common subsequences (MLCS) problem." Frontiers in genetics 8 (2017): 104. 李紹瑄 Oct. 14
Waterman, Michael S., and Mark Eggert. "A new algorithm for best subsequence alignments with application to tRNA-rRNA comparisons." Journal of molecular biology 197.4 (1987): 723-728. 林鑫成 Oct. 22
BENDER, Michael A.; FARACH-COLTON, Martin. The LCA problem revisited. In: Latin American Symposium on Theoretical Informatics. Springer, Berlin, Heidelberg, 2000. p. 88-94. 張育誠 Oct. 22
HAQUE, Waqar; ARAVIND, Alex; REDDY, Bharath. Pairwise sequence alignment algorithms: a survey. In: Proceedings of the 2009 conference on Information Science, Technology and Applications. 2009. p. 96-103. 蔡元修 Oct. 27
KAUR, Yadvir; SOHI, Neelofar. Pairwise sequence alignment method using flower pollination algorithm. In: 2017 4th International Conference on Signal Processing, Computing and Control (ISPCC). IEEE, 2017. p. 408-413. 李子旭 Oct. 27
KESHAVARZ-KOHJERDI, Fatemeh; BAGHERI, Alireza; ASGHARIAN-SARDROUD, Asghar. A linear-time algorithm for the longest path problem in rectangular grid graphs. Discrete Applied Mathematics, 2012, 160.3: 210-217. 宋恩安 Oct. 27
YAMAMOTO, Hiroaki. A faster algorithm for finding shortest substring matches of a regular expression. Information Processing Letters, 2019, 143: 56-60. 詹近平 Nov. 03
BITTENCOURT, Luiz F.; SAKELLARIOU, Rizos; MADEIRA, Edmundo RM. Dag scheduling using a lookahead variant of the heterogeneous earliest finish time algorithm. In: 2010 18th Euromicro Conference on Parallel, Distributed and Network-based Processing. IEEE, 2010. p. 27-34. 吳智愷 Nov. 03
ZHU, Daxin; WANG, Xiaodong. A simple algorithm for solving for the generalized longest common subsequence (LCS) problem with a substring exclusion constraint. Algorithms, 2013, 6.3: 485-493. 廖育儒 Nov. 10
Tiskin, Alexander. "Semi-local longest common subsequences in subquadratic time." Journal of Discrete Algorithms 6.4 (2008): 570-581. 李紹瑄 Nov. 10
BRODAL, Gerth Stølting, et al. Faster algorithms for computing longest common increasing subsequences. In: Annual Symposium on Combinatorial Pattern Matching. Springer, Berlin, Heidelberg, 2006. p. 330-341. 張育誠 Nov. 17
GONZALES, Eloy, et al. Web Mining using Genetic Relation Algorithm. In: Proceedings of SICE Annual Conference 2010. IEEE, 2010. p. 1622-1627. 吳爵君 Nov. 17
Fickett, James W. "Fast optimal alignment." (1984): 175-179. 蔡元修 Nov. 24
YANG, Jiaoyun; XU, Yun; SHANG, Yi. An efficient parallel algorithm for longest common subsequence problem on gpus. In: Proceedings of the world congress on engineering. 2010. p. 499-504. 林鑫成 Nov. 24
MIRJALILI, Seyedali. Moth-flame optimization algorithm: A novel nature-inspired heuristic paradigm. Knowledge-based systems, 2015, 89: 228-249. 李子旭 Nov. 24
HAGRAS, Tarek; JANECEK, Jan. A high performance, low complexity algorithm for compile-time task scheduling in heterogeneous systems. In: 18th International Parallel and Distributed Processing Symposium, 2004. Proceedings. IEEE, 2004. p. 107. 吳智愷 Dec. 01
DJUKANOVIC, Marko, et al. An A⁎ search algorithm for the constrained longest common subsequence problem. Information Processing Letters, 2020, 106041. 宋恩安 Dec. 01
Li, Yubo. "An Efficient Algorithm for LCS Problem between Two Arbitrary Sequences." Mathematical Problems in Engineering 2018 (2018). 李紹瑄 Dec. 16
ZHANG, Zhigang; JI, Genlin; TANG, Mengmeng. MREclat: an algorithm for parallel mining frequent itemsets. In: 2013 International Conference on Advanced Cloud and Big Data. IEEE, 2013. p. 177-180. 廖育儒 Dec. 16
Yixin Chen, Andrew Wan & Wei Liu "A fast parallel algorithm for finding the longest common sequence of multiple biosequences" BMC Bioinformatics, volume 7, Supplement 4, 2006 蔡元修 Dec. 23
Marius Nicolae, Sanguthevar Rajasekaran "On pattern matching with k mismatches and few don’t cares" Information Processing Letters 118 (2017) P78~P82 詹敬平 Dec. 23
Maxime Crochemore, Chiara Epifanio, Roberto Grossi, Filippo Mignosi "Linear-Size Suffix Tries"Theoretical Computer Science Volume 638, 25 July 2016, Pages 171-178 張育誠 Dec. 23
Muzaffar Eusuff, Kevin Lansey and Fayzul Pasha "Shuffled Frog-leaping Algorithm: A Memetic Metaheuristic for Discrete Optimization" Engineering Optimization, Vol. 38, No. 2, pp. 129-154, 2006 李子旭 Dec. 29
Lindong Liu and Deyu Qi "An Independent Task Scheduling Algorithm in Heterogeneous Multi-core Processor Environment" 2018 IEEE 3rd Advanced Information Technology, Electronic and Automation Control Conference (IAEAC), Chongqing, 2018, pp. 142-146 吳智愷 Dec. 29
Md. Rafiqul Islam, Zarrin Tasnim Asha and Rezoana Ahmed "Longest Common Subsequence Using Chemical Reaction Optimization" Proceedings of International Conference on Electrical Information and Communication Technology (EICT 2015), Khulna, Bangladesh 吳爵君 Dec. 29
         

 

1998 1999 2000 2001 2002 2003 2004 2005 2006 2007 2008 2009 2010 2011 2012 2013 2014 2015 2016 2017 2018 2019 2020 2021