메뉴 건너뛰기




Volumn 4972 LNCS, Issue , 2008, Pages 266-276

Reactive stochastic local search algorithms for the genomic median problem

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BOOLEAN FUNCTIONS; COMBINATORIAL MATHEMATICS; COMBINATORIAL OPTIMIZATION; HEURISTIC ALGORITHMS; HEURISTIC METHODS; HEURISTIC PROGRAMMING; LEARNING ALGORITHMS; NUCLEAR PROPULSION; OPTIMIZATION; SOLUTIONS; STOCHASTIC PROGRAMMING; TELECOMMUNICATION NETWORKS;

EID: 47249129518     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-78604-7_23     Document Type: Conference Paper
Times cited : (16)

References (20)
  • 1
    • 19544394896 scopus 로고    scopus 로고
    • Reconstructing phylogenies from gene content and gene-order data
    • Gascuel, O, ed, Oxford Univ. Press, Oxford
    • Moret, B., Tang, J., Warnow, T.: Reconstructing phylogenies from gene content and gene-order data. In: Gascuel, O. (ed.) Mathematics of Evolution and Phylogeny, pp. 321-352. Oxford Univ. Press, Oxford
    • Mathematics of Evolution and Phylogeny , pp. 321-352
    • Moret, B.1    Tang, J.2    Warnow, T.3
  • 2
    • 33846673442 scopus 로고    scopus 로고
    • Using median sets for inferring phylogenetic trees
    • Bernt, M., Merkle, D., Middendorf, M.: Using median sets for inferring phylogenetic trees. Bioinformatics 23, e129-e135 (2007)
    • (2007) Bioinformatics , vol.23
    • Bernt, M.1    Merkle, D.2    Middendorf, M.3
  • 3
    • 0002856077 scopus 로고    scopus 로고
    • Transforming cabbage into turnip: Polynomial algorithm for sorting signed permutations by reversals
    • Hannenhalli, S., Pevzner, P.A.: Transforming cabbage into turnip: Polynomial algorithm for sorting signed permutations by reversals. Journal of the ACM 46(1), 1-27 (1999)
    • (1999) Journal of the ACM , vol.46 , Issue.1 , pp. 1-27
    • Hannenhalli, S.1    Pevzner, P.A.2
  • 4
    • 24044535485 scopus 로고    scopus 로고
    • Efficient sorting of genomic permutations by translocation, inversion and block interchange
    • Yancopoulos, S., Attie, O., Friedberg, R.: Efficient sorting of genomic permutations by translocation, inversion and block interchange. bioinformatics 21(16), 3340-3346 (2005)
    • (2005) bioinformatics , vol.21 , Issue.16 , pp. 3340-3346
    • Yancopoulos, S.1    Attie, O.2    Friedberg, R.3
  • 7
    • 38349003267 scopus 로고    scopus 로고
    • Arndt, W., Tang, J.: Improving inversion median computation using commuting reversals and cycle information. In: Tesler, G., Durand, D. (eds.) RECMOB-CG 2007. LNCS (LNBI), 4751, pp. 30-44. Springer, Heidelberg (2007)
    • Arndt, W., Tang, J.: Improving inversion median computation using commuting reversals and cycle information. In: Tesler, G., Durand, D. (eds.) RECMOB-CG 2007. LNCS (LNBI), vol. 4751, pp. 30-44. Springer, Heidelberg (2007)
  • 8
    • 0036143403 scopus 로고    scopus 로고
    • Genome-scale evolution: Reconstructing gene orders in the ancestral species
    • Bourque, G., Pevzner, P.: Genome-scale evolution: Reconstructing gene orders in the ancestral species. Genome Res. 12(1), 26-36 (2002)
    • (2002) Genome Res , vol.12 , Issue.1 , pp. 26-36
    • Bourque, G.1    Pevzner, P.2
  • 10
    • 0004215426 scopus 로고    scopus 로고
    • Kluwer Academic Publishers, Norwell, MA, USA
    • Glover, F., Laguna, F.: Tabu Search. Kluwer Academic Publishers, Norwell, MA, USA (1997)
    • (1997) Tabu Search
    • Glover, F.1    Laguna, F.2
  • 12
    • 33750264868 scopus 로고    scopus 로고
    • Bergeron, A., Mixtacki, J., Stoye, J.: A unifying view of genome rearrangements. In: Bücher, P., Moret, B.M.E. (eds.) WABI 2006. LNCS (LNBI), 4175, pp. 163-173. Springer, Heidelberg (2006)
    • Bergeron, A., Mixtacki, J., Stoye, J.: A unifying view of genome rearrangements. In: Bücher, P., Moret, B.M.E. (eds.) WABI 2006. LNCS (LNBI), vol. 4175, pp. 163-173. Springer, Heidelberg (2006)
  • 15
    • 35048835884 scopus 로고    scopus 로고
    • van Hemert, J., Bäck, T.: Measuring the searched space to guide efficiency: The principle and evidence on constraint satisfaction. In: Guervós, J.J.M., Adamidis, P.A., Beyer, H.-G., Fernández- Villacañas, J.-L., Schwefel, H.-P. (eds.) PPSN 2002. LNCS, 2439, pp. 23-32. Springer, Heidelberg (2002)
    • van Hemert, J., Bäck, T.: Measuring the searched space to guide efficiency: The principle and evidence on constraint satisfaction. In: Guervós, J.J.M., Adamidis, P.A., Beyer, H.-G., Fernández- Villacañas, J.-L., Schwefel, H.-P. (eds.) PPSN 2002. LNCS, vol. 2439, pp. 23-32. Springer, Heidelberg (2002)
  • 16
    • 47249141793 scopus 로고    scopus 로고
    • Birattari, M, race: Racing methods for the selection of the best. R package version 0.1.56 2005
    • Birattari, M.: race: Racing methods for the selection of the best. R package version 0.1.56 (2005)
  • 18
    • 0141668007 scopus 로고    scopus 로고
    • Reactive local search for the maximum clique problem
    • Battiti, R., Protasi, M.: Reactive local search for the maximum clique problem. Algorithmica 29(4), 610-637 (2001)
    • (2001) Algorithmica , vol.29 , Issue.4 , pp. 610-637
    • Battiti, R.1    Protasi, M.2
  • 19
    • 33947374693 scopus 로고    scopus 로고
    • Reversal and transposition medians
    • Eriksen, N.: Reversal and transposition medians. Theoretical Computer Science 374(1-3) (2007)
    • (2007) Theoretical Computer Science , vol.374 , Issue.1-3
    • Eriksen, N.1
  • 20
    • 47249107808 scopus 로고    scopus 로고
    • Effective Stochastic Local Search Algorithms for the Genomic Median Problem
    • Doctoral Symposium on Engineering Stochastic Local Search Algorithms SLS-DS
    • Lenne, R., Solnon, C., Sttzle, T., Tannier, E., Birattari, M.: Effective Stochastic Local Search Algorithms for the Genomic Median Problem. In: Doctoral Symposium on Engineering Stochastic Local Search Algorithms (SLS-DS). IRIDIA Technical Report Series, pp. 1-5 (2007)
    • (2007) IRIDIA Technical Report Series , pp. 1-5
    • Lenne, R.1    Solnon, C.2    Sttzle, T.3    Tannier, E.4    Birattari, M.5


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.