Bibliography

  1. [ACH 09] ACHTERBERG T., “SCIP: solving constraint integer programs”, Mathematical Programming Computation, vol. 1, no. 1, pp. 1–41, 2009.
  2. [ADA 00] ADAMS M.D., CELNIKER S.E., HOLT R.A. et al., “The genome sequence of Drosophila melanogaster”, Science, vol. 287, no. 5461, pp. 2185–2195, 2000.
  3. [ADI 08] ADI S.S., BRAGA M.D.V., FERNANDES C.G. et al., “Repetition-free longest common subsequence”, Electronic Notes in Discrete Mathematics, vol. 30, pp. 243–248, 2008.
  4. [ADI 10] ADI S.S., BRAGA M.D.V., FERNANDES C.G. et al., “Repetition-free longest common subsquence”, Discrete Applied Mathematics, vol. 158, pp. 1315–1324, 2010.
  5. [AHO 83] AHO A., HOPCROFT J., ULLMAN J., Data Structures and Algorithms, Addison-Wesley, Reading, MA, 1983.
  6. [AIE 02] AIEX R.M., RESENDE M.G.C., RIBEIRO C.C., “Probability distribution of solution time in grasp: an experimental investigation”, Journal of Heuristics, vol. 8, pp. 343–373, 2002.
  7. [AKE 09] AKEB H., HIFI M., MHALLAH R., “A beam search algorithm for the circular packing problem”, Computers & Operations Research, vol. 36, no. 5, pp. 1513–1528, 2009.
  8. [BÄC 97] BÄCK T., FOGEL D.B., MICHALEWICZ Z., Handbook of Evolutionary Computation, Oxford University Press, 1997.
  9. [BAI 88] BAINS W., SMITH G.C., “A novel method for nucleid acid sequence determination”, Journal of Theoretical Biology, vol. 135, pp. 303–307, 1988.
  10. [BEN 10] BENEDETTINI S., BLUM C., ROLI A., “A randomized iterated greedy algorithm for the founder sequence reconstruction problem”, ...

Get Metaheuristics for String Problems in Bio-informatics now with O’Reilly online learning.

O’Reilly members experience live online training, plus books, videos, and digital content from 200+ publishers.