Generating nearly sorted sequences: the use of measures of disorder
Mostra el registre complet Registre parcial de l'ítem
- dc.contributor.author Estivill-Castro, V. (Vladimir)
- dc.date.accessioned 2021-03-25T11:50:08Z
- dc.date.available 2021-03-25T11:50:08Z
- dc.date.issued 2004
- dc.description.abstract There have been several formal proposals for a function that evaluates disorder in a sequence. We show here that definitions that allow equivalence to an operational formulation allow for the construction of an algorithm for pseudo-random generation of nearly sorted sequences. As there is interest in comparing performance of algorithms on nearly sorted sequences during experimental evaluations of their implementation, our methods here provide the pathway for establishing the benchmarks datasets to compare such algorithms.
- dc.format.mimetype application/pdf
- dc.identifier.citation Estivill-Castro V. Generating nearly sorted sequences: the use of measures of disorder. Electron Notes Theor Comput Sci. 2004 Feb 16;91:56-95. DOI: 10.1016/j.entcs.2003.12.006
- dc.identifier.doi http://dx.doi.org/10.1016/j.entcs.2003.12.006
- dc.identifier.issn 1571-0661
- dc.identifier.uri http://hdl.handle.net/10230/46937
- dc.language.iso eng
- dc.publisher Elsevier
- dc.relation.ispartof Electronic Notes in Theoretical Computer Science. 2004 Feb 16;91:56-95
- dc.rights © 2004 Elsevier B.V. Open access under CC BY-NC-ND license https://creativecommons.org/licenses/by-nc-nd/3.0/.
- dc.rights.accessRights info:eu-repo/semantics/openAccess
- dc.rights.uri https://creativecommons.org/licenses/by-nc-nd/3.0/
- dc.subject.keyword Sorting Algorithms
- dc.subject.keyword Statistical Correlation of Rankings
- dc.subject.keyword Graph Isomorphism
- dc.subject.keyword Measures of Disorder
- dc.subject.keyword Generation of pseudo-random permutations
- dc.title Generating nearly sorted sequences: the use of measures of disorder
- dc.type info:eu-repo/semantics/article
- dc.type.version info:eu-repo/semantics/publishedVersion