String Selection Problems
作者： Elisa Pappalardo , Panos M. Pardalos , Giovanni Stracquadanio
DOI: 10.1007/978-1-4614-9053-1_4
关键词:
摘要: The increasing amount of genomic data and the ability to synthesize artificial DNA constructs poses a series challenging problems involving identification design sequences with specific properties. We address such sequences; many these present challenges both at biological computational level. In this chapter, we introduce main string selection theoretical experimental results for most important instances.
springer.com
sci-hub.st 参考文章(86)
Michael R. Fellows, Jens Gramm, Rolf Niedermeier, On the Parameterized Intractability of CLOSEST SUBSTRINGsize and Related Problems symposium on theoretical aspects of computer science. pp. 262- 273 ,(2002) , 10.1007/3-540-45841-7_21
Holger Mauch, Closest Substring Problem – Results from an Evolutionary Algorithm Neural Information Processing. pp. 205- 211 ,(2004) , 10.1007/978-3-540-30499-9_30
A. Vazacopoulos, P. M. Pardalos, M. G. C. Resende, MODELING AND SOLVING STRING SELECTION PROBLEMS ,(2005)
Xiaoyi Jiang, Horst Bunke, Janos Csirik, MEDIAN STRINGS: A REVIEW WORLD SCIENTIFIC. pp. 173- 192 ,(2004) , 10.1142/9789812565402_0008
Faranak Bahredar, Hossein Erfani, H Haj Seyed Javadi, Nafiseh Masaeli, None, A Meta Heuristic Solution for Closest String Problem Using Ant Colony System distributed computing and artificial intelligence. pp. 549- 557 ,(2010) , 10.1007/978-3-642-14883-5_70
A. Juan, E. Vidal, Fast Median Search in Metric Spaces Lecture Notes in Computer Science. pp. 905- 912 ,(1998) , 10.1007/BFB0033318
Bin Ma, A Polynomial Time Approximation Scheme for the Closest Substring Problem combinatorial pattern matching. pp. 99- 107 ,(2000) , 10.1007/3-540-45123-4_10
Amihood Amir, Haim Paryenty, Liam Roditty, Configurations and minority in the string consensus problem string processing and information retrieval. pp. 42- 53 ,(2012) , 10.1007/978-3-642-34109-0_6
Markus Chimani, Sebastian Böcker, Matthias Woste, A closer look at the closest string and closest substring problem algorithm engineering and experimentation. pp. 13- 24 ,(2011)
Dan Gusfield, Algorithms on Strings, Trees, and Sequences: Suffix Trees and Their Uses ,(1997) , 10.1017/CBO9780511574931