简介:
简介:VanAndelResearchInstitute(VARI)investigatorsworkingincollaborationwithClevelandClinicresearchershavedeterminedthattwotypesofkidneytumorspreviouslythoughttobedifferentdiseasesareactuallyvariationsofthesamedisease.Thisfindingwillhelpdoctorstomoreaccuratelydiagnosethediseaseinpatients,anddemonstratestheimpor-tanceofusingmoleculardatatodiagnosecanceringeneral.
简介:Inthispaper,alowcomplexityESPRITalgorithmbasedonpowermethodandOrthogo-nal-triangular(QR)decompositionispresentedfordirectionfinding,whichdoesnotrequireaprioriknowledgeofsourcenumberandthepredeterminedthreshold(separatesthesignalandnoiseei-gen-values).Firstly,accordingtotheestimationofnoisesubspaceobtainedbythepowermethod,anovelsourcenumberdetectionmethodwithouteigen-decompositionisproposedbasedonQRde-composition.Furthermore,theeigenvectorsofsignalsubspacecanbedeterminedaccordingtoQmatrixandthenthedirectionsofsignalscouldbecomputedbytheESPRITalgorithm.Todeterminethesourcenumberandsubspace,thecomputationcomplexityoftheproposedalgorithmisapproximatedas(2log_2n+2.67)M~3,wherenisthepowerofcovariancematrixandMisthenumberofarrayele-ments.ComparedwiththeSingleVectorDecomposition(SVD)basedalgorithm,ithasasubstantialcomputationalsavingwiththeapproximationperformance.Thesimulationresultsdemonstrateitseffectivenessandrobustness.
简介:象在1975一样早,Shamos和Hoey首先给了O(nlgn)-timedivide-and-conquer算法(嘘算法在短)为发现点的最靠近的对的问题。在联合的一个过程,在一些点需要被计算的3n之间的欧几里得距离,计算距离的全面复杂性当时因此是3nlgn。因为距离的计算与另外的基本操作相比是更昂贵的,怎么嘘改善从计算距离的复杂性的方面的算法被考虑。在1998,周,熊和朱由把这复杂性归结为2nlgn改进了SHalgorithm。在这篇论文,我们做进一步的改进。计算距离的Theoverall复杂性被归结为(3nlgn)/2,它仅仅是一半SHalgorithm的。
简介:TheanalysisofrepeatsintheDNAsequencesisanimportantsubjectinbioinformatics.Inthispaper,weproposeanovelprojection-assemblealgorithmtofindunknowninterspersedrepeatsinDNAsequences.Thealgorithmemploysrandomprojectionalgorithmtoobtainacandidatefragmentset,andexhaustivesearchalgorithmtosearcheachpairoffragmentsfromthecandidatefragmentsettofindpotentiallinkage,andthenassemblethemtogether.Thecomplexityofourprojection-assemblealgorithmisnearlylineartothelengthofthegenomesequence,anditsmemoryusageislimitedbythehardware.Wetestedouralgorithmwithbothsimulateddataandrealbiologydata,andtheresultsshowthatourprojection-assemblealgorithmisefficient.Bymeansofthisalgorithm,wefoundanun-labeledrepeatregionthatoccursfivetimesinEscherichiacoligenome,withitslengthmorethan5,000bp,andamismatchprobabilitylessthan4%.
简介:Findingthecommonsubstructuressharedbytwoproteinsisconsideredasoneofthecentralissuesincomputationalbiologybecauseofitsusefulnessinunderstandingthestructure-functionrelationshipandapplicationindrugandvaccinedesign.Inthispaper,weproposeanovelalgorithmcalledFAMCS(FindingAllMaximalCommonSubstructures)forthecommonsubstructureidentificationproblem.Ourmethodworksinitiallyattheproteinsecondarystructuralelement(SSE)levelandstartswiththeidentificationofallstructurallysimilarSSEpairs.TheseSSEpairsarethenmergedintosetsusingamodifiedApriorialgorithm,whichwilltestthesimilarityofvarioussetsofSSEpairsincrementallyuntilallthemaximalsetsofSSEpairsthatdeemedtobesimilararefound.Themaximalcommonsubstructuresofthetwoproteinswillbeformedfromthesemaximalsets.ArefinementalgorithmisalsoproposedtofinetunethealignmentfromtheSSEleveltotheresiduelevel.ComparisonofFAMCSwithothermethodsonvariousproteinsshowsthatFAMCScanaddressallfourrequirementsandinferinterestingbiologicaldiscoveries.
简介:Earlyrepolarizationisawell-described,commonelectrocardiographicvariant.Itwasinitiallyfelttobebenign,butinthelasttwentyyearsasuggestedalinkbetweenspecifictypesofearlyrepolarizationandsuddencardiacdeathhasemerged.ThisassociationwashasbeentermedtheJwavesyndromeandincludesboththehighriskearlyrepolarizationandBrugadaECGpatterns.Theoddsofearlyrepolarizationchangebeingassociatedwithpooroutcomesarestillexceedinglysmall.Nevertheless,theassociationofafairlyubiquitousECGfindingwithfatalornearfatalclinicaloutcomeshasraisedconcern.Howcanweidentifythetrulyhigh-riskpatients?IfapatienthasasignificantclinicaleventwithaconcerningECGrepolarizationpattern,whatshouldbedonenext?TheauthorsofthisreviewpresentcurrentinformationregardingtheEarlyRepolarizationandBrugadaSyndromesandhowtoproceedwithdiagnosis,management,andriskstratificationwhenearlyrepolarizationchangeisobservedonECG.
简介:ThisisastudyoftheDurand-KernerandNoureinmethodsforfindingtherootsofagivenalgebraicequationsimultaneously.Weconsidertheconditionsunderwhichtheiterativemethodsfail.Thenumericalexampleispresented.
简介:Inthispaper,algorithmsforfindingtheinverseofafactorblockcirculantmatrix,afactorblockretrocirculantmatrixandpartitionedmatrixwithfactorblockcirculantblocksoverthecomplexfieldarepresentedrespectively.Inaddition,twoalgorithmsfortheinverseofafactorblockcirculantmatrixoverthequaterniondivisionalgebraareproposed.
简介:China’scentralgovernmenthasfocusedonbuildinggoodqualitythinktanksoverthepastfewyears,creatingmanyopportunitiesforacademics.Wehaveseennewthinktanksbeingestablishedandoldonesplanningtheirtransformation,promisingbrighterprospects.However,weshouldbeawareofthepossibilityof'changeinappearancebutnotin