Almost computably enumerable families of sets

An almost computably enumerable family that is not $\varnothing'$-computably enumerable is constructed. Moreover, it is established that for any computably enumerable (c.e.) set $A$ there exists a family that is $X$-c.e. if and only if the set $X$ is not $A$-computable.
Bibliography: 5 titles.