The systematic search for avoided words is particularly useful for biological sequence analysis. We present a linear-time and linear-space algorithm for the computation of avoided words of lengthkin a given sequencex. We suggest a modification to this algorithm so that it computes all avoided words ofx, irrespective of their length, within the same time complexity. We also present combinatorial results with regards to avoided words and absent words.