Finding　out　the　longest　common　subsequences　(LCS)　is　one　of　the　most　important　problems　of　Bioengineering.　But　there　is　still　not　excellent　algorithm　for　computing　all　of　the　longest　common　subsequences　(ALCS).　An　existing　fast　algorithm　for　LCS　was　studied　and　improved　in　this　paper.　We　combined　the　algorithm　with　MPI　cluster　and　computed　all　the　longest　common　subsequences　of　two　random　generate　gene　sequences　on　MPI　cluster.　The　experiment　results　show　that　computing　ALCS　on　MPI　cluster　is　an　efficient　and　practicality　method.　©2010　IEEE.