Size: px
Start display at page:

Download ""

Transcription

1 VericationoftheSyllableBasedText AGeneticAlgorithmApproachfor GokturkUcoluk CompressionTechnique DepartmentofComputerEngineering _I.HakkToroslu MiddleEastTechnicalUniversity composeatextintostringsthathavelengthsgreaterthanoneandoccur Providedthataneasymechanismexistsforit,itispossibletode- Abstract frequently.havinginonehandthesetoffrequentlyoccurringsuchstrings thetextusinghumancodingoveranalphabetwhichisasubsetofthe unionofthesetwosets.observationsrevealthatinmostcasesthemaximalinclusionofthestringsleadstoanoptimallengthofcompressedtext. andintheotherthesetoflettersandsymbolsitispossibletocompress Howeverthevericationofthispredictionrequirestheconsiderationofall subsetsinordertondtheonethatleadstothebestcompression.ageneticalgorithm(ga)isdevisedandusedforthissearchprocess.turkish regularsyllableformation,areusedasatestbad. texts,whereduetoitsaglunitativenature,thelanguageprovidesahighly 1

2 11.1Introduction Thoughthecostofcomputerstoragedeviceshasdroppeddramaticallyandfar TextCompressionandHumanCoding morestorageisavailabletotheuseritcanstillbearguedthattheneedfordata compressionispreservingitssignicancesincetheinformationnowadaysbeing storedonelectronicmediaisalsoexponentiallygrowing.datacompressionis usedinpracticefortwopurposes,namelydatastorageanddatatransmission.by makinguseofvariouscompressiontechniquestypicallystoragesavingsof20%to 50%fortextlesmightbeachieved.Duetolargehomogeneouspatternsthese Run-lengthencodingissimpleandisbasedonstoringthenumbersofsuccessively useindatacompression:run-lengthencodingandvariable-lengthencoding[4]. guresescalateto50%to%90forbinaryles[9].twomaintechniquesaremade repeatingpatterns.thereforeitisnotverysuitablefortextcompressionsince theonlyrepeatingcharacterthatislikelytobefoundinatextistheblank character.variable-lengthencodingismakinguseofthefrequencyinformationof thepatterns.afterastatisticalanalysisofthedata,frequentlyoccuringpatterns areassignedshortercodesthantheonesthatoccurlessfrequently.d.human discoveredageneralmethodforndingtheoptimalcodingofthedatausingthe patternsisconstructed(suchatreeiscalleda`trie').thewaytoreachaleafis frequenciesofthepatterns[9].inthiswayabinarytreewhichhasatitsleafsthe tostartfromtherootandbranchleftorrightoneachnodeonthepath.this sequenceofbranchinginformation(letssaya1foraleftanda0foraright)is placedclosertotherootaretheonesthatfrequentlyoccurinthedata.hence reachingthemrequireslesserbranchingswhichresultsinshortercodesforthem. theencodingofthatspecicleaf.inahumantriepatternsattheleafsthatare Hereisanexample: Assumeweareencodingthetext ababababababababccbbbbbbddaaaaaacdcdcdacac 2

3 Theletterfrequenciesareasfollows: LetterFrequency bca 15 d 13 7 letterwouldrequire2bits(lg4=2)1(uncompresseddenotationisdierentthan Sinceouralphabeta,b,c,dhasfourelementsforuncompresseddenotationeach 5 theasciirepresentationwhichrequires8bits/char.commitingtotheascii 240=80bitswouldberequired.TheHumantreeisconstructedas representationimplicitelymeansthatthereare256distinctcharacters.insection 5thisisexplainedinmoredetails).Thetextcontained40characters.So,intotal, 1 0 Sothecoding(atbits)levelisasfollows: a LetterCodeCodelength b a 1 c d (1bit) 7 5 bc (2bits) Fortheabovegiventextthesumofrequiredbitscanbecalculatedasfollows: d 000 (3bits) Soacompressionratioof77=80=0:9625isobtained. 151 {z} a +132 {z} b+73 {z} c+53 {z} d =77(bits) 1lgrepresentslog2 3

4 1.2 Makinguseoftherepeatingpatternsinthetext:Extendingthealphabet Againconsidertheabovegiventextexample,butthistimeweindicatetherepeatingpatternsforsakeofeasyrecognition(superscriptstandsforrepetition, parenthesisforgrouping): Withoutmakinguseofanyadditionalorderinginformationinthetextotherthan (ab)7c2b6d2a6(cd)3(ac)2 canexpresstheabovetext.theseare thegroupedsymbolstherearevariouspossiblealphabetsintermsofwhichwe fa;b;c;dg fa;b;c;d;acg fa;b;c;d;ab;acgfa;b;c;d;ab;cdg fa;b;c;d;abg fa;b;c;d;ac;cdgfa;b;c;d;ab;ac;cdg fa;b;c;d;cdg ConstructingthecorrespondingHumantreesoneobtains Alphabet fa;b;c;dg fa;b;c;d;abg Uncompr.Len.Compr.Len.Compr.Ratio fa;b;c;d;acg fa;b;c;d;cdg fa;b;c;d;ab;acg fa;b;c;d;ab;cdg fa;b;c;d;ac;cdg fa;b;c;d;ab;ac;cdg basedhumancoding.furthermorethereisnotheoreticaleasymechanismwhich Thissmallexampleprovesthatitispossibletoperformbetterthanonlyletter letterremainsalmostconstantandatmostlooses1-2%.butnogeneralrulehas pinpointsthealphabetthatwillleadtothebestcompression.experiencewith lengthytextsshowsthatthesubsetofthealphabetsetwhichconstitutesofsingle 4

5 beenidentiedforthestringswithlengthsgreaterthanone.thisresultsina searchprocessoverallmembersofthepowersetofthesetofsuchstrings(with lengthsgreaterthanone).evenwithveryregularlanguagesthathaverelatively smallnumberofsyllablesthatrepeat,theorderofthesetsizeisofmagnitude 103.Aswellknown,theenumerationofallthemembersofapowersetofaset withnmembersisano(2n)process.hence,aproductivesearchmethodis neededtoapproachtheoptimal. requireamechanismforevaluationofthesuccessofcandidatesolutionswhich isinourcasethehumancompressionlengthsobtainedbyusingthecandidate AGeneticAlgorithms(GA)techniqueisemployedforthispurpose.GA duetoitscomplicateddatastructure.so,atheoreticalapproximationforthe isknowntobeofordero(nlgn)withaconsiderablylargeconstanttimefactor alphabets.butthisrequiresextensivehumantreeconstructionseachofwhich usingonlymathematicaloperationsontherepetitioncountsofthealphabet membersinthetext.thecomputationalcomplexityofthisapproximationis compressedtextlengthisusedwhichenablestoestimatethecompressedlength calculation. ofordero(n)wheretheconstantfactorcanconsiderablybereducedbypre- syllablesinahugesizedcorporaremainsoftheorderofafewthousands.itis ularsyllablestructure.duetothisregularityofthelanguagethecountofused TheproposedmethodistestedwithTurkishcorporawhichpossessesareg- hyphenationwhichproducesthesyllableboundariesofanyword.thefollowing moreturkishlanguageprovidesaverygrammaticalandsimplealgorithmfor observedthatabouttwohundredofthemoccurwithahighfrequency.further- owchartsummarizesthewholecompressionprocess. 5

6 Apply the hypenation algorithm to the text and obtain the constituent syllables and their frequencies. Construct a chromosome pool in which each gene position corresponds to one of the syllables (with length>1) and the allele values (1/0) have the meaning of keeping that syllable as a member of the Huffman alphabet or disolving that syllable into its letter constituents. Run the Genetic Engine to get the syllables which shall be included into the coding alphabet in order to, when used in the Huffman coding of the subject text, provides the best Huffman compression ratio. GAispresented.Section4brieysummarizesthesyllableformationofTurkish Perform a Huffman coding of the text over an alphabet that includes the syllables determined by the and all the individual characters required to code the text parts comming from the unincluded syllables andthealgorithmusedtoobtainthesyllables.in5,thelastsection,wepresent Thenextsectionexplainsthisapproximationtechniqueandinthesection3the punctuation characters. theresults/observationshenceobtainedandconclude. 2 TheoreticalApproximationfortheCompressed BasedonShannon'scontribution,itcanbeproven[4,8]inCodingTheorythat TextLength IftheentropyofagiventextisH,thenthegreatestlowerboundof thecompressioncoecientforallpossiblecodesish=lgmwhere Ontheotherhandweknowthat,modulocodingalphabet,Humancodingis misthenumberofdierentsymbolsofthetext. optimal.so,wecanconcludethat =?1 6 lgmmxi=1pilgpi (1)

7 isagoodapproximationforhumancompression.herepiistheprobabilityofa ofsymbolsinthetext(n=pmi=1ni).therealhumancompressioncoecient niisthecountoftheithalphabetmemberinthetextandnisthetotalcount symbol,memberofthealphabet,tooccurinthetextandisdenedasni=nwhere willbeequaltoorslightlygreaterthanthistheoreticalupperbound. theusefulnessofanydatacompression,thiscompressioncoecientmustbemultipliedbythebit-lengthoftheuncompressedtextinordertoobtainthebitlengthofthecompressedtext.thebit-lengthoftheuncompressedtextisnlgm. Hence,givenanalphabet,thetheoreticallowerboundforthebit-lengthofthe compressedtextis:lcompressed=nlgn?mxi=1nilgni[bits]. Notethatthisquantityisnotinvariantunderalphabetchangessincen,mand (2) Ifweareinterestedinthenalcodelengthwhichistheactualmeasurefor nivalueswillvaryfromalphabettoalphabet. 3GeneticAlgorithmsareemployedforalgorithmicsearchesbymimickingtheway GARepresentation value,aretransformedintoanewgenerationofthepopulationusingdarwinian naturegeneticallysearchesforsolutionsofthesurvivalproblemofitsspecies. principleofreproduction.hereusingthegeneticoperationssuchasrecombination(crossover)andmutationthepopulationisbreadedandevaluatedwitha possiblesolutiontothegivenproblem.thegaattemptstondtheoptimalor `survivalofthettests'criteria.eachindividualofthepopulationrepresentsa InGAapopulationofindividualobjects,eachpossessinganassociatedtness ingcomplex,highlynonlinear,multidimensionalsearchspaces.excellentreviews thepopulationofindividuals.inpracticegaisastonishinglyecientinsearch- nearlyoptimalsolutionstotheproblembyapplyingthosegeneticoperationsto canbefoundin[2,1,10]. 7

8 encodingoftheparametersofapossiblesolutionofthesubjectproblem.this encodingcanbedoneinvariouswaysbutmostlyaxedlengthstringischosen ThemainingredientofaGAimplementationisthechromosomewhichisthe agene.thesetofpossiblevalidvaluesagenecanholdiscalledthealleleofthat parametercorrespondstoaxedpositioninthechromosomewhichisnamedas duetotherelativeeasinessoftheimplementationofgeneticoperations.each chromosomestor.therunofagaisatwostepprocess.firstaninitialization isdevised.thisfunctionisnamedasthetnessfunctionandmapsthespaceof gene.afunctionwhichevaluatesthesuccessofasolution,namelyachromosome, ofapoolofsolutionsisperformed.thiscreationoftheinitialpoolismostlydone calledageneration.ineachgenerationthepopulationofchromosomesaremutated(randomlygenesarereplacedbyotherallelemembers)andthenmatedfor ofaprocesswhichconstitutesofthreebasicsteps.eachiterationofthiscycleis randomly.thenthemainstepofthegaisentered.thisisacontrolledcycle mannerwithpredeterminedprobabilities.followingthis,anevaluationprocess crossoverinwhichchromosomesexchangegeneswiththeirpartnersinarandom thetnessfunctionadecisionismadeaboutthechromosomeswhethertoexist iscarriedoutoverthenewgeneratedpopulation.usingthevaluesobtainedfrom (tolive)inthenextgenerationornot(todie). (namelysyllable)withlengthgreaterthanoneageneisassumedtocorrespond. Achromosomeisaxedlengthvectorofallelevalues1or0.Achromosomecorrespondstoacandidatesolution(inourcaseacandidatealphabet).Agenevalue of1meansthecorrespondingstringisincludedintothealphabet.a0meansthe correspondingstringwillbedissolvedintoitslettersresultinginanincremental contributiontothecountofthoseletters.atnessfunction,devised,evaluates achromosomebyrstdissolvingthenotincludedstrings,andthencalculating Inourproblemtoeverypredeterminedpossibleconstituentstringofthetext intheprevioussection.thecompressionlengthservesasthetnessvaluewhich Humancoding.Thiscalculationusesthetheoreticalapproximationexplained thecompressedlengthwhichwouldbeobtainedbyusingthatalphabetinthe willbeusedtodeterminewhichchromosomeisgoingtoliveandwhichisgoingto 8

9 die.sincetheoptimalcompressionlengthisnotknownthetnessvaluecannot relation.henceitisusedtoobtainasortingamongthesolutions.afteranew beconvertedtoanabsolutetnesscriteria,butratherbeusedasanordering generationisproduceditissortedaccordingtoeachchromosome'stnessvalue. Thebestsofthepreviousgenerationreplacetheworstsofthenewgeneration providedthat Thisreplacementtakesplaceforapredeterminedpercentageofthepoolat Thetnessofthereplacingchromosomeisbetterthanthereplacedone. most(whichisabout5%-10%). inwhichabout2700genes/chromosomeexistedarealsomentionedinitalics. aboutthetuningoftheenginethedynamicsettingsusedintherealapplication TheGAenginehasthefollowingalgorithmicoutline.Inordertogiveanidea Generatearandompopulation(seeexplanationbelow),evaluate Repeat: Poolsize=100chromosomes itandstoreitalsoastheformergeneration. Mutate. ChangesperChromosome=Fliponerandomlyselectedgene MutationRate=Onceeach10Generationonerandomchro- Mateallthepoolformingrandompairs,thenperformrandom crossoversamongpairs.henceformanewgeneration. Evaluatethenewgeneration,usingthetheoreticalapproximation. CrossOver=At10randomchosenrandomlengthgeneintervals thepreviousgeneration.keepratio=atmost10%(seeabove Replacethepoolbythenewgenerationkeepingthe`realbests'of Display/Recordperformanceresult. textforreplacementcondition) Ifitwasnotthelastgenerationtheuserdemanded,gotoRepeat. 9

