Identifying G-protein Coupled Receptors Using Weighted Levenshtein Distance and Nearest Neighbor Method

(整期优先)网络出版时间:2005-04-14
/ 1
G-proteincoupledreceptors(GPCRs)areaclassofseven-helixtransmembraneproteinsthathavebeenusedinbioinformaticsasthetargetstofacilitatedrugdiscoveryforhumandiseases.AlthoughthousandsofGPCRsequenceshavebeencollected,theligandspecificityofmanyGPCRsisstillunknownandonlyonecrystalstructureoftherhodopsin-likefamilyhasbeensolved.Therefore,identifyingGPCRtypesonlyfromsequencedatahasbecomeanimportantresearchissue.Inthisstudy,anoveltechniqueforidentifyingGPCRtypesbasedontheweightedLevenshteindistancebetweentworeceptorsequencesandthenearestneighbormethod(NNM)isintroduced,whichcandealwithreceptorsequenceswithdifferentlengthsdirectly.Inourexperimentsforclassifyingfourclasses(acetylcholine,adrenoceptor,dopamine,andserotonin)oftherhodopsin-likefamilyofGPCRs,theerrorratesfromtheleave-one-outprocedureandtheleave-half-outprocedurewere0.62%and1.24%,respectively.Theseresultsarepriortothoseofthecovariantdiscriminantalgorithm,thesupportvectormachinemethod,andtheNNMwithEuclideandistance.