Finding all Occurrences of a Pattern by a Genetic Algorithm Based Divide-and-Conquer Method
Banerjee, S.; Chakrabarti, T.; Sinha, D.
International Journal of Computer Applications 64(18): 48-52
2013
ISSN/ISBN: 0975-8887 Accession: 084041342
Full-Text Article emailed within 1 workday
Payments are secure & encrypted
References
Guritman, S.; Wulandari, T.; Jaharuddin; Siswandi 2024: A computation method for finding Boolean Gröbner basis using divide and conquer algorithm AIP Conference Proceedings 3201(1): 030001Xiao, M. 2008: An improved divide-and-conquer algorithm for finding all minimum k-way cuts Lecture Notes in Computer Science 5369 LNCS: 208-219
Wang, X.; Chen, Z.Y.; Lusha, Z. 2020: An Improved Divide-and-Conquer Algorithm for Finding Top-k Longest Common Subsequence ACM International Conference Proceeding Series: 200-204
Ding, W.; Xue, G. 2011: A Divide-And-Conquer Algorithm for Finding a Most Reliable Source on a Ring-Embedded Tree Network with Unreliable Edges Discrete Mathematics, Algorithms and Applications 03(04): 503-516
Alfaro, A.; Doan, M.; Finke, J.; Galdes, M.; Zohdy, M. 2006: Application of Divide and Conquer Extended Genetic Algorithm to tertiary protein structure of chymotrypsin inhibitor-2 Applied Bionics and Biomechanics 3(4): 263-271
Alfaro, A.; Doan, M.; Finke, J.; Galdes, M.; Zohdy, M. 2006: Application of Divide and Conquer Extended Genetic Algorithm to Tertiary Protein Structure of Chymotrypsin Inhibitor-2 Applied Bionics and Biomechanics 3(4): 263-271
Wang, X.; He, L.; Tang, Y.; Wee, W.G. 2003: A divide and conquer deformable contour method with a model based searching algorithm IEEE Transactions on Systems Man and Cybernetics. Part B Cybernetics: a Publication of the IEEE Systems Man and Cybernetics Society 33(5): 738-751
Özyer, T.; Alhajj, R. 2008: Parallel clustering of high dimensional data by integrating multi-objective genetic algorithm with divide and conquer Applied Intelligence 31(3): 318-331
Liu, W.; Chen, L.; Chen, J. 2007: An efficient algorithm for multiple sequence alignment based on ant colony optimisation and divide-and-conquer method New Zealand Journal of Agricultural Research 50(5): 617-626
Kohler, J.; Labitzke, S. 2017: Divide & Conquer: Efficient and clear risk analysis and treatment; Divide & conquer: Effiziente und übersichtliche risikoanalyse und -behandlung VDI-Berichte 2017(2310): 3-14
Guting, R.H.; Wood, D. 1984: Finding Rectangle Intersections by Divide-and-Conquer IEEE Transactions on Computers C-33(7): 671-675
Peterson, V.V. 2006: The Divide and Conquer Exercise: Finding the Essence of Difficult Readings Communication Teacher 20(1): 14-17
Yoshikawa, T.; Takanashi, T.; Nakai, H. 2022: Quantum Algorithm of the Divide-and-Conquer Unitary Coupled Cluster Method with a Variational Quantum Eigensolver Journal of Chemical Theory and Computation 18(9): 5360-5373
Gu, M.; Eisenstat, S.C. 1995: A Divide-and-Conquer Algorithm for the Bidiagonal SVD SIAM Journal on Matrix Analysis and Applications 16(1): 79-92
Sugiyama, S.; Okuda, H.; Tatsuya, S. 2025: Divide-And-Conquer Multi Agent Path Finding for Fast Facility Layout Optimization IECON Proceedings (Industrial Electronics Conference)
Dougherty, R.L.; Hyman, J.M. 1994: A divide-and-conquer algorithm for grid generation Applied Numerical Mathematics 14(1-3): 125-134
Martínez-Herrera, A.F.; Céspedes-Mota, A.; Lopez-Aguayo, S. 2019: Divide and conquer algorithm for nondiffracting beams Journal of the Optical Society of America. a Optics Image Science and Vision 36(12): 1968-1976
Buchinger, D.; Rosso, R.S.U., Jr 2022: A divide-and-conquer algorithm for curve fitting CAD Computer Aided Design 151: 103362
Hatini, V.; Dinardo, S. 2001: Divide and conquer: Pattern formation in Drosophila embryonic epidermis Trends in Genetics: Tig 17(10): 574-579
Ming, G.U.; Guzzo, R.; Chi, X.B.; Cao, X.Q. 2004: A stable divide and conquer algorithm for the unitary eigenproblem Siam Journal on Matrix Analysis and Applications 25(2): 385-404