摘要
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.
出版日期
2005年04月14日(中国Betway体育网页登陆平台首次上网日期,不代表论文的发表时间)