10 proachedeventually,thespeedofconvergenceheavilydependsonsomeaspects ofthegaprocess.theinitialpoolcreationisoneoftheseaspects.iftheglobal AlthoughGA,bynature,isamechanisminwhichtheoptimalsolutionisap- searchspacehastobesearchedfortheoptimal,thenitiswisetoincludemembersfromalmostallregionsintheinitialpopulation.inthesubjectproblem,the propertiesofthespecicproblemdoesnotprovidescluesabouttheregionthe numberofmembersofalmostallpossiblecardinalities.so,forexample,thepool initialpopulationhadtobecreatedfromtheelementsofthepowersetofallconstituentsofthetext.theevennessoftheselectionisobtainedbyincludingequal thelettersandotherswhichhaveinclusionratioslinearlydistributedbetween stituents,anotherwhichcorrespondedtotheexclusionofallconstituentsexcept certainlycontainedamemberwhichcorrespondedtotheinclusionofallthecon- thesetwoextremes.thepoolsizeof100isagoodvalueacceptedempirically bymanygaresearchers[3].theuseofthecrossoveroperatorisencouraged mationofuseful`buildingblocks'underthisoperation.theencodingusedin forgaproblemswithencodingschemesthatpromotesthepropagationandfor- uniformcrossover.asknown,inuniformcrossovereachgeneiscrossedwitha thisapplicationisofsuchanature.thecrossoverusedisarestrictedversionof probabilityto0:5andthetotalcountofswappedblocksofgenesto10.various experimentationswiththesevaluesprovedthat10isanappropriate(thoughnot certainprobability(foragoodreviewofthesubjectsee[6,5]).werestrictthe approachwhereatmost10elementsofthepreviousgenerationarekept`alive' varycritical)choiceforproperconvergence.theselectionphaseusesanelitist Thenumberofiterationtoconvergetoasolutionisabout generations. IthasbeenobservedthatsuchanapproachstabilizestheconvergenceoftheGA. providedthattheyarebetterthantheworstelementsofthecurrentgeneration. Turkishisanaglunitativelanguage.Inections,tensesareallgeneratedbyappendingseveralsuxestorootwords.Althoughnotverycommon,itispossible 4 TurkishSyllableFormation 10

