YYC: A fast performance incremental algorithm for finding typical testors

Abstract

The last few years have seen an important increase in research publications dealing with external typical testor-finding algorithms, while internal ones have been almost forgotten or modified to behave as external on the basis of their alleged poor performance. In this research we present a new internal typical testor-finding algorithm called YYC that incrementally calculates typical testors for the currently analized set of basic matrix rows by searching for compatible sets. The experimentally measured performance of this algorithm stands out favorably in problems where other external algorithms show very low performance. Also, a comparative analysis of its efficiency is done against some external typical testor-finding algorithms published during the last few years.