1. //
  2. Start
  3. //
  4. Publications
  5. Using an adaptive memory strategy to imp...
  6. Output formats
  7. //

Using an adaptive memory strategy to improve a multistart heuristic for sequencing by hybridization

Research output: Contributions to collected editions/works › Article in conference proceedings › Research › peer-review

Standard

Using an adaptive memory strategy to improve a multistart heuristic for sequencing by hybridization. / Fernandes, Eraldo R.; Ribeiro, Celso C.

Experimental and Efficient Algorithms: 4th International Workshop, WEA 2005, Santorini Island, Greece, May 10-13, 2005; Proceedings. ed. / Sotiris E. Nikoletseas. Berlin : Springer, 2005. p. 4-15 (Lecture Notes in Computer Science; Vol. 3503).

Research output: Contributions to collected editions/works › Article in conference proceedings › Research › peer-review

Harvard

Fernandes, ER & Ribeiro, CC 2005, Using an adaptive memory strategy to improve a multistart heuristic for sequencing by hybridization. in SE Nikoletseas (ed.), Experimental and Efficient Algorithms: 4th International Workshop, WEA 2005, Santorini Island, Greece, May 10-13, 2005; Proceedings. Lecture Notes in Computer Science, vol. 3503, Springer, Berlin, pp. 4-15, 4th International Workshop on Experimental and Efficient Algorithms, WEA 2005, Santorini Island, Greece, 10.05.05. https://doi.org/10.1007/11427186_2

APA

Fernandes, E. R., & Ribeiro, C. C. (2005). Using an adaptive memory strategy to improve a multistart heuristic for sequencing by hybridization. In S. E. Nikoletseas (Ed.), Experimental and Efficient Algorithms: 4th International Workshop, WEA 2005, Santorini Island, Greece, May 10-13, 2005; Proceedings (pp. 4-15). (Lecture Notes in Computer Science; Vol. 3503). Springer. https://doi.org/10.1007/11427186_2

Vancouver

Fernandes ER, Ribeiro CC. Using an adaptive memory strategy to improve a multistart heuristic for sequencing by hybridization. In Nikoletseas SE, editor, Experimental and Efficient Algorithms: 4th International Workshop, WEA 2005, Santorini Island, Greece, May 10-13, 2005; Proceedings. Berlin: Springer. 2005. p. 4-15. (Lecture Notes in Computer Science). doi: 10.1007/11427186_2

Bibtex

@inbook{340caa6548354c5190e827a59cd298f1,
title = "Using an adaptive memory strategy to improve a multistart heuristic for sequencing by hybridization",
abstract = "We describe a multistart heuristic using an adaptive memory strategy for the problem of sequencing by hybridization. The memory-based strategy is able to significantly improve the performance of memory less construction procedures, in terms of solution quality and processing time. Computational results show that the new heuristic obtains systematically better solutions than more involving and time consuming techniques such as tabu search and genetic algorithms.",
keywords = "Informatics, genetic algorithm, target sequence, Tabu search, test instance, average similarity, Business informatics",
author = "Fernandes, {Eraldo R.} and Ribeiro, {Celso C.}",
year = "2005",
month = jan,
day = "1",
doi = "10.1007/11427186_2",
language = "English",
isbn = "978-3-540-25920-6 ",
series = "Lecture Notes in Computer Science",
publisher = "Springer",
pages = "4--15",
editor = "Nikoletseas, {Sotiris E.}",
booktitle = "Experimental and Efficient Algorithms",
address = "Germany",
note = "4th International Workshop on Experimental and Efficient Algorithms, WEA 2005, WEA 2005 ; Conference date: 10-05-2005 Through 13-05-2005",

}

RIS

TY - CHAP

T1 - Using an adaptive memory strategy to improve a multistart heuristic for sequencing by hybridization

AU - Fernandes, Eraldo R.

AU - Ribeiro, Celso C.

N1 - Conference code: 4

PY - 2005/1/1

Y1 - 2005/1/1

