In this paper, we introduce an alternative DC algorithm for solving partial DC programs. This proposed algorithm is an natural extension of the standard DC algorithm. Furthermore, we also consider an inexact version of this alternative DC algorithm. The convergence of these proposed algorithms (both the exact and inexact versions) are investigated. The applications to nonconvex feasibility problems and to matrix factorization problems are reported.