Добірка наукової літератури з теми "Shortest common superstring problem"
Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями
Ознайомтеся зі списками актуальних статей, книг, дисертацій, тез та інших наукових джерел на тему "Shortest common superstring problem".
Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.
Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.
Статті в журналах з теми "Shortest common superstring problem"
Gorbenko, Anna, and Vladimir Popov. "The shortest common superstring problem." Applied Mathematical Sciences 7 (2013): 2353–56. http://dx.doi.org/10.12988/ams.2013.13212.
Повний текст джерелаGorbenko, A., and V. Popov. "On multiple occurrences shortest common superstring problem." Applied Mathematical Sciences 7 (2013): 641–44. http://dx.doi.org/10.12988/ams.2013.13056.
Повний текст джерелаBilò, Davide, Hans-Joachim Böckenhauer, Dennis Komm, Richard Královič, Tobias Mömke, Sebastian Seibert, and Anna Zych. "Reoptimization of the Shortest Common Superstring Problem." Algorithmica 61, no. 2 (June 15, 2010): 227–51. http://dx.doi.org/10.1007/s00453-010-9419-8.
Повний текст джерелаPopov, V. "On reoptimization of the shortest common superstring problem." Applied Mathematical Sciences 7 (2013): 1195–97. http://dx.doi.org/10.12988/ams.2013.13109.
Повний текст джерелаLaube, Uli, and Maik Weinard. "CONDITIONAL INEQUALITIES AND THE SHORTEST COMMON SUPERSTRING PROBLEM." International Journal of Foundations of Computer Science 16, no. 06 (December 2005): 1219–30. http://dx.doi.org/10.1142/s0129054105003777.
Повний текст джерелаMa, Bin. "Why greed works for shortest common superstring problem." Theoretical Computer Science 410, no. 51 (November 2009): 5374–81. http://dx.doi.org/10.1016/j.tcs.2009.09.014.
Повний текст джерелаZaritsky, Assaf, and Moshe Sipper. "Coevolving solutions to the shortest common superstring problem." Biosystems 76, no. 1-3 (August 2004): 209–16. http://dx.doi.org/10.1016/j.biosystems.2004.05.013.
Повний текст джерелаTurner, Jonathan S. "Approximation algorithms for the shortest common superstring problem." Information and Computation 83, no. 1 (October 1989): 1–20. http://dx.doi.org/10.1016/0890-5401(89)90044-8.
Повний текст джерелаLaube, U., and M. Weinard. "ERRATUM: "CONDITIONAL INEQUALITIES AND THE SHORTEST COMMON SUPERSTRING PROBLEM"." International Journal of Foundations of Computer Science 17, no. 01 (February 2006): 247. http://dx.doi.org/10.1142/s0129054106003796.
Повний текст джерелаGLOOR, GREG, LILA KARI, MICHELLE GAASENBEEK, and SHENG YU. "TOWARDS A DNA SOLUTION TO THE SHORTEST COMMON SUPERSTRING PROBLEM." International Journal on Artificial Intelligence Tools 08, no. 04 (December 1999): 385–99. http://dx.doi.org/10.1142/s0218213099000269.
Повний текст джерелаДисертації з теми "Shortest common superstring problem"
Plociennik, Kai. "From Worst-Case to Average-Case Efficiency – Approximating Combinatorial Optimization Problems." Doctoral thesis, Universitätsbibliothek Chemnitz, 2011. http://nbn-resolving.de/urn:nbn:de:bsz:ch1-qucosa-65314.
Повний текст джерелаPlociennik, Kai. "From Worst-Case to Average-Case Efficiency – Approximating Combinatorial Optimization Problems: From Worst-Case to Average-Case Efficiency – Approximating Combinatorial Optimization Problems." Doctoral thesis, 2010. https://monarch.qucosa.de/id/qucosa%3A19469.
Повний текст джерелаLee, Pei-Chen, and 李佩真. "Application of Stochastic Optimization Methodology to Bioinformatics -- A Case Study on Applying Ant Colony Optimization to the Shortest Superstring problem." Thesis, 2007. http://ndltd.ncl.edu.tw/handle/8cc5d6.
Повний текст джерела國立臺北科技大學
工業工程與管理研究所
95
Bioinformatics has received wide attention in recent years. It is interesting to see how stochastic optimization methodologies such as genetic algorithm, simulated annealing and ant colony optimization, that can be applied to solve problems in bioinformatics. Among many research problems in bioinformatics, the shortest superstring problem has wide applications in many research areas, such as DNA sequencing and data compression. However, the problem is NP-hard and difficult to solve efficiently. In the literature, the ant colony optimization algorithm has been reported to be successfully applied to many combinatorial problems, such as the traveling salesperson problem and the assignment problem. In this paper, we describe the use of the ant colony optimization algorithm to solve the shortest superstring problem, which highlights a way for applying stochastic optimization methodologies to solve problem in bioinformatics.
Частини книг з теми "Shortest common superstring problem"
Bilò, Davide, Hans-Joachim Böckenhauer, Dennis Komm, Richard Královič, Tobias Mömke, Sebastian Seibert, and Anna Zych. "Reoptimization of the Shortest Common Superstring Problem." In Combinatorial Pattern Matching, 78–91. Berlin, Heidelberg: Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-642-02441-2_8.
Повний текст джерелаLópez-Rodríguez, D., and E. Mérida-Casermeiro. "Shortest Common Superstring Problem with Discrete Neural Networks." In Adaptive and Natural Computing Algorithms, 62–71. Berlin, Heidelberg: Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-642-04921-7_7.
Повний текст джерелаGonzález, Luis C., Heidi J. Romero, and Carlos A. Brizuela. "A Genetic Algorithm for the Shortest Common Superstring Problem." In Genetic and Evolutionary Computation – GECCO 2004, 1305–6. Berlin, Heidelberg: Springer Berlin Heidelberg, 2004. http://dx.doi.org/10.1007/978-3-540-24855-2_139.
Повний текст джерелаGonzález-Gurrola, Luis C., Carlos A. Brizuela, and Everardo Gutiérrez. "A Genetic Algorithm for the Shortest Common Superstring Problem." In Advances in Artificial Intelligence – IBERAMIA 2004, 851–60. Berlin, Heidelberg: Springer Berlin Heidelberg, 2004. http://dx.doi.org/10.1007/978-3-540-30498-2_85.
Повний текст джерелаCrochemore, Maxime, Marek Cygan, Costas Iliopoulos, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, and Tomasz Waleń. "Algorithms for Three Versions of the Shortest Common Superstring Problem." In Combinatorial Pattern Matching, 299–309. Berlin, Heidelberg: Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-13509-5_27.
Повний текст джерелаNikolaev, Maksim S. "All Instantiations of the Greedy Algorithm for the Shortest Common Superstring Problem are Equivalent." In String Processing and Information Retrieval, 61–67. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-86692-1_6.
Повний текст джерелаBongartz, Dirk. "On the Approximation Ratio of the Group-Merge Algorithm for the Shortest Common Superstring Problem." In SOFSEM 2000: Theory and Practice of Informatics, 298–306. Berlin, Heidelberg: Springer Berlin Heidelberg, 2000. http://dx.doi.org/10.1007/3-540-44411-4_18.
Повний текст джерелаGevezes, Theodoros P., and Leonidas S. Pitsoulis. "The Shortest Superstring Problem." In Optimization in Science and Engineering, 189–227. New York, NY: Springer New York, 2014. http://dx.doi.org/10.1007/978-1-4939-0808-0_10.
Повний текст джерелаPlociennik, Kai. "A Probabilistic PTAS for Shortest Common Superstring." In Mathematical Foundations of Computer Science 2009, 624–35. Berlin, Heidelberg: Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-642-03816-7_53.
Повний текст джерелаGotthilf, Zvi, Moshe Lewenstein, and Alexandru Popa. "On Shortest Common Superstring and Swap Permutations." In String Processing and Information Retrieval, 270–78. Berlin, Heidelberg: Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-16321-0_28.
Повний текст джерелаТези доповідей конференцій з теми "Shortest common superstring problem"
Leonova, Yuliya F., and Anatoly V. Panyukov. "Application of the Cycles Merging Algorithm to the Shortest Common Superstring Problem." In 2020 Global Smart Industry Conference (GloSIC). IEEE, 2020. http://dx.doi.org/10.1109/glosic50886.2020.9267863.
Повний текст джерелаBuzdalov, Maxim, and Fedor Tsarev. "An Evolutionary Approach to Hard Test Case Generation for Shortest Common Superstring Problem." In 2013 BRICS Congress on Computational Intelligence & 11th Brazilian Congress on Computational Intelligence (BRICS-CCI & CBIC). IEEE, 2013. http://dx.doi.org/10.1109/brics-cci-cbic.2013.24.
Повний текст джерелаKhadiev, Kamil, and Carlos M. Bosch Machado. "Quantum algorithm for the shortest superstring problem." In International Conference on Micro- and Nano-Electronics 2021, edited by Konstantin V. Rudenko and Vladimir F. Lukichev. SPIE, 2022. http://dx.doi.org/10.1117/12.2624618.
Повний текст джерелаKhalid, Ali, Anthony Enem, and Eduardo Colmenares. "Distributed Cache-Reduction Approach to DNA Sequencing Using a Greedy Algorithm for the Shortest Common Superstring." In 2018 International Conference on Computational Science and Computational Intelligence (CSCI). IEEE, 2018. http://dx.doi.org/10.1109/csci46756.2018.00267.
Повний текст джерелаSaifullah, C. M. Khaled, and Md Rafiqul Islam. "Solving shortest common supersequence problem using chemical reaction optimization." In 2016 5th International Conference on Informatics, Electronics and Vision (ICIEV). IEEE, 2016. http://dx.doi.org/10.1109/iciev.2016.7760187.
Повний текст джерелаBarone, Paolo, Paola Bonizzoni, Gianluca Delta Vedova, and Giancarlo Mauri. "An approximation algorithm for the shortest common supersequence problem." In the 2001 ACM symposium. New York, New York, USA: ACM Press, 2001. http://dx.doi.org/10.1145/372202.372275.
Повний текст джерелаKubalik, Jiri. "Evolutionary-based iterative local search algorithm for the shortest common supersequence problem." In the 13th annual conference. New York, New York, USA: ACM Press, 2011. http://dx.doi.org/10.1145/2001576.2001620.
Повний текст джерелаNing, Kang, and Hon Wai Leong. "Towards a Better Solution to the Shortest Common Supersequence Problem: A Post." In 2006 International Multi-Symposiums on Computer and Computational Sciences (IMSCCS). IEEE, 2006. http://dx.doi.org/10.1109/imsccs.2006.136.
Повний текст джерелаKubalík, Jiří. "Efficient stochastic local search algorithm for solving the shortest common supersequence problem." In the 12th annual conference. New York, New York, USA: ACM Press, 2010. http://dx.doi.org/10.1145/1830483.1830529.
Повний текст джерелаRomano, Giulia, Matteo Castiglioni, Alberto Marchesi, and Nicola Gatti. "The Power of Media Agencies in Ad Auctions: Improving Utility through Coordinated Bidding." In Thirty-First International Joint Conference on Artificial Intelligence {IJCAI-22}. California: International Joint Conferences on Artificial Intelligence Organization, 2022. http://dx.doi.org/10.24963/ijcai.2022/66.
Повний текст джерела