Статті в журналах з теми "Shortest common superstring problem"
Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями
Ознайомтеся з топ-50 статей у журналах для дослідження на тему "Shortest common superstring problem".
Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.
Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.
Переглядайте статті в журналах для різних дисциплін та оформлюйте правильно вашу бібліографію.
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.
Повний текст джерелаFici, Gabriele, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, and Tomasz Waleń. "On the greedy algorithm for the Shortest Common Superstring problem with reversals." Information Processing Letters 116, no. 3 (March 2016): 245–51. http://dx.doi.org/10.1016/j.ipl.2015.11.015.
Повний текст джерелаEn-hui Yang and Zhen Zhang. "The shortest common superstring problem: average case analysis for both exact and approximate matching." IEEE Transactions on Information Theory 45, no. 6 (1999): 1867–86. http://dx.doi.org/10.1109/18.782108.
Повний текст джерелаLedesma, Lucas, Daniel Manrique, and Alfonso Rodríguez-Patón. "A tissue P system and a DNA microfluidic device for solving the shortest common superstring problem." Soft Computing 9, no. 9 (August 11, 2004): 679–85. http://dx.doi.org/10.1007/s00500-004-0398-z.
Повний текст джерелаLedesma, Lucas, Daniel Manrique, and Alfonso Rodríguez-Patón. "A tissue P system and a DNA microfluidic device for solving the shortest common superstring problem." Soft Computing 9, no. 9 (December 1, 2004): 691. http://dx.doi.org/10.1007/s00500-004-0423-2.
Повний текст джерелаKusuma, Wisnu Ananta, and Albert Adrianus. "Pengkontruksian Bidirected Overlap Graph untuk Perakitan Sekuens DNA." Jurnal Teknologi Informasi dan Ilmu Komputer 7, no. 2 (February 18, 2020): 407. http://dx.doi.org/10.25126/jtiik.2020722070.
Повний текст джерелаAlexander, Kenneth S. "Shortest common superstrings of random strings." Journal of Applied Probability 33, no. 4 (December 1996): 1112–26. http://dx.doi.org/10.2307/3214990.
Повний текст джерелаAlexander, Kenneth S. "Shortest common superstrings of random strings." Journal of Applied Probability 33, no. 04 (December 1996): 1112–26. http://dx.doi.org/10.1017/s002190020010052x.
Повний текст джерелаXikui, Liu, Li Yan, and Xu Jin. "DNA Directed Model for Shortest Superstring Problem." Journal of Computational and Theoretical Nanoscience 8, no. 10 (October 1, 2011): 2112–17. http://dx.doi.org/10.1166/jctn.2011.1933.
Повний текст джерелаPlociennik, Kai. "A probabilistic PTAS for shortest common superstring." Theoretical Computer Science 522 (February 2014): 44–53. http://dx.doi.org/10.1016/j.tcs.2013.12.005.
Повний текст джерелаGorbenko, A., and V. Popov. "The swap common superstring problem." Applied Mathematical Sciences 7 (2013): 609–14. http://dx.doi.org/10.12988/ams.2013.13052.
Повний текст джерелаNa, Joong Chae, Sukhyeun Cho, Siwon Choi, Jin Wook Kim, Kunsoo Park, and Jeong Seop Sim. "A new graph model and algorithms for consistent superstring problems." Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences 372, no. 2016 (May 28, 2014): 20130134. http://dx.doi.org/10.1098/rsta.2013.0134.
Повний текст джерелаFrieze, A., and W. Szpankowski. "Greedy Algorithms for the Shortest Common Superstring That Are Asymptotically Optimal." Algorithmica 21, no. 1 (May 1998): 21–36. http://dx.doi.org/10.1007/pl00009207.
Повний текст джерелаGorbenko, Anna, and Vladimir Popov. "The shortest common parameterized supersequence problem." Applied Mathematical Sciences 7 (2013): 2373–80. http://dx.doi.org/10.12988/ams.2013.13214.
Повний текст джерелаGorbenko, Anna. "The shortest common ordered supersequence problem." Applied Mathematical Sciences 7 (2013): 4813–19. http://dx.doi.org/10.12988/ams.2013.36321.
Повний текст джерелаDondi, Riccardo. "The constrained shortest common supersequence problem." Journal of Discrete Algorithms 21 (July 2013): 11–17. http://dx.doi.org/10.1016/j.jda.2013.03.004.
Повний текст джерелаGevezes, Theodoros, and Leonidas Pitsoulis. "A greedy randomized adaptive search procedure with path relinking for the shortest superstring problem." Journal of Combinatorial Optimization 29, no. 4 (May 17, 2013): 859–83. http://dx.doi.org/10.1007/s10878-013-9622-z.
Повний текст джерелаGorbenko, Anna, and Vladimir Popov. "On the shortest common parameterized supersequence problem." Applied Mathematical Sciences 7 (2013): 4821–28. http://dx.doi.org/10.12988/ams.2013.36322.
Повний текст джерелаMiddendorf, M. "The shortest common nonsubsequence problem is NP-complete." Theoretical Computer Science 108, no. 2 (February 1993): 365–69. http://dx.doi.org/10.1016/0304-3975(93)90200-d.
Повний текст джерелаKhaled Saifullah, C. M., and Md Rafiqul Islam. "Chemical reaction optimization for solving shortest common supersequence problem." Computational Biology and Chemistry 64 (October 2016): 82–93. http://dx.doi.org/10.1016/j.compbiolchem.2016.05.004.
Повний текст джерелаRahmann, S. "The shortest common supersequence problem in a microarray production setting." Bioinformatics 19, Suppl 2 (September 27, 2003): ii156—ii161. http://dx.doi.org/10.1093/bioinformatics/btg1073.
Повний текст джерелаMousavi, Sayyed Rasoul, Fateme Bahri, and Farzaneh Sadat Tabataba. "An enhanced beam search algorithm for the Shortest Common Supersequence Problem." Engineering Applications of Artificial Intelligence 25, no. 3 (April 2012): 457–67. http://dx.doi.org/10.1016/j.engappai.2011.08.006.
Повний текст джерелаKowalski, Tomasz M., and Szymon Grabowski. "PgRC: pseudogenome-based read compressor." Bioinformatics 36, no. 7 (December 9, 2019): 2082–89. http://dx.doi.org/10.1093/bioinformatics/btz919.
Повний текст джерелаAlghamdi, Fahad A., Ahmed Younes Hamed, Abdullah M. Alghamdi, Abderrazak Ben Salah, Tamer Hashem Farag, and Walaa Hassan. "A genetic algorithm for shortest path with real constraints in computer networks." International Journal of Electrical and Computer Engineering (IJECE) 13, no. 1 (February 1, 2023): 435. http://dx.doi.org/10.11591/ijece.v13i1.pp435-442.
Повний текст джерелаZhou, Yu, Wenfeng Zheng, and Zhixi Shen. "A New Algorithm for Distributed Control Problem with Shortest-Distance Constraints." Mathematical Problems in Engineering 2016 (2016): 1–6. http://dx.doi.org/10.1155/2016/1604824.
Повний текст джерелаGallardo, José E. "A Multilevel Probabilistic Beam Search Algorithm for the Shortest Common Supersequence Problem." PLoS ONE 7, no. 12 (December 27, 2012): e52427. http://dx.doi.org/10.1371/journal.pone.0052427.
Повний текст джерелаBarros, Vanessa, Lingmin Liao, and Jérôme Rousseau. "On the shortest distance between orbits and the longest common substring problem." Advances in Mathematics 344 (February 2019): 311–39. http://dx.doi.org/10.1016/j.aim.2019.01.001.
Повний текст джерелаYang, Lifeng, Liangming Chen, Ningwei Wang, and Zhifang Liao. "Routing Optimization Algorithms Based on Node Compression in Big Data Environment." Scientific Programming 2017 (2017): 1–7. http://dx.doi.org/10.1155/2017/2056501.
Повний текст джерелаLuo, Fei, Cheng Chen, Joel Fuentes, Yong Li, and Weichao Ding. "An Opposition-Based Learning CRO Algorithm for Solving the Shortest Common Supersequence Problem." Entropy 24, no. 5 (May 3, 2022): 641. http://dx.doi.org/10.3390/e24050641.
Повний текст джерелаZiraksima, Mahsa, Shahriar Lotfi, and Habib Izadkhah. "Using an evolutionary approach based on shortest common supersequence problem for loop fusion." Soft Computing 24, no. 10 (September 21, 2019): 7231–52. http://dx.doi.org/10.1007/s00500-019-04338-z.
Повний текст джерелаLuo, Fei, Cheng Chen, and Joel Fuentes. "An improved chemical reaction optimization algorithm for solving the shortest common supersequence problem." Computational Biology and Chemistry 88 (October 2020): 107327. http://dx.doi.org/10.1016/j.compbiolchem.2020.107327.
Повний текст джерелаMelaouene, Noussaiba, and Rahal Romadi. "An enhanced routing algorithm using ant colony optimization and VANET infrastructure." MATEC Web of Conferences 259 (2019): 02009. http://dx.doi.org/10.1051/matecconf/201925902009.
Повний текст джерелаKöppl, Dominik. "Inferring Spatial Distance Rankings with Partial Knowledge on Routing Networks." Information 13, no. 4 (March 25, 2022): 168. http://dx.doi.org/10.3390/info13040168.
Повний текст джерелаAhmadi, Saman, Guido Tack, Daniel Harabor, and Philip Kilby. "Weight Constrained Path Finding with Bidirectional A*." Proceedings of the International Symposium on Combinatorial Search 15, no. 1 (July 17, 2022): 2–10. http://dx.doi.org/10.1609/socs.v15i1.21746.
Повний текст джерелаVahidipour, S. Mehdi, Mohammad Reza Meybodi, and Mehdi Esnaashari. "Finding the Shortest Path in Stochastic Graphs Using Learning Automata and Adaptive Stochastic Petri Nets." International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems 25, no. 03 (May 22, 2017): 427–55. http://dx.doi.org/10.1142/s0218488517500180.
Повний текст джерелаSmirnov, Alexander Valeryevich. "The Polynomial Algorithm of Finding the Shortest Path in a Divisible Multiple Graph." Modeling and Analysis of Information Systems 29, no. 4 (December 18, 2022): 372–87. http://dx.doi.org/10.18255/1818-1015-2022-4-372-387.
Повний текст джерелаGrabusts, Peter, and Jurijs Musatovs. "THE SEARCH FOR THE SHORTEST ROUTE FOR TOURISTS VISITING SIGHTSEEING OBJECTS OF THE RAZNA NATIONAL PARK." Latgale National Economy Research 1, no. 10 (September 18, 2018): 45. http://dx.doi.org/10.17770/lner2018vol1.10.3457.
Повний текст джерелаBukáček, Michal. "People vs Differential Evolution in Search of The Shortest Path." Journal of Advanced Engineering and Computation 4, no. 3 (September 30, 2020): 207. http://dx.doi.org/10.25073/jaec.202043.292.
Повний текст джерелаAlani, Sameer, Atheer Baseel, Mustafa Maad Hamdi, and Sami Abduljabbar Rashid. "A hybrid technique for single-source shortest path-based on A* algorithm and ant colony optimization." IAES International Journal of Artificial Intelligence (IJ-AI) 9, no. 2 (June 1, 2020): 356. http://dx.doi.org/10.11591/ijai.v9.i2.pp356-363.
Повний текст джерелаPlonski, Patrick A., and Volkan Isler. "Approximation algorithms for tours of height-varying view cones." International Journal of Robotics Research 38, no. 2-3 (July 31, 2018): 224–35. http://dx.doi.org/10.1177/0278364918784353.
Повний текст джерелаDing, Mei-Shuang, Ning-De Jin, and Zhong-Ke Gao. "Modality transition-based network from multivariate time series for characterizing horizontal oil–water flow patterns." International Journal of Modern Physics C 26, no. 03 (February 25, 2015): 1550034. http://dx.doi.org/10.1142/s0129183115500345.
Повний текст джерела