11 simplealgorithmforhyphenation.turkishlanguagehas8vowelsand21consonants.anysyllableofthelanguagehastohaveexactlyonevowel.inasyllable atmosttwoadjacentconsonantsisallowed.someadditionalruleslimitthe possibilitiestothefollowings(v:vowel,c:consonant): SyllablePattern VCV,VC NumberofPossibilities syllableboundariesinawordarethehyphenationpointsandthelanguagehasa toobservemeaningfulwordformationswhichmakeuseof10-15suxes.the VCC,CVC Thoughthiscombinatorialcalculationreveals8104possibilities,thelanguage usesabout3%ofthemonly.themostfrequenttypesofoccurancesarethe CVCC extremelyrare(oforder102)andoccurinatextwithprobabilitiesoforder10?4. ofcv,vc,cvctypepatterns.thefourlettercombinationsare scansawordandproducesthesyllables. ThefollowingsimplealgorithmwhichisO(n),(denotedinCsyntax),linearly 11

12 Assumethecharacterarrayturkishword[]holdsthewordtobe cessivesyllables.furthermoreaglobalintegervariablesylcount ofpointerssyl[]thathaselementspointingtotheendsofsuc- hyphenatedandthefunctionhyphen()uponacallllsoutanarray getssetbyhyphen()tothecountofsyllablesformed. char*twp; voidhyphen() {syl_count=0; twp=turkish_word-1; do{if(next_is_vowel()) if(next_is_vowel())mark(1); while(*twp); elseloop:if(next_is_vowel())mark(2); while(!*--twp); elseif(*twp)gotoloop;} }voidmark(chark) mark(0); intnext_is_vowel() {syl[syl_count++]=(twp-=k)+1;} {if(is_vowel(*(++twp))return1elsereturn0;} intis_vowel(charc) smallnumberofdistinctsyllablesthatareusedfrequentlythroughoutthelanguageenablesanecientuseoftheproposedcompressiontechniqueforturkish texts. Theexistenceofsuchasimplesyllableformationalgorithmandtherelatively returns1ifcisavowelelsereturns0 12

13 5magazinearticles,arecompressedthroughthisalgorithmandcomparedsizewise Atotalof5MBytesofTurkishcorpora,mainlygatheredfromnewsitemsand ResultsforTurkishTextsandConclusion withthestandardadaptivehumancodingoveraletteralphabet.thefound resultsaretabulatedbelow. (8bits/char) textlesize OriginalASCII#ofbytes Corpus1Corpus22Corpus3Corpus4 Lengthofuncompressedrepresenta tionwithmin.#ofbits/char(see text) Length(bits) Humancodingoversingle character alphabet Compressionratio Compressionratio ()w.r.t.minimalbitrepresentation Humancod-Length(bitsing overgadeterminelableextended alphabetsyl-compressionratio ()w.r.t.minimalbitrepresentation w.r.t.asciisize (#ofkeptsyllables)/(total#of w.r.t.asciisize Comparedtothestandardcodingthemethodhasprovidedanupto21% syllables) 1976/ / / / 2594 bettercompressionratio(excludingtheoverheadwhichisnegligible).theworst referenceismadebyputtingdownthevalueofreductioninthelesize.text quantitywiththeusually(butmistakenly)usedquantity.usuallyacompression improvementobservedwas13%.itisworthtopointoutthedierenceofthis lesaremadeofbyteswhereeachcharacter(letter,punctuationsymbol,etc.)is representedbyauniquebyte(usuallytheasciicode).butthewholebunchof 2containsonlylowercaseletters,hencecanbecodedwith5bits. 13

14 bytepatternshavenocharacterassociationatallorarenotfoundinthetext the`used'charactersaremuchlessthen28soactuallyaconsiderablenumberof hasagreaterinformationcontentthanitactuallypossesses).thereforethe consistsof28distinctcharacters(thisisassumingthattheuncompresseddata le.henceitiswrongtoassumethattheoriginalalphabetofthecompression compressionratio(whichwerefertoas)isproperlycalculatedwithrespectto therealinformationsizeoftheuncompressedtext.thismeansiftheoriginal LlgNbits.Aftercompression,assumethatthecompressionyieldsCnumber textconsistsoflcharactersfromasetofndistinctcharacters,sincedlgne ofbits,thenthecompressionratioiscalculatedastheratioofthecompressed bitswouldbesucienttorepresenteachcharacter,thewholetextwouldrequire bitlengthtotheuncompressedbitlength: Thetabulationabovedisplaysthiscorrectcompressionratioaswellastheobserveddecreaseinthetext(ASCII)lesize. = LlgN C valuescouldbeidentiedforexclusionfromthealphabet.themechanismthat codingincludesalmostallthepossiblesyllables.norulebasedonfrequency IthasbeenobservedthatforTurkishtextsthealphabetfortheHuman theoverallentropy.so,usingagaapproachseemstobeappropriatethatsuits leadstoinclusion/exclusionisheavilybasedonthewaythedissolvingaectsthe frequenciesoftheremainingalphabetmembersinfavorofincreasing/reducing syllabicationprocessissubstitutedbyaniterativetri-gramprocessinwhichat thepurposeofdecision. eachsteptri-gramsareattemptedtobereplacedbytokensaccordingtoaga's Itwouldbeinteresting,asafuturework,toconsidertheproblemwherethe successfulcompressionofanykindofdata. decision.webelievethatthiswillleadtoamoregenerallyapplicableandmore 14

15 References [1]L.D.Davis,HandbookofGeneticAlgorithms.(VanNonstrandReinhold, [2]D.E.Goldberg,GeneticAlgorithms(Addison{WesleyCo.,Reading,MA, 1991) [3]D.E.Goldberg,SizingPopulationsforSerialandParallelGeneticAlgorithms,Proc.ICGA'89, ). [4]R.W.Hamming,CodingandInformationTheory(Prentice{Hall,EnglewoodClis,NJ,1986). [5]T.Jones,EvolutionaryAlgorithms,tnessLandscapeandSearch.PhDthesis,(TheUniversityofNewMexico,NewMexico,1995). [6]K.A.DeJongandW.M.Spears,AnAnalysisofMulti-PointCrossover. [7]G.Lewis,TurkishGrammar(OxfordUniversityPress,Oxford,1991). FGA, ,1991. [8]S.Roman,CodingandInformationTheory(Springer{Verlag,NY,1992). [10]A.Wright,ed.FoundationsofGeneticAlgorithms.(Morgan-Kaufmann, [9]R.Sedgewick,Algorithms(Addison{WesleyCo.,Reading,MA,1988). 1991). 15

Ch.16-17 Review. Name: Class: Date: Multiple Choice Identify the choice that best completes the statement or answers the question.

Ch.16-17 Review. Name: Class: Date: Multiple Choice Identify the choice that best completes the statement or answers the question. Name: Class: Date: Ch.16-17 Review Multiple Choice Identify the choice that best completes the statement or answers the question. 1. Which of the following statements describe what all members of a population

More information

Beaming in your answers

Beaming in your answers Bio 112 Handout for Evolution 4 This handout contains: Today s iclicker Question Figures for today s lecture iclicker Question #1 - after lecture Which of the following statements are false: A. If the

More information

Genetic Algorithms commonly used selection, replacement, and variation operators Fernando Lobo University of Algarve

Genetic Algorithms commonly used selection, replacement, and variation operators Fernando Lobo University of Algarve Genetic Algorithms commonly used selection, replacement, and variation operators Fernando Lobo University of Algarve Outline Selection methods Replacement methods Variation operators Selection Methods

More information

Microevolution: The mechanism of evolution

Microevolution: The mechanism of evolution Microevolution: The mechanism of evolution What is it that evolves? Not individual organisms Populations are the smallest units that evolve Population: members of a species (interbreeding individuals and

More information

Chapter 16 Evolution of Populations. 16.1 Genes and Variation Biology Mr. Hines

Chapter 16 Evolution of Populations. 16.1 Genes and Variation Biology Mr. Hines Chapter 16 Evolution of Populations 16.1 Genes and Variation Biology Mr. Hines Figure 1-21 Levels of Organization Section 1-3 Levels of organization Biosphere Ecosystem The part of Earth that contains

More information

Inheritance Patterns and Human Genetics. Chapter 12. Table of Contents. Section 1 Chromosomes and Inheritance Section 2 Human Genetics

Inheritance Patterns and Human Genetics. Chapter 12. Table of Contents. Section 1 Chromosomes and Inheritance Section 2 Human Genetics Inheritance Patterns and Human Genetics Table of Contents Section 1 Chromosomes and Inheritance Section 1 Chromosomes and Inheritance Objectives Distinguish between sex chromosomes and autosomes. Explain

More information

Genetic Algorithms. Part 2: The Knapsack Problem. Spring 2009 Instructor: Dr. Masoud Yaghini

Genetic Algorithms. Part 2: The Knapsack Problem. Spring 2009 Instructor: Dr. Masoud Yaghini Genetic Algorithms Part 2: The Knapsack Problem Spring 2009 Instructor: Dr. Masoud Yaghini Outline Genetic Algorithms: Part 2 Problem Definition Representations Fitness Function Handling of Constraints

More information

Microevolution is a change in population s gene pool [1]

Microevolution is a change in population s gene pool [1] GUIDED READING - Ch. 14 - Section 4 NAME: Please print out these pages and HANDWRITE the answers directly on the printouts. Typed work or answers on separate sheets of paper will not be accepted. Importantly,

More information

Evolution, Natural Selection, and Adaptation

Evolution, Natural Selection, and Adaptation Evolution, Natural Selection, and Adaptation Nothing in biology makes sense except in the light of evolution. (Theodosius Dobzhansky) Charles Darwin (1809-1882) Voyage of HMS Beagle (1831-1836) Thinking

More information

INTRODUCTION TO GENETICS USING TOBACCO (Nicotiana tabacum) SEEDLINGS

INTRODUCTION TO GENETICS USING TOBACCO (Nicotiana tabacum) SEEDLINGS INTRODUCTION TO GENETICS USING TOBACCO (Nicotiana tabacum) SEEDLINGS By Dr. Susan Petro Based on a lab by Dr. Elaine Winshell Nicotiana tabacum Objectives To apply Mendel s Law of Segregation To use Punnett

More information

Workshop on Microevolution

Workshop on Microevolution Workshop on Microevolution by Dana Krempels I. Discuss the meaning of: a. species f. heritable traits (consider "nature vs. nurture") b. population g. lethal alleles c. gene pool h. adaptive, maladaptive,

More information

Comparison of Major Domination Schemes for Diploid Binary Genetic Algorithms in Dynamic Environments

Comparison of Major Domination Schemes for Diploid Binary Genetic Algorithms in Dynamic Environments Comparison of Maor Domination Schemes for Diploid Binary Genetic Algorithms in Dynamic Environments A. Sima UYAR and A. Emre HARMANCI Istanbul Technical University Computer Engineering Department Maslak

More information

Holland s GA Schema Theorem

Holland s GA Schema Theorem Holland s GA Schema Theorem v Objective provide a formal model for the effectiveness of the GA search process. v In the following we will first approach the problem through the framework formalized by

More information

SeqArray: an R/Bioconductor Package for Big Data Management of Genome-Wide Sequence Variants

SeqArray: an R/Bioconductor Package for Big Data Management of Genome-Wide Sequence Variants SeqArray: an R/Bioconductor Package for Big Data Management of Genome-Wide Sequence Variants 1 Dr. Xiuwen Zheng Department of Biostatistics University of Washington Seattle Introduction Thousands of gigabyte

More information

Chapter 23. (Mendelian) Population. Gene Pool. Genetic Variation. Population Genetics

Chapter 23. (Mendelian) Population. Gene Pool. Genetic Variation. Population Genetics 30 25 Chapter 23 Population Genetics Frequency 20 15 10 5 0 A B C D F Grade = 57 Avg = 79.5 % (Mendelian) Population A group of interbreeding, sexually reproducing organisms that share a common set of

More information

On the Use of Compression Algorithms for Network Traffic Classification

On the Use of Compression Algorithms for Network Traffic Classification On the Use of for Network Traffic Classification Christian CALLEGARI Department of Information Ingeneering University of Pisa 23 September 2008 COST-TMA Meeting Samos, Greece Outline Outline 1 Introduction

More information

9.1: Mechanisms of Evolution and Their Effect on Populations pg. 350-359

9.1: Mechanisms of Evolution and Their Effect on Populations pg. 350-359 9.1: Mechanisms of Evolution and Their Effect on Populations pg. 350-359 Key Terms: gene flow, non-random mating, genetic drift, founder effect, bottleneck effect, stabilizing selection, directional selection

More information

Breast cancer and the role of low penetrance alleles: a focus on ATM gene

Breast cancer and the role of low penetrance alleles: a focus on ATM gene Modena 18-19 novembre 2010 Breast cancer and the role of low penetrance alleles: a focus on ATM gene Dr. Laura La Paglia Breast Cancer genetic Other BC susceptibility genes TP53 PTEN STK11 CHEK2 BRCA1

More information

Genetic Algorithm. Based on Darwinian Paradigm. Intrinsically a robust search and optimization mechanism. Conceptual Algorithm

Genetic Algorithm. Based on Darwinian Paradigm. Intrinsically a robust search and optimization mechanism. Conceptual Algorithm 24 Genetic Algorithm Based on Darwinian Paradigm Reproduction Competition Survive Selection Intrinsically a robust search and optimization mechanism Slide -47 - Conceptual Algorithm Slide -48 - 25 Genetic

More information

Biology 1406 - Notes for exam 5 - Population genetics Ch 13, 14, 15

Biology 1406 - Notes for exam 5 - Population genetics Ch 13, 14, 15 Biology 1406 - Notes for exam 5 - Population genetics Ch 13, 14, 15 Species - group of individuals that are capable of interbreeding and producing fertile offspring; genetically similar 13.7, 14.2 Population

More information

Complex Inheritance. Mendel observed monogenic traits and no linked genes It s not usually that simple.

Complex Inheritance. Mendel observed monogenic traits and no linked genes It s not usually that simple. Complex Inheritance Mendel observed monogenic traits and no linked genes It s not usually that simple. Other Types of Inheritance Incomplete Dominance The phenotype of the heterozygote is intermediate

More information

Theories of Evolution: A Brief History (take notes from classmates presentations)

Theories of Evolution: A Brief History (take notes from classmates presentations) Packet Theories of : A Brief History (take notes from classmates presentations) Carl Linnaeus (1707-1778) William Paley (1743-1805) Georges Cuvier (1769-1832) Thomas Malthus (1766-1834) Jean Baptiste Lamarck

More information

Quiz #4 Ch. 4 Modern Evolutionary Theory

Quiz #4 Ch. 4 Modern Evolutionary Theory Physical Anthropology Summer 2014 Dr. Leanna Wolfe Quiz #4 Ch. 4 Modern Evolutionary Theory 1. T/F Evolution by natural selection works directly on individuals, transforming populations. 2. T/F A genotypic

More information

College of information technology Department of software

College of information technology Department of software University of Babylon Undergraduate: third class College of information technology Department of software Subj.: Application of AI lecture notes/2011-2012 ***************************************************************************

More information

Summary. 16 1 Genes and Variation. 16 2 Evolution as Genetic Change. Name Class Date

Summary. 16 1 Genes and Variation. 16 2 Evolution as Genetic Change. Name Class Date Chapter 16 Summary Evolution of Populations 16 1 Genes and Variation Darwin s original ideas can now be understood in genetic terms. Beginning with variation, we now know that traits are controlled by

More information

Lab 4: 26 th March 2012. Exercise 1: Evolutionary algorithms

Lab 4: 26 th March 2012. Exercise 1: Evolutionary algorithms Lab 4: 26 th March 2012 Exercise 1: Evolutionary algorithms 1. Found a problem where EAs would certainly perform very poorly compared to alternative approaches. Explain why. Suppose that we want to find

More information

Comparison of different image compression formats. ECE 533 Project Report Paula Aguilera

Comparison of different image compression formats. ECE 533 Project Report Paula Aguilera Comparison of different image compression formats ECE 533 Project Report Paula Aguilera Introduction: Images are very important documents nowadays; to work with them in some applications they need to be

More information

Lecture 2: Mitosis and meiosis

Lecture 2: Mitosis and meiosis Lecture 2: Mitosis and meiosis 1. Chromosomes 2. Diploid life cycle 3. Cell cycle 4. Mitosis 5. Meiosis 6. Parallel behavior of genes and chromosomes Basic morphology of chromosomes telomere short arm

More information

SeqArray: an R/Bioconductor Package for Big Data Management of Genome-Wide Sequencing Variants

SeqArray: an R/Bioconductor Package for Big Data Management of Genome-Wide Sequencing Variants SeqArray: an R/Bioconductor Package for Big Data Management of Genome-Wide Sequencing Variants Xiuwen Zheng Department of Biostatistics University of Washington Seattle Introduction Thousands of gigabyte

More information

Name: Class: Date: ID: A

Name: Class: Date: ID: A Name: Class: _ Date: _ Meiosis Quiz 1. (1 point) A kidney cell is an example of which type of cell? a. sex cell b. germ cell c. somatic cell d. haploid cell 2. (1 point) How many chromosomes are in a human

More information

Mechanisms of Evolution

Mechanisms of Evolution page 2 page 3 Teacher's Notes Mechanisms of Evolution Grades: 11-12 Duration: 28 mins Summary of Program Evolution is the gradual change that can be seen in a population s genetic composition, from one

More information

CHAPTER 23 THE EVOLUTIONS OF POPULATIONS. Section B: Causes of Microevolution

CHAPTER 23 THE EVOLUTIONS OF POPULATIONS. Section B: Causes of Microevolution CHAPTER 23 THE EVOLUTIONS OF POPULATIONS Section B: Causes of Microevolution 1. Microevolution is generation-to-generation change in a population s allele frequencies 2. The two main causes of microevolution

More information

15.0. Percent Exceptions 10.0 5.0 0.0

15.0. Percent Exceptions 10.0 5.0 0.0 WhyCOTSSoftwareIncreasesSecurityRisks GaryMcGraw ReliableSoftwareTechnologies 21515RidgetopCircle,Suite250,Sterling,VA20166 phone:(703)404-9293,fax:(703)404-9295 email:gem@rstcorp.com http://www.rstcorp.com

More information

Arithmetic Coding: Introduction

Arithmetic Coding: Introduction Data Compression Arithmetic coding Arithmetic Coding: Introduction Allows using fractional parts of bits!! Used in PPM, JPEG/MPEG (as option), Bzip More time costly than Huffman, but integer implementation

More information

Chapter 16 How Populations Evolve

Chapter 16 How Populations Evolve Title Chapter 16 How Populations Evolve Copyright The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Population Genetics A population is all of the members of a single species

More information

Modified Version of Roulette Selection for Evolution Algorithms - the Fan Selection

Modified Version of Roulette Selection for Evolution Algorithms - the Fan Selection Modified Version of Roulette Selection for Evolution Algorithms - the Fan Selection Adam S lowik, Micha l Bia lko Department of Electronic, Technical University of Koszalin, ul. Śniadeckich 2, 75-453 Koszalin,

More information

Numerical Research on Distributed Genetic Algorithm with Redundant

Numerical Research on Distributed Genetic Algorithm with Redundant Numerical Research on Distributed Genetic Algorithm with Redundant Binary Number 1 Sayori Seto, 2 Akinori Kanasugi 1,2 Graduate School of Engineering, Tokyo Denki University, Japan 10kme41@ms.dendai.ac.jp,

More information

Chapter 21 Active Reading Guide The Evolution of Populations

Chapter 21 Active Reading Guide The Evolution of Populations Name: Roksana Korbi AP Biology Chapter 21 Active Reading Guide The Evolution of Populations This chapter begins with the idea that we focused on as we closed Chapter 19: Individuals do not evolve! Populations

More information

Section Review 15-1 1.

Section Review 15-1 1. Section Review 15-1 1. Beagle 2. theory of evolution 3. varied 4. Darwin s curiosity might have led him to make many observations and ask questions about the natural world. His analytical nature may have

More information

CHROMOSOMES AND INHERITANCE

CHROMOSOMES AND INHERITANCE SECTION 12-1 REVIEW CHROMOSOMES AND INHERITANCE VOCABULARY REVIEW Distinguish between the terms in each of the following pairs of terms. 1. sex chromosome, autosome 2. germ-cell mutation, somatic-cell

More information

Paternity Testing. Chapter 23

Paternity Testing. Chapter 23 Paternity Testing Chapter 23 Kinship and Paternity DNA analysis can also be used for: Kinship testing determining whether individuals are related Paternity testing determining the father of a child Missing

More information

Proposal and Analysis of Stock Trading System Using Genetic Algorithm and Stock Back Test System

Proposal and Analysis of Stock Trading System Using Genetic Algorithm and Stock Back Test System Proposal and Analysis of Stock Trading System Using Genetic Algorithm and Stock Back Test System Abstract: In recent years, many brokerage firms and hedge funds use a trading system based on financial

More information

AP BIOLOGY 2010 SCORING GUIDELINES (Form B)

AP BIOLOGY 2010 SCORING GUIDELINES (Form B) AP BIOLOGY 2010 SCORING GUIDELINES (Form B) Question 2 Certain human genetic conditions, such as sickle cell anemia, result from single base-pair mutations in DNA. (a) Explain how a single base-pair mutation

More information

Multimedia Systems WS 2010/2011

Multimedia Systems WS 2010/2011 Multimedia Systems WS 2010/2011 31.01.2011 M. Rahamatullah Khondoker (Room # 36/410 ) University of Kaiserslautern Department of Computer Science Integrated Communication Systems ICSY http://www.icsy.de

More information

Software Engineering and Service Design: courses in ITMO University

Software Engineering and Service Design: courses in ITMO University Software Engineering and Service Design: courses in ITMO University Igor Buzhinsky igor.buzhinsky@gmail.com Computer Technologies Department Department of Computer Science and Information Systems December

More information

Package COSINE. February 19, 2015

Package COSINE. February 19, 2015 Type Package Title COndition SpecIfic sub-network Version 2.1 Date 2014-07-09 Author Package COSINE February 19, 2015 Maintainer Depends R (>= 3.1.0), MASS,genalg To identify

More information

Chapter 8: Recombinant DNA 2002 by W. H. Freeman and Company Chapter 8: Recombinant DNA 2002 by W. H. Freeman and Company

Chapter 8: Recombinant DNA 2002 by W. H. Freeman and Company Chapter 8: Recombinant DNA 2002 by W. H. Freeman and Company Genetic engineering: humans Gene replacement therapy or gene therapy Many technical and ethical issues implications for gene pool for germ-line gene therapy what traits constitute disease rather than just

More information

Information, Entropy, and Coding

Information, Entropy, and Coding Chapter 8 Information, Entropy, and Coding 8. The Need for Data Compression To motivate the material in this chapter, we first consider various data sources and some estimates for the amount of data associated

More information

Image Compression through DCT and Huffman Coding Technique

Image Compression through DCT and Huffman Coding Technique International Journal of Current Engineering and Technology E-ISSN 2277 4106, P-ISSN 2347 5161 2015 INPRESSCO, All Rights Reserved Available at http://inpressco.com/category/ijcet Research Article Rahul

More information

II B. Gene Flow. II C. Assortative Mating. II D. Genetic Drift. II E. Natural Selection. Northern Elephant Seal: Example of Bottleneck

II B. Gene Flow. II C. Assortative Mating. II D. Genetic Drift. II E. Natural Selection. Northern Elephant Seal: Example of Bottleneck I. What is Evolution? Agents of Evolutionary Change The Five Forces of Evolution and How We Measure Them A. First, remember that Evolution is a two-stage process: 1. Production and redistribution of variation

More information

A Parallel Processor for Distributed Genetic Algorithm with Redundant Binary Number

A Parallel Processor for Distributed Genetic Algorithm with Redundant Binary Number A Parallel Processor for Distributed Genetic Algorithm with Redundant Binary Number 1 Tomohiro KAMIMURA, 2 Akinori KANASUGI 1 Department of Electronics, Tokyo Denki University, 07ee055@ms.dendai.ac.jp

More information

(1-p) 2. p(1-p) From the table, frequency of DpyUnc = ¼ (p^2) = #DpyUnc = p^2 = 0.0004 ¼(1-p)^2 + ½(1-p)p + ¼(p^2) #Dpy + #DpyUnc

(1-p) 2. p(1-p) From the table, frequency of DpyUnc = ¼ (p^2) = #DpyUnc = p^2 = 0.0004 ¼(1-p)^2 + ½(1-p)p + ¼(p^2) #Dpy + #DpyUnc Advanced genetics Kornfeld problem set_key 1A (5 points) Brenner employed 2-factor and 3-factor crosses with the mutants isolated from his screen, and visually assayed for recombination events between

More information

HIGH DENSITY DATA STORAGE IN DNA USING AN EFFICIENT MESSAGE ENCODING SCHEME Rahul Vishwakarma 1 and Newsha Amiri 2

HIGH DENSITY DATA STORAGE IN DNA USING AN EFFICIENT MESSAGE ENCODING SCHEME Rahul Vishwakarma 1 and Newsha Amiri 2 HIGH DENSITY DATA STORAGE IN DNA USING AN EFFICIENT MESSAGE ENCODING SCHEME Rahul Vishwakarma 1 and Newsha Amiri 2 1 Tata Consultancy Services, India derahul@ieee.org 2 Bangalore University, India ABSTRACT

More information

A Comparison of Genotype Representations to Acquire Stock Trading Strategy Using Genetic Algorithms

A Comparison of Genotype Representations to Acquire Stock Trading Strategy Using Genetic Algorithms 2009 International Conference on Adaptive and Intelligent Systems A Comparison of Genotype Representations to Acquire Stock Trading Strategy Using Genetic Algorithms Kazuhiro Matsui Dept. of Computer Science

More information

SNPbrowser Software v3.5

SNPbrowser Software v3.5 Product Bulletin SNP Genotyping SNPbrowser Software v3.5 A Free Software Tool for the Knowledge-Driven Selection of SNP Genotyping Assays Easily visualize SNPs integrated with a physical map, linkage disequilibrium

More information

Allele Frequencies: Changing. Chapter 15

Allele Frequencies: Changing. Chapter 15 Allele Frequencies: Changing Chapter 15 Changing Allele Frequencies 1. Mutation introduces new alleles into population 2. Natural Selection specific alleles are more likely to be passed down because they

More information

Lecture 10 Friday, March 20, 2009

Lecture 10 Friday, March 20, 2009 Lecture 10 Friday, March 20, 2009 Reproductive isolating mechanisms Prezygotic barriers: Anything that prevents mating and fertilization is a prezygotic mechanism. Habitat isolation, behavioral isolation,

More information

Bioinformatics Resources at a Glance

Bioinformatics Resources at a Glance Bioinformatics Resources at a Glance A Note about FASTA Format There are MANY free bioinformatics tools available online. Bioinformaticists have developed a standard format for nucleotide and protein sequences

More information

Introduction To Genetic Algorithms

Introduction To Genetic Algorithms 1 Introduction To Genetic Algorithms Dr. Rajib Kumar Bhattacharjya Department of Civil Engineering IIT Guwahati Email: rkbc@iitg.ernet.in References 2 D. E. Goldberg, Genetic Algorithm In Search, Optimization

More information

Catch Me If You Can: A Practical Framework to Evade Censorship in Information-Centric Networks

Catch Me If You Can: A Practical Framework to Evade Censorship in Information-Centric Networks Catch Me If You Can: A Practical Framework to Evade Censorship in Information-Centric Networks Reza Tourani, Satyajayant (Jay) Misra, Joerg Kliewer, Scott Ortegel, Travis Mick Computer Science Department

More information

Deterministic computer simulations were performed to evaluate the effect of maternallytransmitted

Deterministic computer simulations were performed to evaluate the effect of maternallytransmitted Supporting Information 3. Host-parasite simulations Deterministic computer simulations were performed to evaluate the effect of maternallytransmitted parasites on the evolution of sex. Briefly, the simulations

More information

Agilent CytoGenomics Software A Complete Solution for Cytogenetic Research Data Analysis

Agilent CytoGenomics Software A Complete Solution for Cytogenetic Research Data Analysis Agilent CytoGenomics Software A Complete Solution for Cytogenetic Research Data Analysis Technical Overview Streamlines the cytogenetic research workflow for finding CNCs, LOH, and UPD Enables manual sample

More information

Genetic Drift -- the role of finite population size

Genetic Drift -- the role of finite population size Genetic Drift -- the role of finite population size Evolution can be thought of as a change in allele frequency, and finite population size alone insures that evolution will occur through sampling error.

More information

Commonly Used STR Markers

Commonly Used STR Markers Commonly Used STR Markers Repeats Satellites 100 to 1000 bases repeated Minisatellites VNTR variable number tandem repeat 10 to 100 bases repeated Microsatellites STR short tandem repeat 2 to 6 bases repeated

More information

Genetic information (DNA) determines structure of proteins DNA RNA proteins cell structure 3.11 3.15 enzymes control cell chemistry ( metabolism )

Genetic information (DNA) determines structure of proteins DNA RNA proteins cell structure 3.11 3.15 enzymes control cell chemistry ( metabolism ) Biology 1406 Exam 3 Notes Structure of DNA Ch. 10 Genetic information (DNA) determines structure of proteins DNA RNA proteins cell structure 3.11 3.15 enzymes control cell chemistry ( metabolism ) Proteins

More information

A Robust Method for Solving Transcendental Equations

A Robust Method for Solving Transcendental Equations www.ijcsi.org 413 A Robust Method for Solving Transcendental Equations Md. Golam Moazzam, Amita Chakraborty and Md. Al-Amin Bhuiyan Department of Computer Science and Engineering, Jahangirnagar University,

More information

Data Compression Techniques on Text Files: A Comparison Study

Data Compression Techniques on Text Files: A Comparison Study Data Compression Techniques on Text Files: A Comparison Study Haroon Altarawneh Albalqa Applied University Salt, Jordan ABSTRACT In this paper, we study different methods of data compression algorithms

More information

CHAPTER 2 LITERATURE REVIEW

CHAPTER 2 LITERATURE REVIEW 11 CHAPTER 2 LITERATURE REVIEW 2.1 INTRODUCTION Image compression is mainly used to reduce storage space, transmission time and bandwidth requirements. In the subsequent sections of this chapter, general

More information

Roberto Ciccone, Orsetta Zuffardi Università di Pavia

Roberto Ciccone, Orsetta Zuffardi Università di Pavia Roberto Ciccone, Orsetta Zuffardi Università di Pavia XIII Corso di Formazione Malformazioni Congenite dalla Diagnosi Prenatale alla Terapia Postnatale unipv.eu Carrara, 24 ottobre 2014 Legend:Bluebars

More information

Ch. 13 How Populations Evolve Period. 4. Describe Lamarck s proposed theory of evolution, The Theory of Acquired Traits.

Ch. 13 How Populations Evolve Period. 4. Describe Lamarck s proposed theory of evolution, The Theory of Acquired Traits. Ch. 13 How Populations Evolve Name Period California State Standards covered by this chapter: Evolution 7. The frequency of an allele in a gene pool of a population depends on many factors and may be stable

More information

Population Genetics -- Evolutionary Stasis and the Hardy-Weinberg Principles 1

Population Genetics -- Evolutionary Stasis and the Hardy-Weinberg Principles 1 Population Genetics -- Evolutionary Stasis and the Hardy-Weinberg Principles 1 Review and Introduction Mendel presented the first successful theory of the inheritance of biological variation. He viewed

More information

A Perfect CRIME? TIME Will Tell. Tal Be ery, Web research TL

A Perfect CRIME? TIME Will Tell. Tal Be ery, Web research TL A Perfect CRIME? TIME Will Tell Tal Be ery, Web research TL Agenda BEAST + Modes of operation CRIME + Gzip compression + Compression + encryption leak data TIME + Timing + compression leak data Attacking

More information

ISSN: 2319-5967 ISO 9001:2008 Certified International Journal of Engineering Science and Innovative Technology (IJESIT) Volume 2, Issue 3, May 2013

ISSN: 2319-5967 ISO 9001:2008 Certified International Journal of Engineering Science and Innovative Technology (IJESIT) Volume 2, Issue 3, May 2013 Transistor Level Fault Finding in VLSI Circuits using Genetic Algorithm Lalit A. Patel, Sarman K. Hadia CSPIT, CHARUSAT, Changa., CSPIT, CHARUSAT, Changa Abstract This paper presents, genetic based algorithm

More information

What two Assumptions did Darwin have to arrive at BEFORE he could form his theories of evolution?

What two Assumptions did Darwin have to arrive at BEFORE he could form his theories of evolution? Influences on Darwin s Thinking: What ideas did each of the listed names below contribute to Darwin s thinking about evolution? (very brief) Georges Buffon: Jean Baptiste Lamarck: Charles Lyell: Thomas

More information

2. The Law of Independent Assortment Members of one pair of genes (alleles) segregate independently of members of other pairs.

2. The Law of Independent Assortment Members of one pair of genes (alleles) segregate independently of members of other pairs. 1. The Law of Segregation: Genes exist in pairs and alleles segregate from each other during gamete formation, into equal numbers of gametes. Progeny obtain one determinant from each parent. 2. The Law

More information

A Non-Linear Schema Theorem for Genetic Algorithms

A Non-Linear Schema Theorem for Genetic Algorithms A Non-Linear Schema Theorem for Genetic Algorithms William A Greene Computer Science Department University of New Orleans New Orleans, LA 70148 bill@csunoedu 504-280-6755 Abstract We generalize Holland

More information

BioSci 2200 General Genetics Problem Set 1 Answer Key Introduction and Mitosis/ Meiosis

BioSci 2200 General Genetics Problem Set 1 Answer Key Introduction and Mitosis/ Meiosis BioSci 2200 General Genetics Problem Set 1 Answer Key Introduction and Mitosis/ Meiosis Introduction - Fields of Genetics To answer the following question, review the three traditional subdivisions of

More information

Management Science Letters

Management Science Letters Management Science Letters 4 (2014) 905 912 Contents lists available at GrowingScience Management Science Letters homepage: www.growingscience.com/msl Measuring customer loyalty using an extended RFM and

More information

Use of Genetic Algorithm in Network Security

Use of Genetic Algorithm in Network Security Use of Genetic Algorithm in Network Security L.M.R.J Lobo Professor, Department of Computer Science & Engg. Walchand Institute of Technology, Solapur, India Suhas B. Chavan MECSE (SEM IV), Department of

More information

Today s topics. Digital Computers. More on binary. Binary Digits (Bits)

Today s topics. Digital Computers. More on binary. Binary Digits (Bits) Today s topics! Binary Numbers! Brookshear.-.! Slides from Prof. Marti Hearst of UC Berkeley SIMS! Upcoming! Networks Interactive Introduction to Graph Theory http://www.utm.edu/cgi-bin/caldwell/tutor/departments/math/graph/intro

More information

GENETIC TRAITS IN HARRY POTTER DOMAIN 3-GENETICS

GENETIC TRAITS IN HARRY POTTER DOMAIN 3-GENETICS Learning Outcomes: Students will be able to: Define the basic genetic terms and concepts DNA, chromosome, gene, allele, homozygous, heterozygous, recessive and dominant genes, genotype, phenotype, and

More information

This fact sheet describes how genes affect our health when they follow a well understood pattern of genetic inheritance known as autosomal recessive.

This fact sheet describes how genes affect our health when they follow a well understood pattern of genetic inheritance known as autosomal recessive. 11111 This fact sheet describes how genes affect our health when they follow a well understood pattern of genetic inheritance known as autosomal recessive. In summary Genes contain the instructions for

More information

Alpha-1 Antitrypsin Deficiency A future NBS candidate?

Alpha-1 Antitrypsin Deficiency A future NBS candidate? Alpha-1 Antitrypsin Deficiency A future NBS candidate? Robert A. Sandhaus, MD, PhD Alpha-1 Antitrypsin Deficiency Condition: Alpha-1 antitrypsin deficiency, alpha-1 proteinase inhibitor deficiency, Alpha-1,

More information

International Journal of Advanced Research in Computer Science and Software Engineering

International Journal of Advanced Research in Computer Science and Software Engineering Volume 3, Issue 7, July 23 ISSN: 2277 28X International Journal of Advanced Research in Computer Science and Software Engineering Research Paper Available online at: www.ijarcsse.com Greedy Algorithm:

More information

Architecture bits. (Chromosome) (Evolved chromosome) Downloading. Downloading PLD. GA operation Architecture bits

Architecture bits. (Chromosome) (Evolved chromosome) Downloading. Downloading PLD. GA operation Architecture bits A Pattern Recognition System Using Evolvable Hardware Masaya Iwata 1 Isamu Kajitani 2 Hitoshi Yamada 2 Hitoshi Iba 1 Tetsuya Higuchi 1 1 1-1-4,Umezono,Tsukuba,Ibaraki,305,Japan Electrotechnical Laboratory

More information

11.4 Meiosis. Lesson Objectives. Lesson Summary

11.4 Meiosis. Lesson Objectives. Lesson Summary 11.4 Meiosis Lesson Objectives Contrast the number of chromosomes in body cells and in gametes. Summarize the events of meiosis. Contrast meiosis and mitosis. Describe how alleles from different genes

More information

A hybrid Approach of Genetic Algorithm and Particle Swarm Technique to Software Test Case Generation

A hybrid Approach of Genetic Algorithm and Particle Swarm Technique to Software Test Case Generation A hybrid Approach of Genetic Algorithm and Particle Swarm Technique to Software Test Case Generation Abhishek Singh Department of Information Technology Amity School of Engineering and Technology Amity

More information

Performance of Hybrid Genetic Algorithms Incorporating Local Search

Performance of Hybrid Genetic Algorithms Incorporating Local Search Performance of Hybrid Genetic Algorithms Incorporating Local Search T. Elmihoub, A. A. Hopgood, L. Nolle and A. Battersby The Nottingham Trent University, School of Computing and Technology, Burton Street,

More information

A and B are not absolutely linked. They could be far enough apart on the chromosome that they assort independently.

A and B are not absolutely linked. They could be far enough apart on the chromosome that they assort independently. Name Section 7.014 Problem Set 5 Please print out this problem set and record your answers on the printed copy. Answers to this problem set are to be turned in to the box outside 68-120 by 5:00pm on Friday

More information

Human Mendelian Disorders. Genetic Technology. What is Genetics? Genes are DNA 9/3/2008. Multifactorial Disorders

Human Mendelian Disorders. Genetic Technology. What is Genetics? Genes are DNA 9/3/2008. Multifactorial Disorders Human genetics: Why? Human Genetics Introduction Determine genotypic basis of variant phenotypes to facilitate: Understanding biological basis of human genetic diversity Prenatal diagnosis Predictive testing

More information

Evolution and Darwin

Evolution and Darwin Evolution and Darwin Evolution The processes that have transformed life on earth from it s earliest forms to the vast diversity that characterizes it today. A change in the genes!!!!!!!! Old Theories of

More information

International Journal of Software and Web Sciences (IJSWS) www.iasir.net

International Journal of Software and Web Sciences (IJSWS) www.iasir.net International Association of Scientific Innovation and Research (IASIR) (An Association Unifying the Sciences, Engineering, and Applied Research) ISSN (Print): 2279-0063 ISSN (Online): 2279-0071 International

More information

THE EUKARYOTIC CELL CYCLE AND CANCER: IN DEPTH

THE EUKARYOTIC CELL CYCLE AND CANCER: IN DEPTH THE EUKARYOTIC CELL CYCLE AND CANCER: IN DEPTH ABOUT THIS WORKSHEET This worksheet complements the Click and Learn The Eukaryotic Cell Cycle and Cancer and is intended as an in-depth examination of the

More information

LAB 11 Natural Selection (version 2)

LAB 11 Natural Selection (version 2) LAB 11 Natural Selection (version 2) Overview In this laboratory you will demonstrate the process of evolution by natural selection by carrying out a predator/prey simulation. Through this exercise you

More information

Randomly Encryption Using Genetic Algorithm

Randomly Encryption Using Genetic Algorithm Randomly Encryption Using Genetic Algorithm ALI JASSIM MOHAMED ALI Department of physics, College of Science, Al-Mustansiriyah University, Baghdad, Iraq. SUMMARY In this research work a genetic algorithm

More information

Data Analysis for Ion Torrent Sequencing

Data Analysis for Ion Torrent Sequencing IFU022 v140202 Research Use Only Instructions For Use Part III Data Analysis for Ion Torrent Sequencing MANUFACTURER: Multiplicom N.V. Galileilaan 18 2845 Niel Belgium Revision date: August 21, 2014 Page

More information

Lempel-Ziv Coding Adaptive Dictionary Compression Algorithm

Lempel-Ziv Coding Adaptive Dictionary Compression Algorithm Lempel-Ziv Coding Adaptive Dictionary Compression Algorithm 1. LZ77:Sliding Window Lempel-Ziv Algorithm [gzip, pkzip] Encode a string by finding the longest match anywhere within a window of past symbols

More information

Vol. 35, No. 3, Sept 30,2000 ملخص تعتبر الخوارزمات الجينية واحدة من أفضل طرق البحث من ناحية األداء. فبالرغم من أن استخدام هذه الطريقة ال يعطي الحل

Vol. 35, No. 3, Sept 30,2000 ملخص تعتبر الخوارزمات الجينية واحدة من أفضل طرق البحث من ناحية األداء. فبالرغم من أن استخدام هذه الطريقة ال يعطي الحل AIN SHAMS UNIVERSITY FACULTY OF ENGINEERING Vol. 35, No. 3, Sept 30,2000 SCIENTIFIC BULLETIN Received on : 3/9/2000 Accepted on: 28/9/2000 pp : 337-348 GENETIC ALGORITHMS AND ITS USE WITH BACK- PROPAGATION

More information

encoding compression encryption

encoding compression encryption encoding compression encryption ASCII utf-8 utf-16 zip mpeg jpeg AES RSA diffie-hellman Expressing characters... ASCII and Unicode, conventions of how characters are expressed in bits. ASCII (7 bits) -

More information

Principles of Evolution - Origin of Species

Principles of Evolution - Origin of Species Theories of Organic Evolution X Multiple Centers of Creation (de Buffon) developed the concept of "centers of creation throughout the world organisms had arisen, which other species had evolved from X

More information