N2 - We describe a multistart heuristic using an adaptive memory strategy for the problem of sequencing by hybridization. The memory-based strategy is able to significantly improve the performance of memory less construction procedures, in terms of solution quality and processing time. Computational results show that the new heuristic obtains systematically better solutions than more involving and time consuming techniques such as tabu search and genetic algorithms.

AB - We describe a multistart heuristic using an adaptive memory strategy for the problem of sequencing by hybridization. The memory-based strategy is able to significantly improve the performance of memory less construction procedures, in terms of solution quality and processing time. Computational results show that the new heuristic obtains systematically better solutions than more involving and time consuming techniques such as tabu search and genetic algorithms.

KW - Informatics

KW - genetic algorithm

KW - target sequence

KW - Tabu search

KW - test instance

KW - average similarity

KW - Business informatics

UR - http://www.scopus.com/inward/record.url?scp=24944590986&partnerID=8YFLogxK

UR - https://d-nb.info/974313114

U2 - 10.1007/11427186_2

DO - 10.1007/11427186_2

M3 - Article in conference proceedings

AN - SCOPUS:24944590986

SN - 978-3-540-25920-6

T3 - Lecture Notes in Computer Science

SP - 4

EP - 15

BT - Experimental and Efficient Algorithms

A2 - Nikoletseas, Sotiris E.

PB - Springer

CY - Berlin

T2 - 4th International Workshop on Experimental and Efficient Algorithms, WEA 2005

Y2 - 10 May 2005 through 13 May 2005

ER -

Other publications by the same author(s)

Data practices in apps from Brazil: What do privacy policies inform us about?

Quadros dos Reis, V., Rabello, M. E. R., Lima, A. C., Jardim, G. P. S., Fernandes, E. R. & Brefeld, U., 10.02.2023, In: Journal on Interactive Systems. 14, 1, p. 1-8 8 p.

Research output: Journal contributions › Journal articles › Research › peer-review

Entity Extraction from Portuguese Legal Documents Using Distant Supervision

Navarezi, L. M., Sakiyama, K., Rodrigues, L. S., Robaldo, C. M. O., Lobato, G. R., Vilela, P. A., Matsubara, E. T. & Fernandes, E. R., 2022, Computational Processing of the Portuguese Language : 15th International Conference, PROPOR 2022, Fortaleza, Brazil, March 21-23, 2022, Proceedings. Pinheiro, V., Gamallo, P., Amaro, R., Scarton, C., Batista, F., Silva, D., Magro, C. & Pinto, H. (eds.). Cham: Springer Nature Switzerland AG, p. 166-176 11 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 13208 LNAI).

Research output: Contributions to collected editions/works › Article in conference proceedings › Research › peer-review

FaST: A linear time stack trace alignment heuristic for crash report deduplication

Rodrigues, I. M., Aloise, D. & Fernandes, E. R., 23.05.2022, The 2022 Mining Software Repositories Conference: MSR 2022, Proceedings; 18-20 May 2022, Virtual; 23-24 May 2022, Pittsburgh, Pennsylvania. New York: Institute of Electrical and Electronics Engineers Inc., p. 549-560 12 p. (Proceedings - IEEE/ACM International Conference on Mining Software Repositories ).

Research output: Contributions to collected editions/works › Article in conference proceedings › Research › peer-review

Performance predictors for graphics processing units applied to dark-silicon-aware design space exploration

Sonohata, R., Arigoni, D. C. A., Fernandes, E. R., Ribeiro dos Santos, R. & Dessandre Duenha, L., 01.08.2023, In: Concurrency and Computation: Practice and Experience. 35, 17, 16 p., e6877.

Research output: Journal contributions › Journal articles › Research › peer-review

TraceSim: An Alignment Method for Computing Stack Trace Similarity

Rodrigues, I. M., Khvorov, A., Aloise, D., Vasiliev, R., Koznov, D., Fernandes, E. R., Chernishev, G., Luciv, D. & Povarov, N., 01.03.2022, In: Empirical Software Engineering. 27, 2, 41 p., 53.

Research output: Journal contributions › Journal articles › Research › peer-review

DOI