Computing HOMFLY polynomials of 2-bridge links from 4-plat representation

We propose an algorithm for computing HOMFLY polynomials of 2-bridge links from 4-plat representation in O(n3) time, where n is the number of the crossings of a given input diagram.