ELFp44 (444<<<<6<6XLL6L6((( Qtd/lib/ld-linux.so.2GNU    b[%B #'0;@ P`Pp/y4#A7JVІ!SoC9h 0@P5u`r libc.so.6putcharstdoutfscanffgetstmpfileputsmallocfflushfprintffseekftelltimestrcmpfgetcfclosefputc__ctype_b_locrewindexitfopen_IO_stdin_used__libc_start_mainfree__gmon_start__GLIBC_2.3GLIBC_2.1GLIBC_2.0ii ii ii 77 4787<7@7D7H7L7P7T7 X7 \7 `7 d7h7l7p7t7x7|77777U 藓5,7%07%47h%87h%<7h%@7h%D7h %H7h(%L7h0%P7h8p%T7h@`%X7hHP%\7hP@%`7hX0%d7h` %h7hh%l7hp%p7hx%t7h%x7h%|7h%7h%7h%7h%7h1^PTRh@hQVhoUS[ËPhtЋ]ÐU=7u)D6tD6ҡD6u7ÉU$7tt h$7ЃÐUWVS 1;=7}UG;=7|1;} }] G;} Q< |EE 9E|> j 1;} }U4G^<;} | 7e[^_ÍvuRVuE]4jM9OWju!3h(1u;>}4M;77thGE;8|̃ hU;:}:uPv6jK v6jG9M;9C0X0|E} 9}hrvUWVSu 7] E|t9w)Q1Ƀ~A7EeM7+E<7L494E7D[^_É)Q1ۃ~C؈7EeM7+E47L<9<UWVS} ]uS(t.C,t'9tQVWRC,t9tӍe[^_ËSvUWVS,UU1}tEEuuO]9ىM}Bvu9~-U S9}؍vN9K~ P9щ|Eu9u|}G]u7 4V7 E $}E80ME1u]܉|Fut GUuGMuE}9}}Wu~EU܍ YE9M}1ϐU؋BNR_WU؃JZ~ _9}|Eu9u|1;}E}=EU܋tM~UF]GEEuG9u|ËM1t]}Fu u`U܉Ue[^_K h~$"UWVS 1;7} E}vB;7|E]tS@[4Bu]EtNs@F(tV,uGMFAMU[4BۉUu͋]t{@[4Gue[^_ÍvxtRWMQPqV,tztPWuVRq듐UWVS ]C(C uS,K,Wuu P uu s,ES,r{(wsE$DEO}UM}u}K< Y<y(q,7t}~?{ t Ee[^_ËM u}7u9Ftً}9GtыE] ǃ{ u7M9Atu9FtE 8uSu0S({,_0r0WK@qV@rj[K$9N$PSuuW5757&-u U7ty7{E=7#E1ۅ7t57N^ɉ 7u}ShR}t~}txEE7t77B Et @EuJuuɉu 7uɃuhl^57uuSuhc `jD7tr`E7<@X;7_GGGGB0}B,B(79Ӊ]s h! h U} th h<777޿.8E޿38E ޿98E;Mu{Au{Fu{u E޹B8Eh hG,v h`]$ $$$$l$$$4  hSY^Sh`Eǃ:E$EMVQhuMpEEvHU:uB<;<  u/qM9 uq8x( uqXXu q8,- ]SUU,8u<@<*tt[ VSXuJXuAoX575uuFVhu uVhuEe[^_à h4듃 h h냉 ]SE C(t S,&EK] @E]MFC9]|19E}u E@9BE|E=79}}_5719}7O7LA|}̺7}xỦz0PQvS@M H06ErS}MP0=7C9vE҉uPE 1ۋ=7q9Aq}1;]tuuz, RMY4^4q4V4N8r8e[^_É1ËB0A0B0H0떉Z,뇍vQ,X h!$vUWVS UrV(ҋ} Et N,HV49tJ(tB,urHt:ӋR49uUZt Ee[^_ËN4 7v0ߍvJ4K4J4Y8J4ur0EHS41돋V49tZ(tJ,u5HuR49uUB99tuV(11UWVS} U 7] * u uuƋEp9}NtˋUP(]r(;EH,}t z,\ H MA}uWPuuVEEU]U]uV(z0C,979XluR uuW7] {uuuuWUR }Wu;Ut!vr4 ]3RM;Uu}t E8 u}WuuuVE]ЋMԋ7]MluN,y0C,9lj}*l9XuQ uuu7] {uuuuWEP URM;UtZ4 }Ru;Uu}t M u]Suu}WEuċUuUuF,P0N(y0Ut @ uɉtȐ@ ‹uutx u9tB }Wu;Ut!J4 uR;];Uue[^_9Eˉt,S(E9ЉUQuuu`؋9uՋ}9t-K(E9ȉMRuuu(؋9uՋ7tR j EPu}uWEM u+MQuVU]U]lj4$ t$uuu]u)] u uV MQ};Uz4 ];RE0;uuS,UC,E` j }WuuuVE} uOW]SUȋM̉UMƉ$E9C( j EPuMuQEf}؃}} uOW]Su܉uzƉ$C(iY(t A,TH}w~(O(V,ɉUt _, EH(t P, jDE}MA,A(] Q4 uY[u}7 XZuVuJNjE5719 W1=79}r 7hd19}97Z4 uRY};Uu 7Q97 h 4C9|PWj uPMQEu x|U19։t}TxF;t| S覵|K~;PSjxP Rjx.7 S^Sx7 uuu|xu 57uW$x$1ۋ579 W1=79}p 7`\19}77uuE0譯]<=757~}1ۃ}*}} j̨7 Q詨M1҉t 79fC@[4FuE7H u=x G;pr4 ]3RM;puZOx Ń ht$襨 hv7z  h ǐ}yuo 7 Q趧]11x 79tBF]y W׫<$o4u* uV}.V h %v Wߧ5 hJ];p;z4 u>R覧M;pu7S97 h h h!1111UU UWVS,}1]h4<M )F~NjE u芥<ئ8fwсfufu _t.u uBU219u},ME4u4աw;uЉ|E؀t} wV膢EE9E}!u܋U؀<2uh]؋M }C9]|1;}|1 u菢Xu膢Xu]XuTEe[^_à U4[GE;8|봃 h!聡$%wPVh*E pUM9}] sQM]E 0Q h돃 h녃 hx h "kUURjuURu uEEU uEÐ B4REeUuߐUWVSH(t p,HuVs(XZEPs,] %}C(t S,J8H(t p,HEEEԋX]S({,r0O0}>UM9X(9]E]O(9ΉPEH@qw@vj;G@yPjSUr Mq0?}G0҉EN09Mq(9MEt9juXZjEp0EP(t x,HtM uxMttQ,uhtЋC(9EtRp(tH,u@Hu j t }xE딃 hڎ j}1C,11c] vY,QjP]sWjVEpPju؋}wv_,H@,E0ju`U:ux3C(t{,u\F(9tCX(tH,u1H j}x0Ey1ЋF,1PjRUrqjuWPjVuv̓ hr_uXs@hSS(uM{,uFu$ ss@S0rsh"軍 Lss@pK0qsh"׋C0t"ss spsh$#t S(u8ss@s,vrshd#Is(Xs,Qss@p{,wrsh#ōvC,x(t P,H uبE܃tu܃ ~4V}M܃uK(tS,ukHtZUtK,uHHt t&Zuu e[^_à R蛌 hɋXv1빋Uu1떍v1?11 u}܃tM܃ A4QE.U܃uUu1j ZR]UuދC,x(tP,u1H9 j$"MHE4111vUEH(tP,uÐ1UVu1St4V(tF,u0Jt v(Yv,e[^Ív1UWVS ]} ut6C(u K,tt,K,t%PVWs([,ЋSe[^_à h$赊USP]S(t1S,t*S4rK8qsh %eYs8[4ȋ]ÍvUE;E }E UE;E ~E UW}VSuE] Ӌ] |O]TW(tO,ubHtP ]uCSVu w(U M ‹|AuSVRw,zEU ڋ|Ce[^_É1UWVS57E9uE}M7U57B9U|E79EvU)E}O9]UM]}XE܋]ƺ7E <}E7ڋ}9A]]S(CC tS,u(Ht C0s([,뾋]Ð1UVS]thS(tS,u^HtR s(Xs,9}Ƌ҉t"K0tB0t u C e[^É11UWVS ]t7S(t C,Ht s(^s,{ t e[^_Ðs({0t v(Yv,v4$Ƃs,t v(YZv,P4$蠂w(t v(3Xv,*4$zw,t v( Xv,4$TSWC,C(_0SG,G(/1UWVS } 19u}vTuC9|ue[^_J LR؁Lɉu͐UWVS 179֋}}6t*H8A4tS4ۉu& ɉu7F9|ʉ}e[^_kv s(Xs,$L빍vUVS]u 1;t9[^Ð@tA9utщUMS] 1;t@t1[Ã;G9P wt9>O 9Q w u XYHE PpUvZuv}rtE8}bt}Gbe[^_ËE8t_ 9{r^{b^ {buFr}bt맀{btHEt5E;xt%E܃ PWVGbCbk ܃ h8Ӄ O QW BbFrZ 뗋^ 댋7ut;U;zt)E܃ PHCbGrM܉ w -Ѓ փ h8͋w~rt}V zbum^{b{bt9҉Ut&U;z tE܃ PЃ h8 _SOAbFrY릋^뛉ɉMt9E;x t)E܃ PFbGr]܉7wI ؃ h89Љut9 VvUzt4$rt}r3u>MAUMSS BC Z$ÉUMSSB CZ $ÉUSjNsã81t#U R/sC8Pu 1]É8@@ @bUWVS}8WR58vW ^MSQuiu'USRXuWHtv븋v 1;58e[^_USP];8t, s XsXsr]]r]ÍvUSQ889t- s ZsXsr$r8 prX58r]ÍvUVu;58StXVrt4 v XvKt 1e[^ÐJuN yrtruVzruэvɐUVu;58StL v Yvtt9tRPSh&q1e[^À~btCUWVS 8;8 s vZskt t9WPVh&+q1Wh*&q58;58tgVrtC v [vKt1҅t u1e[^_ÉHu݉N yrtЀruVzruv븀{btf~^TUjoƒ1t H6JH6ÍvUSPH6ۋEtB9t [t59ut- joƒ1tM J]É1UH6Ut 9t @t9ut 1USQH6ҋEt69t Rt)9ut! 1u]ËA Qo1UH6Ut 9t @t9ut 1t1UH6VSUH6t9tAqt9ut ue[^Ð K 3o$ou҉UWVS H6ɋuEH6H6t9tBzt9utuHt9t];GEGt9uuue[^_ËJ}Ue[^_vn K 3cn$[n u܋ H6UWVS ["l)19sאF9r [^_UVS[)ɍqu :[^ÉNuUSR77t ЋuX[US[wRm]( %s ) dummyOut of memoryerror in tree childrenheuristic option: %d%d%d File %s or %s has errors. Solving the %d-th problem: Hybridization number: %d Number of solutions: %d Total time: %ld rSPR distance: %d error: isolatedrSPRDist is: %d Time: %ld Out of memory 13Error in file %s Out of memory. 12Out of memory. 11File %s is empty MAAFMAAFsrSPRDistMAFsbad option.okay? Y(yes)%cunknown error.unknown error2.Bad expression 8.%d %d Bad expression 7.Bad expression 6.Bad expression 4.Bad expression 3.Bad expression 2.Bad expression 1.Empty expression.Out of memory.#H%d%serror in the direct arrayOut of memory 15found a unifurcate node.Too long solution.inconsistent hybNum.Out of memory. 14inconsistent rSPR distance.rOut of memory 24Out of memory 23Out of memory 22Unifurcate tree.nodes in tree 0: %d Empty forests. check tree %d in forest %d: address is %p Out of memory 1000.error in tree children 2error in tree children 1inconsistant tip list 2inconsistant tip listCreate graph: %d: %d has children %d, %d leaf %d and mate %d #leaves 1: %d #leaves 2: %d bad specification of heuristics.Usage: FastHN tree1.newick tree2.newick Option [Heuristic]1. Save the file FastHN.exe in a folder (say, folderA);2. Run cmd.exe and use the "cd" command to move to "folderA";3. Create two files (say, t1.txt and t2.txt) each containing a tree in Newick format;4. Save the files (t1.txt and t2.txt) in "folderA";5. Type "FastHN t1.txt t2.txt Option [Heuristic]" in the command line, where Option is a string in {HN, MAAF, MAAFs, rSPRDist, MAF, MAFs} and Heuristic is either a string in {000, 001, ..., 111} or omitted.Failed to initialize the stack.Too long or too short solution.Already memorized one solution.failed to insert a datum in the data structureTree 1 is not a tree. Leaf: %d About to cut the dummy node off Tree 1.Tree 2 is not a tree. Leaf: %d About to cut off the dummy in Tree 2 (2)About to cut off the dummy in Tree 2 (1)Forest 2 is inconsistent with Tree 1.The two trees do not have the same leaf sets.Failed to open a necessary filewrong number of non-root and non-leaf nodes.#nodes in tree 0: %d, #nodes in tree 1: %d, size is %d. Root leaf %d with mate %d, origin %p, and debug %d Non-root leaf %d with mate %d, parent %d, origin %p, and debug %d internal node %d with mate %d, max %d, min %d, and debug %d Root %d has children %d, %d, origin %p, and debug %d %d has children %d, %d , parent %d, origin %p, and debug %d ********** Start of Solution %d ********* The leaf sets of the trees in an MAAF:********** End of Solution %d ********** The extended Newick representation of a network (constructed from the MAAF) with the minimum number of reticulation vertices is: The leaf sets of the trees in an MAF:%d has left child %d and right child %d %d has children %d from tree %d, %d from tree %d and type %d, debug %d from Tree %dleaf %d with mate %d and debug %d, type %d from Tree %d leaf %d and debug %d, type %d from Tree %d *******The %d-th problem:****** left: %d right: %d depth: %d 7 ؅ H (7 oЄooL6&6FVfvƆֆ&6FVfGCC: (GNU) 3.2.3 20030502 (Red Hat Linux 3.2.3-58)GCC: (GNU) 3.2.3 20030502 (Red Hat Linux 3.2.3-58)GCC: (GNU) 3.2.3 20030502 (Red Hat Linux 3.2.3-59)GCC: (GNU) 3.2.3 20030502 (Red Hat Linux 3.2.3-59)GCC: (GNU) 3.2.3 20030502 (Red Hat Linux 3.2.3-59)GCC: (GNU) 3.2.3 20030502 (Red Hat Linux 3.2.3-59)GCC: (GNU) 3.2.3 20030502 (Red Hat Linux 3.2.3-59)GCC: (GNU) 3.2.3 20030502 (Red Hat Linux 3.2.3-58).symtab.strtab.shstrtab.interp.note.ABI-tag.hash.dynsym.dynstr.gnu.version.gnu.version_r.rel.dyn.rel.plt.init.text.fini.rodata.eh_frame.data.dynamic.ctors.dtors.jcr.got.bss.comment#(( 1HH7 ?Go6ToЄ@c l    u؅p{pp8ęq 8&8<6<L6L77$7$(7(l7x4< D ܻ(HЄ  ؅  p  8&<6L677$7(77 7*788&K$7XD6\7h ~ 7 78&$7 77777 7777 !7)72787B7I7O7[7b7f7m88H6  DE  d P |E   x    4T *w 2~ BL6Kx W o aA h$3 uo % #0@ <6\. (A c i $@610 <0c E M@D ] & j0 sP| ,. F ` p$| f   y؅ < O XL 9 -#?APp Z < gī s`] yI  7H v   w \ 5  Іp  *\  6SGxO Q \ k<] uQ    4^  <6H @ 7   %<66 t BH  N Rhc ` W h<6 s w  9     4 U U 8 <6L 0.3 47;(7Q@a 8fL  p P5 L <6  l   1    X W P <6 D *\I 5^ ? S`rlj {$S  <6U  1  - call_gmon_startcrtstuff.c__CTOR_LIST____DTOR_LIST____EH_FRAME_BEGIN____JCR_LIST__p.0completed.1__do_global_dtors_auxframe_dummy__CTOR_END____DTOR_END____FRAME_END____JCR_END____do_global_ctors_auxbioInfo4_op4.carraySizehqleaveswordListfirstAppeartotal2MetourflagstipDistnumTreestotallog_totaldirectstartglobalProbPgBoundendbufferredblackstructure2.cheadsentrystackstructure2.cfindAllTipsequalfindClusters2fgetc@@GLIBC_2.0clusterReducenumLeafDesccheckMatrixisLeafcleanUp2rotateRsearchsortAllclearFieldscutMoreoutputSolutions_DYNAMICmoveSubTreegetLeavesclear2isStackEmptycheckColor2strcmp@@GLIBC_2.0_fp_hwfprintf@@GLIBC_2.0tmpfile@@GLIBC_2.1fflush@@GLIBC_2.0cutLeafInTree1__fini_array_endcopyForestPairpostOrder2reduceForestdist2roots__dso_handlereadInDatacalBlackrotateL__libc_csu_finifreeIsolatedrSPRDistputchar@@GLIBC_2.0highMatchNodesDFSlessrewind@@GLIBC_2.0cleanUpftell@@GLIBC_2.0matchNodesclearStackdistanceputs@@GLIBC_2.0_initcopyIsolatedsPopfreeMatrixmalloc@@GLIBC_2.0fscanf@@GLIBC_2.0scanf@@GLIBC_2.0partitionshowProblemscopySubTreeclearquickSort2cutNodeInTree2stdout@@GLIBC_2.0checkForestsdisconnectcheckreadInNewickcreateMatrixfseek@@GLIBC_2.0freeMemoryreduceClustertime@@GLIBC_2.0_startcreateGraphdistanceMaffgets@@GLIBC_2.0dist2rootcopyTree2BprintExtNewickapproxMafconnectedComponentmaxmoveIsolatedinitcutLeafInTree2__fini_array_startfputc@@GLIBC_2.0__libc_csu_initdeleteStack__bss_startmaineulerTour__libc_start_main@@GLIBC_2.0__init_array_endgetAllNodesfindNextTipkeycleanProblemstipTypedata_startminfindRootprintf@@GLIBC_2.0_finifindClustersfclose@@GLIBC_2.1cutOffIdenticalprintGraphcreateProblemcheckCopiedTree1preprocess__preinit_array_endfindTipInTreeexit@@GLIBC_2.0sPeek_edata_GLOBAL_OFFSET_TABLE_free@@GLIBC_2.0_endcopyTree2checkCopiedTree2fopen@@GLIBC_2.1lca_feliminate__init_array_startinsert_IO_stdin_usedcopyTreeBcheckColorfreeSolutionconstructNetsPushrSPRDist2copyTree__data_startnextTokenpartition2quickSort_Jv_RegisterClasses__ctype_b_loc@@GLIBC_2.3rangeMinSearchclearGraphcomputeM__preinit_array_startconnectedComponent2moveIsolatedMafinitStack__gmon_start__setKey