# HG changeset patch # User vmarcon # Date 1516280193 18000 # Node ID dc678d2c1976c299306d62bfd4c7fce45ccb1c57 planemo upload commit a2411926bebc2ca3bb31215899a9f18a67e59556 diff -r 000000000000 -r dc678d2c1976 LICENSE --- /dev/null Thu Jan 01 00:00:00 1970 +0000 +++ b/LICENSE Thu Jan 18 07:56:33 2018 -0500 @@ -0,0 +1,674 @@ + GNU GENERAL PUBLIC LICENSE + Version 3, 29 June 2007 + + Copyright (C) 2007 Free Software Foundation, Inc. + Everyone is permitted to copy and distribute verbatim copies + of this license document, but changing it is not allowed. + + Preamble + + The GNU General Public License is a free, copyleft license for +software and other kinds of works. + + The licenses for most software and other practical works are designed +to take away your freedom to share and change the works. By contrast, +the GNU General Public License is intended to guarantee your freedom to +share and change all versions of a program--to make sure it remains free +software for all its users. We, the Free Software Foundation, use the +GNU General Public License for most of our software; it applies also to +any other work released this way by its authors. You can apply it to +your programs, too. + + When we speak of free software, we are referring to freedom, not +price. Our General Public Licenses are designed to make sure that you +have the freedom to distribute copies of free software (and charge for +them if you wish), that you receive source code or can get it if you +want it, that you can change the software or use pieces of it in new +free programs, and that you know you can do these things. + + To protect your rights, we need to prevent others from denying you +these rights or asking you to surrender the rights. Therefore, you have +certain responsibilities if you distribute copies of the software, or if +you modify it: responsibilities to respect the freedom of others. + + For example, if you distribute copies of such a program, whether +gratis or for a fee, you must pass on to the recipients the same +freedoms that you received. You must make sure that they, too, receive +or can get the source code. And you must show them these terms so they +know their rights. + + Developers that use the GNU GPL protect your rights with two steps: +(1) assert copyright on the software, and (2) offer you this License +giving you legal permission to copy, distribute and/or modify it. + + For the developers' and authors' protection, the GPL clearly explains +that there is no warranty for this free software. For both users' and +authors' sake, the GPL requires that modified versions be marked as +changed, so that their problems will not be attributed erroneously to +authors of previous versions. + + Some devices are designed to deny users access to install or run +modified versions of the software inside them, although the manufacturer +can do so. This is fundamentally incompatible with the aim of +protecting users' freedom to change the software. The systematic +pattern of such abuse occurs in the area of products for individuals to +use, which is precisely where it is most unacceptable. Therefore, we +have designed this version of the GPL to prohibit the practice for those +products. If such problems arise substantially in other domains, we +stand ready to extend this provision to those domains in future versions +of the GPL, as needed to protect the freedom of users. + + Finally, every program is threatened constantly by software patents. +States should not allow patents to restrict development and use of +software on general-purpose computers, but in those that do, we wish to +avoid the special danger that patents applied to a free program could +make it effectively proprietary. To prevent this, the GPL assures that +patents cannot be used to render the program non-free. + + The precise terms and conditions for copying, distribution and +modification follow. + + TERMS AND CONDITIONS + + 0. Definitions. + + "This License" refers to version 3 of the GNU General Public License. + + "Copyright" also means copyright-like laws that apply to other kinds of +works, such as semiconductor masks. + + "The Program" refers to any copyrightable work licensed under this +License. Each licensee is addressed as "you". "Licensees" and +"recipients" may be individuals or organizations. + + To "modify" a work means to copy from or adapt all or part of the work +in a fashion requiring copyright permission, other than the making of an +exact copy. The resulting work is called a "modified version" of the +earlier work or a work "based on" the earlier work. + + A "covered work" means either the unmodified Program or a work based +on the Program. + + To "propagate" a work means to do anything with it that, without +permission, would make you directly or secondarily liable for +infringement under applicable copyright law, except executing it on a +computer or modifying a private copy. Propagation includes copying, +distribution (with or without modification), making available to the +public, and in some countries other activities as well. + + To "convey" a work means any kind of propagation that enables other +parties to make or receive copies. Mere interaction with a user through +a computer network, with no transfer of a copy, is not conveying. + + An interactive user interface displays "Appropriate Legal Notices" +to the extent that it includes a convenient and prominently visible +feature that (1) displays an appropriate copyright notice, and (2) +tells the user that there is no warranty for the work (except to the +extent that warranties are provided), that licensees may convey the +work under this License, and how to view a copy of this License. If +the interface presents a list of user commands or options, such as a +menu, a prominent item in the list meets this criterion. + + 1. Source Code. + + The "source code" for a work means the preferred form of the work +for making modifications to it. "Object code" means any non-source +form of a work. + + A "Standard Interface" means an interface that either is an official +standard defined by a recognized standards body, or, in the case of +interfaces specified for a particular programming language, one that +is widely used among developers working in that language. + + The "System Libraries" of an executable work include anything, other +than the work as a whole, that (a) is included in the normal form of +packaging a Major Component, but which is not part of that Major +Component, and (b) serves only to enable use of the work with that +Major Component, or to implement a Standard Interface for which an +implementation is available to the public in source code form. A +"Major Component", in this context, means a major essential component +(kernel, window system, and so on) of the specific operating system +(if any) on which the executable work runs, or a compiler used to +produce the work, or an object code interpreter used to run it. + + The "Corresponding Source" for a work in object code form means all +the source code needed to generate, install, and (for an executable +work) run the object code and to modify the work, including scripts to +control those activities. However, it does not include the work's +System Libraries, or general-purpose tools or generally available free +programs which are used unmodified in performing those activities but +which are not part of the work. For example, Corresponding Source +includes interface definition files associated with source files for +the work, and the source code for shared libraries and dynamically +linked subprograms that the work is specifically designed to require, +such as by intimate data communication or control flow between those +subprograms and other parts of the work. + + The Corresponding Source need not include anything that users +can regenerate automatically from other parts of the Corresponding +Source. + + The Corresponding Source for a work in source code form is that +same work. + + 2. Basic Permissions. + + All rights granted under this License are granted for the term of +copyright on the Program, and are irrevocable provided the stated +conditions are met. This License explicitly affirms your unlimited +permission to run the unmodified Program. The output from running a +covered work is covered by this License only if the output, given its +content, constitutes a covered work. This License acknowledges your +rights of fair use or other equivalent, as provided by copyright law. + + You may make, run and propagate covered works that you do not +convey, without conditions so long as your license otherwise remains +in force. You may convey covered works to others for the sole purpose +of having them make modifications exclusively for you, or provide you +with facilities for running those works, provided that you comply with +the terms of this License in conveying all material for which you do +not control copyright. Those thus making or running the covered works +for you must do so exclusively on your behalf, under your direction +and control, on terms that prohibit them from making any copies of +your copyrighted material outside their relationship with you. + + Conveying under any other circumstances is permitted solely under +the conditions stated below. Sublicensing is not allowed; section 10 +makes it unnecessary. + + 3. Protecting Users' Legal Rights From Anti-Circumvention Law. + + No covered work shall be deemed part of an effective technological +measure under any applicable law fulfilling obligations under article +11 of the WIPO copyright treaty adopted on 20 December 1996, or +similar laws prohibiting or restricting circumvention of such +measures. + + When you convey a covered work, you waive any legal power to forbid +circumvention of technological measures to the extent such circumvention +is effected by exercising rights under this License with respect to +the covered work, and you disclaim any intention to limit operation or +modification of the work as a means of enforcing, against the work's +users, your or third parties' legal rights to forbid circumvention of +technological measures. + + 4. Conveying Verbatim Copies. + + You may convey verbatim copies of the Program's source code as you +receive it, in any medium, provided that you conspicuously and +appropriately publish on each copy an appropriate copyright notice; +keep intact all notices stating that this License and any +non-permissive terms added in accord with section 7 apply to the code; +keep intact all notices of the absence of any warranty; and give all +recipients a copy of this License along with the Program. + + You may charge any price or no price for each copy that you convey, +and you may offer support or warranty protection for a fee. + + 5. Conveying Modified Source Versions. + + You may convey a work based on the Program, or the modifications to +produce it from the Program, in the form of source code under the +terms of section 4, provided that you also meet all of these conditions: + + a) The work must carry prominent notices stating that you modified + it, and giving a relevant date. + + b) The work must carry prominent notices stating that it is + released under this License and any conditions added under section + 7. This requirement modifies the requirement in section 4 to + "keep intact all notices". + + c) You must license the entire work, as a whole, under this + License to anyone who comes into possession of a copy. This + License will therefore apply, along with any applicable section 7 + additional terms, to the whole of the work, and all its parts, + regardless of how they are packaged. This License gives no + permission to license the work in any other way, but it does not + invalidate such permission if you have separately received it. + + d) If the work has interactive user interfaces, each must display + Appropriate Legal Notices; however, if the Program has interactive + interfaces that do not display Appropriate Legal Notices, your + work need not make them do so. + + A compilation of a covered work with other separate and independent +works, which are not by their nature extensions of the covered work, +and which are not combined with it such as to form a larger program, +in or on a volume of a storage or distribution medium, is called an +"aggregate" if the compilation and its resulting copyright are not +used to limit the access or legal rights of the compilation's users +beyond what the individual works permit. Inclusion of a covered work +in an aggregate does not cause this License to apply to the other +parts of the aggregate. + + 6. Conveying Non-Source Forms. + + You may convey a covered work in object code form under the terms +of sections 4 and 5, provided that you also convey the +machine-readable Corresponding Source under the terms of this License, +in one of these ways: + + a) Convey the object code in, or embodied in, a physical product + (including a physical distribution medium), accompanied by the + Corresponding Source fixed on a durable physical medium + customarily used for software interchange. + + b) Convey the object code in, or embodied in, a physical product + (including a physical distribution medium), accompanied by a + written offer, valid for at least three years and valid for as + long as you offer spare parts or customer support for that product + model, to give anyone who possesses the object code either (1) a + copy of the Corresponding Source for all the software in the + product that is covered by this License, on a durable physical + medium customarily used for software interchange, for a price no + more than your reasonable cost of physically performing this + conveying of source, or (2) access to copy the + Corresponding Source from a network server at no charge. + + c) Convey individual copies of the object code with a copy of the + written offer to provide the Corresponding Source. This + alternative is allowed only occasionally and noncommercially, and + only if you received the object code with such an offer, in accord + with subsection 6b. + + d) Convey the object code by offering access from a designated + place (gratis or for a charge), and offer equivalent access to the + Corresponding Source in the same way through the same place at no + further charge. You need not require recipients to copy the + Corresponding Source along with the object code. If the place to + copy the object code is a network server, the Corresponding Source + may be on a different server (operated by you or a third party) + that supports equivalent copying facilities, provided you maintain + clear directions next to the object code saying where to find the + Corresponding Source. Regardless of what server hosts the + Corresponding Source, you remain obligated to ensure that it is + available for as long as needed to satisfy these requirements. + + e) Convey the object code using peer-to-peer transmission, provided + you inform other peers where the object code and Corresponding + Source of the work are being offered to the general public at no + charge under subsection 6d. + + A separable portion of the object code, whose source code is excluded +from the Corresponding Source as a System Library, need not be +included in conveying the object code work. + + A "User Product" is either (1) a "consumer product", which means any +tangible personal property which is normally used for personal, family, +or household purposes, or (2) anything designed or sold for incorporation +into a dwelling. In determining whether a product is a consumer product, +doubtful cases shall be resolved in favor of coverage. For a particular +product received by a particular user, "normally used" refers to a +typical or common use of that class of product, regardless of the status +of the particular user or of the way in which the particular user +actually uses, or expects or is expected to use, the product. A product +is a consumer product regardless of whether the product has substantial +commercial, industrial or non-consumer uses, unless such uses represent +the only significant mode of use of the product. + + "Installation Information" for a User Product means any methods, +procedures, authorization keys, or other information required to install +and execute modified versions of a covered work in that User Product from +a modified version of its Corresponding Source. The information must +suffice to ensure that the continued functioning of the modified object +code is in no case prevented or interfered with solely because +modification has been made. + + If you convey an object code work under this section in, or with, or +specifically for use in, a User Product, and the conveying occurs as +part of a transaction in which the right of possession and use of the +User Product is transferred to the recipient in perpetuity or for a +fixed term (regardless of how the transaction is characterized), the +Corresponding Source conveyed under this section must be accompanied +by the Installation Information. But this requirement does not apply +if neither you nor any third party retains the ability to install +modified object code on the User Product (for example, the work has +been installed in ROM). + + The requirement to provide Installation Information does not include a +requirement to continue to provide support service, warranty, or updates +for a work that has been modified or installed by the recipient, or for +the User Product in which it has been modified or installed. Access to a +network may be denied when the modification itself materially and +adversely affects the operation of the network or violates the rules and +protocols for communication across the network. + + Corresponding Source conveyed, and Installation Information provided, +in accord with this section must be in a format that is publicly +documented (and with an implementation available to the public in +source code form), and must require no special password or key for +unpacking, reading or copying. + + 7. Additional Terms. + + "Additional permissions" are terms that supplement the terms of this +License by making exceptions from one or more of its conditions. +Additional permissions that are applicable to the entire Program shall +be treated as though they were included in this License, to the extent +that they are valid under applicable law. If additional permissions +apply only to part of the Program, that part may be used separately +under those permissions, but the entire Program remains governed by +this License without regard to the additional permissions. + + When you convey a copy of a covered work, you may at your option +remove any additional permissions from that copy, or from any part of +it. (Additional permissions may be written to require their own +removal in certain cases when you modify the work.) You may place +additional permissions on material, added by you to a covered work, +for which you have or can give appropriate copyright permission. + + Notwithstanding any other provision of this License, for material you +add to a covered work, you may (if authorized by the copyright holders of +that material) supplement the terms of this License with terms: + + a) Disclaiming warranty or limiting liability differently from the + terms of sections 15 and 16 of this License; or + + b) Requiring preservation of specified reasonable legal notices or + author attributions in that material or in the Appropriate Legal + Notices displayed by works containing it; or + + c) Prohibiting misrepresentation of the origin of that material, or + requiring that modified versions of such material be marked in + reasonable ways as different from the original version; or + + d) Limiting the use for publicity purposes of names of licensors or + authors of the material; or + + e) Declining to grant rights under trademark law for use of some + trade names, trademarks, or service marks; or + + f) Requiring indemnification of licensors and authors of that + material by anyone who conveys the material (or modified versions of + it) with contractual assumptions of liability to the recipient, for + any liability that these contractual assumptions directly impose on + those licensors and authors. + + All other non-permissive additional terms are considered "further +restrictions" within the meaning of section 10. If the Program as you +received it, or any part of it, contains a notice stating that it is +governed by this License along with a term that is a further +restriction, you may remove that term. If a license document contains +a further restriction but permits relicensing or conveying under this +License, you may add to a covered work material governed by the terms +of that license document, provided that the further restriction does +not survive such relicensing or conveying. + + If you add terms to a covered work in accord with this section, you +must place, in the relevant source files, a statement of the +additional terms that apply to those files, or a notice indicating +where to find the applicable terms. + + Additional terms, permissive or non-permissive, may be stated in the +form of a separately written license, or stated as exceptions; +the above requirements apply either way. + + 8. Termination. + + You may not propagate or modify a covered work except as expressly +provided under this License. Any attempt otherwise to propagate or +modify it is void, and will automatically terminate your rights under +this License (including any patent licenses granted under the third +paragraph of section 11). + + However, if you cease all violation of this License, then your +license from a particular copyright holder is reinstated (a) +provisionally, unless and until the copyright holder explicitly and +finally terminates your license, and (b) permanently, if the copyright +holder fails to notify you of the violation by some reasonable means +prior to 60 days after the cessation. + + Moreover, your license from a particular copyright holder is +reinstated permanently if the copyright holder notifies you of the +violation by some reasonable means, this is the first time you have +received notice of violation of this License (for any work) from that +copyright holder, and you cure the violation prior to 30 days after +your receipt of the notice. + + Termination of your rights under this section does not terminate the +licenses of parties who have received copies or rights from you under +this License. If your rights have been terminated and not permanently +reinstated, you do not qualify to receive new licenses for the same +material under section 10. + + 9. Acceptance Not Required for Having Copies. + + You are not required to accept this License in order to receive or +run a copy of the Program. Ancillary propagation of a covered work +occurring solely as a consequence of using peer-to-peer transmission +to receive a copy likewise does not require acceptance. However, +nothing other than this License grants you permission to propagate or +modify any covered work. These actions infringe copyright if you do +not accept this License. Therefore, by modifying or propagating a +covered work, you indicate your acceptance of this License to do so. + + 10. Automatic Licensing of Downstream Recipients. + + Each time you convey a covered work, the recipient automatically +receives a license from the original licensors, to run, modify and +propagate that work, subject to this License. You are not responsible +for enforcing compliance by third parties with this License. + + An "entity transaction" is a transaction transferring control of an +organization, or substantially all assets of one, or subdividing an +organization, or merging organizations. If propagation of a covered +work results from an entity transaction, each party to that +transaction who receives a copy of the work also receives whatever +licenses to the work the party's predecessor in interest had or could +give under the previous paragraph, plus a right to possession of the +Corresponding Source of the work from the predecessor in interest, if +the predecessor has it or can get it with reasonable efforts. + + You may not impose any further restrictions on the exercise of the +rights granted or affirmed under this License. For example, you may +not impose a license fee, royalty, or other charge for exercise of +rights granted under this License, and you may not initiate litigation +(including a cross-claim or counterclaim in a lawsuit) alleging that +any patent claim is infringed by making, using, selling, offering for +sale, or importing the Program or any portion of it. + + 11. Patents. + + A "contributor" is a copyright holder who authorizes use under this +License of the Program or a work on which the Program is based. The +work thus licensed is called the contributor's "contributor version". + + A contributor's "essential patent claims" are all patent claims +owned or controlled by the contributor, whether already acquired or +hereafter acquired, that would be infringed by some manner, permitted +by this License, of making, using, or selling its contributor version, +but do not include claims that would be infringed only as a +consequence of further modification of the contributor version. For +purposes of this definition, "control" includes the right to grant +patent sublicenses in a manner consistent with the requirements of +this License. + + Each contributor grants you a non-exclusive, worldwide, royalty-free +patent license under the contributor's essential patent claims, to +make, use, sell, offer for sale, import and otherwise run, modify and +propagate the contents of its contributor version. + + In the following three paragraphs, a "patent license" is any express +agreement or commitment, however denominated, not to enforce a patent +(such as an express permission to practice a patent or covenant not to +sue for patent infringement). To "grant" such a patent license to a +party means to make such an agreement or commitment not to enforce a +patent against the party. + + If you convey a covered work, knowingly relying on a patent license, +and the Corresponding Source of the work is not available for anyone +to copy, free of charge and under the terms of this License, through a +publicly available network server or other readily accessible means, +then you must either (1) cause the Corresponding Source to be so +available, or (2) arrange to deprive yourself of the benefit of the +patent license for this particular work, or (3) arrange, in a manner +consistent with the requirements of this License, to extend the patent +license to downstream recipients. "Knowingly relying" means you have +actual knowledge that, but for the patent license, your conveying the +covered work in a country, or your recipient's use of the covered work +in a country, would infringe one or more identifiable patents in that +country that you have reason to believe are valid. + + If, pursuant to or in connection with a single transaction or +arrangement, you convey, or propagate by procuring conveyance of, a +covered work, and grant a patent license to some of the parties +receiving the covered work authorizing them to use, propagate, modify +or convey a specific copy of the covered work, then the patent license +you grant is automatically extended to all recipients of the covered +work and works based on it. + + A patent license is "discriminatory" if it does not include within +the scope of its coverage, prohibits the exercise of, or is +conditioned on the non-exercise of one or more of the rights that are +specifically granted under this License. You may not convey a covered +work if you are a party to an arrangement with a third party that is +in the business of distributing software, under which you make payment +to the third party based on the extent of your activity of conveying +the work, and under which the third party grants, to any of the +parties who would receive the covered work from you, a discriminatory +patent license (a) in connection with copies of the covered work +conveyed by you (or copies made from those copies), or (b) primarily +for and in connection with specific products or compilations that +contain the covered work, unless you entered into that arrangement, +or that patent license was granted, prior to 28 March 2007. + + Nothing in this License shall be construed as excluding or limiting +any implied license or other defenses to infringement that may +otherwise be available to you under applicable patent law. + + 12. No Surrender of Others' Freedom. + + If conditions are imposed on you (whether by court order, agreement or +otherwise) that contradict the conditions of this License, they do not +excuse you from the conditions of this License. If you cannot convey a +covered work so as to satisfy simultaneously your obligations under this +License and any other pertinent obligations, then as a consequence you may +not convey it at all. For example, if you agree to terms that obligate you +to collect a royalty for further conveying from those to whom you convey +the Program, the only way you could satisfy both those terms and this +License would be to refrain entirely from conveying the Program. + + 13. Use with the GNU Affero General Public License. + + Notwithstanding any other provision of this License, you have +permission to link or combine any covered work with a work licensed +under version 3 of the GNU Affero General Public License into a single +combined work, and to convey the resulting work. The terms of this +License will continue to apply to the part which is the covered work, +but the special requirements of the GNU Affero General Public License, +section 13, concerning interaction through a network will apply to the +combination as such. + + 14. Revised Versions of this License. + + The Free Software Foundation may publish revised and/or new versions of +the GNU General Public License from time to time. Such new versions will +be similar in spirit to the present version, but may differ in detail to +address new problems or concerns. + + Each version is given a distinguishing version number. If the +Program specifies that a certain numbered version of the GNU General +Public License "or any later version" applies to it, you have the +option of following the terms and conditions either of that numbered +version or of any later version published by the Free Software +Foundation. If the Program does not specify a version number of the +GNU General Public License, you may choose any version ever published +by the Free Software Foundation. + + If the Program specifies that a proxy can decide which future +versions of the GNU General Public License can be used, that proxy's +public statement of acceptance of a version permanently authorizes you +to choose that version for the Program. + + Later license versions may give you additional or different +permissions. However, no additional obligations are imposed on any +author or copyright holder as a result of your choosing to follow a +later version. + + 15. Disclaimer of Warranty. + + THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY +APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT +HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY +OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, +THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR +PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM +IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF +ALL NECESSARY SERVICING, REPAIR OR CORRECTION. + + 16. Limitation of Liability. + + IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING +WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS +THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY +GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE +USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF +DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD +PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS), +EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF +SUCH DAMAGES. + + 17. Interpretation of Sections 15 and 16. + + If the disclaimer of warranty and limitation of liability provided +above cannot be given local legal effect according to their terms, +reviewing courts shall apply local law that most closely approximates +an absolute waiver of all civil liability in connection with the +Program, unless a warranty or assumption of liability accompanies a +copy of the Program in return for a fee. + + END OF TERMS AND CONDITIONS + + How to Apply These Terms to Your New Programs + + If you develop a new program, and you want it to be of the greatest +possible use to the public, the best way to achieve this is to make it +free software which everyone can redistribute and change under these terms. + + To do so, attach the following notices to the program. It is safest +to attach them to the start of each source file to most effectively +state the exclusion of warranty; and each file should have at least +the "copyright" line and a pointer to where the full notice is found. + + {one line to give the program's name and a brief idea of what it does.} + Copyright (C) {year} {name of author} + + This program is free software: you can redistribute it and/or modify + it under the terms of the GNU General Public License as published by + the Free Software Foundation, either version 3 of the License, or + (at your option) any later version. + + This program is distributed in the hope that it will be useful, + but WITHOUT ANY WARRANTY; without even the implied warranty of + MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the + GNU General Public License for more details. + + You should have received a copy of the GNU General Public License + along with this program. If not, see . + +Also add information on how to contact you by electronic and paper mail. + + If the program does terminal interaction, make it output a short +notice like this when it starts in an interactive mode: + + {project} Copyright (C) {year} {fullname} + This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'. + This is free software, and you are welcome to redistribute it + under certain conditions; type `show c' for details. + +The hypothetical commands `show w' and `show c' should show the appropriate +parts of the General Public License. Of course, your program's commands +might be different; for a GUI interface, you would use an "about box". + + You should also get your employer (if you work as a programmer) or school, +if any, to sign a "copyright disclaimer" for the program, if necessary. +For more information on this, and how to apply and follow the GNU GPL, see +. + + The GNU General Public License does not permit incorporating your program +into proprietary programs. If your program is a subroutine library, you +may consider it more useful to permit linking proprietary applications with +the library. If this is what you want to do, use the GNU Lesser General +Public License instead of this License. But first, please read +. diff -r 000000000000 -r dc678d2c1976 h_clust.R --- /dev/null Thu Jan 01 00:00:00 1970 +0000 +++ b/h_clust.R Thu Jan 18 07:56:33 2018 -0500 @@ -0,0 +1,391 @@ +# R Script producing a hierarchical clustering +# Input : a file containing a table with numeric values +# except for the first column containing sample names +# and the first line containing variable names +# separator expected is +# +# Clustering method : +# euclidean, correlation, ... +# +# Ouptut : a file containing the image of the clustering +#----------------------------------------------------------------- +# Authors : sophie.lamarre(at)insa-toulouse.fr +# ignacio.gonzalez(at)toulouse.inra.fr +# luc.jouneau(at)inra.fr +# valentin.marcon(at)inra.fr +# Version : 0.9 +# Date : 13/3/2017 + +# The function ------------------------------------- +#--------------------------------------------------- +h_clust <- function(input_file, + group_member_file = NULL, + output_file = "out/myplot", + log_file = "log/H_Clust.html", + format_image_out = "png", + distance_method = "euclidean", + agglomeration_method = "ward", + column_clustering = TRUE, + select = NULL, + plot_title = "", + xlab = "", + ylab = "Height", + width = 7, + height = 7, + ppi = 300, + na_encoding="NA" +) { + + # This function allows to generate hierarchical cluster analysis on a table according to differents parameters. + # It needs a dataset : the table of data and optionally a group_member data to set colored labels. + # It generates a clustering tree graphic from hierarchical clustering. + # + # Parameters : + # - input_file : input_file name + # - group_member_file : input sample/tag group_member_file name + # - output_file : output_file name + # - log_file : log file name + # - format_image_out : graphic format of the output_file. This must be one of "png", "jpeg", "tiff", "pdf" + # - distance_method : the distance measure to be used. This must be one of "euclidean", "correlation", "maximum", "manhattan", "canberra", "binary" or "minkowski" + # - agglomeration_method : the agglomeration_method to be used. This should be one of "ward", "single", "complete", "average", "mcquitty", "median" or "centroid" + # - column_clustering : if TRUE clustering is performed on the columns + # - select : number of top variables to use for clustering, selected by highest row variance. If NULL all the variables are selected + # - plot_title : an overall title for the plot + # - xlab : a title for the x axis + # - ylab : a title for the y axis + # - width : the width of the graphics region in inches + # - height : the height of the graphics region in inches + # - ppi : the nominal resolution in ppi + # - na_encoding : label used to indicate missing values + + library(RColorBrewer) + + #--------------------------------------------------- + # Auxiliary function + #--------------------------------------------------- + insert.blank = function(x) {paste(strsplit(x, "@$§", fixed = TRUE)[[1]], collapse = " ")} + + #--------------------------------------------------- + # Titles + #--------------------------------------------------- + plot_title = insert.blank(plot_title) + xlab = insert.blank(xlab) + ylab = insert.blank(ylab) + + #--------------------------------------------------- + # Read and verify data + #--------------------------------------------------- + #1°) Checks valid for all modules + if (column_clustering) { + variable_in_line=1 + column_use="individual" + line_use="variable" + } else { + variable_in_line=0 + line_use="individual" + column_use="variable" + } + + log_error=function(message="") { + cat("Hierarchical clustering report\n",file=log_file,append=F,sep="") + cat("⚠ An error occurred while trying to read your table.\n
",file=log_file,append=T,sep="") + cat("Please check that:\n
",file=log_file,append=T,sep="") + cat("
    \n",file=log_file,append=T,sep="") + cat("
  • the table you want to process contains the same number of columns for each line
  • \n",file=log_file,append=T,sep="") + cat("
  • the first line of your table is a header line (specifying the name of each ",column_use,")
  • \n",file=log_file,append=T,sep="") + cat("
  • the first column of your table specifies the name of each ",line_use,"
  • \n",file=log_file,append=T,sep="") + cat("
  • both individual and variable names should be unique
  • \n",file=log_file,append=T,sep="") + cat("
  • each value is separated from the other by a TAB character
  • \n",file=log_file,append=T,sep="") + cat("
  • except for first line and first column, table should contain a numeric value
  • \n",file=log_file,append=T,sep="") + cat("
  • this value may contain character '.' as decimal separator or '",na_encoding,"' for missing values
  • \n",file=log_file,append=T,sep="") + cat("
\n",file=log_file,append=T,sep="") + cat("-------
\nError messages recieved :
\n",conditionMessage(message),"\n",file=log_file,append=T,sep="") + cat("\n",file=log_file,append=T,sep="") + q(save="no",status=1) + } + tab_in=tryCatch( + { + tab_in=read.table(file=input_file,sep="\t",header=T,quote="\"",na.strings=na_encoding,check.names=FALSE) + }, + error=function(cond) { + log_error(message=cond) + return(NA) + }, + warning=function(cond) { + log_error(message=cond) + return(NA) + }, + finally={ + #Do nothing special + } + ) + + if (length(dim(tab_in)) != 2 | ncol(tab_in) < 2 | nrow(tab_in) < 2) { + log_error(simpleCondition("The table on which you want to do a clustering must be a data table with at least 2 rows and 2 columns.")) + } + + rn=as.character(tab_in[,1]) + if (length(rn)!=length(unique(rn))) { + duplicated_rownames=table(rn) + duplicated_rownames=duplicated_rownames[duplicated_rownames>1] + duplicated_rownames=names(duplicated_rownames) + if (length(duplicated_rownames)>3) { + duplicated_rownames=c(duplicated_rownames[1:3],"...") + } + duplicated_rownames=paste(duplicated_rownames,collapse=", ") + log_error(simpleCondition( + paste("The table on which you want to do a clustering have duplicated values in the first column (", + line_use," names) - duplicated ",line_use," names : ",duplicated_rownames,sep="") + )) + } + tab=tab_in[,-1] + rownames(tab)=rn + + #Transpose if clustering on columns + if (column_clustering) { + tab=t(tab) + } + + #Check all columns are numeric + tab=as.matrix(tab) + cell.with.na=c() + for (i in 1:ncol(tab)) { + na.v1=is.na(tab[,i]) + na.v2=is.na(as.numeric(tab[,i])) + if (sum(na.v1)!=sum(na.v2)) { + sel=which(na.v1!=na.v2) + sel=sel[1] + value=tab[sel,i] + log_error(simpleCondition( + paste("Column '",colnames(tab)[i],"' of your table contains non numeric values. Please check its content (on line #",sel," : value='",value,"').",sep="") + )) + } + if (length(cell.with.na)==0 & sum(na.v1)!=0) { + cell.with.na=c(i,which(na.v1)[1]) + } + } + + #2°) Check specific to clustering procedure + if (!is.null(group_member_file)) { + group_member <- read.table(group_member_file, header = FALSE,sep="\t") + #pour l'instant, on prend la première colonne du fichier de groupe + if (length(dim(group_member))==2) { + ncol_group_file=ncol(group_member) + nrow_group_file=nrow(group_member) + n_tab = nrow(tab) + if (nrow_group_file == n_tab + 1) { + #We suppose first line is a header + header=drop(t(group_member[1,])) + colnames(group_member)=header + group_member=group_member[-1,] + nrow_group_file=nrow(group_member) + } + + if (ncol_group_file==1) { + if (length(dim(group_member))==2) { + group_member=as.factor(group_member[,1]) + } else { + group_member=as.factor(as.character(group_member)) + } + nrow_group_file=length(group_member) + } else {#first column specifies the names + rn=as.character(group_member[,1]) + group_member=as.factor(group_member[,2]) + names(group_member)=rn + cluster_names = rownames(tab) + n1=sum(names(group_member) %in% cluster_names) + n2=sum(cluster_names %in% names(group_member)) + if (n1 != n2 | n1!=n_tab | n2 !=n_tab) { + names_in_error="
    " + for( name in names(group_member)) { + if (!(name %in% cluster_names)) { + names_in_error=paste(names_in_error,"
  • ",name,"
  • ",sep="") + } + } + names_in_error=paste(names_in_error,"
",sep="") + log_error(simpleCondition( + paste("You specified a group member file for coloring ",line_use,"s in your cluster.
\n", + "This file contains more than one column, therefore we suppose that the first column refers to ", + "the ",line_use," names.
\n", + "We observed that there is not a complete correspondance between ",line_use," names in the two files you proposed.
\n", + "List of ",line_use," names in data group member file which does not have any match with data table file :
",names_in_error,"\n", + sep="" + ) + )) + } + #Order colors with names + group_member=group_member[cluster_names] + } + } + if (nrow_group_file != n_tab) { + log_error(simpleCondition( + paste("You specified a file for coloring ",line_use,"s in your cluster but this file contains ", + nrow_group_file," lines and your table contains ",n_tab," ",line_use,"s.",sep="") + )) + } + } + + + if (!is.null(select)) { + if (!is.numeric(select) | select<=0) + log_error(simpleCondition( + paste("You specified a value of top ",line_use,"s for your clustering. ", + "This value should be a positive integer.",sep="") + )) + select <- ceiling(select) + select <- min(select, nrow(tab)) + select <- order(apply(tab,1,sd), decreasing = TRUE)[1:select] + if (!is.null(group_member_file)) group_member <- group_member[select] + tab=tab[select,] + } + + #Does this table contains NA values + for (i in 1:nrow(tab)) { + if (sum(is.na(tab[i,]))!=0) { + tab[i,is.na(tab[i,])]=mean(tab[i,],na.rm=T) + } + } + + # Distance matrix ---------------------------------- + #--------------------------------------------------- + + if (distance_method == "correlation") { + tab.dist <- as.dist(1 - cor(t(as.matrix(tab)), method = "pearson")) + } else { + tab.dist <- dist(tab, method = distance_method) + } + + + # Hierarchical cluster ----------------------------- + #--------------------------------------------------- + hc <- as.dendrogram(hclust(tab.dist, method = agglomeration_method)) + + # Output ------------------------------------------- + #--------------------------------------------------- + lab.cex = min(1, 1/log(attr(tab.dist, "Size"), base = 5)) + #output_file = paste(output_file, format_image_out, sep = ".") + + if (is.null(group_member_file)) { + if (format_image_out == "png") { + png(output_file, width = width, height = height, units = "in", res = ppi) + plot(hc, main = plot_title, xlab = xlab, ylab = ylab, + nodePar = list(pch = c(NA, NA), lab.cex = lab.cex)) + dev.off() + } + + if (format_image_out == "jpeg") { + jpeg(output_file, width = width, height = height, units = "in", res = ppi) + plot(hc, main = plot_title, xlab = xlab, ylab = ylab, + nodePar = list(pch = c(NA, NA), lab.cex = lab.cex)) + dev.off() + } + + if (format_image_out == "tiff") { + tiff(output_file, width = width, height = height, units = "in", res = ppi) + plot(hc, main = plot_title, xlab = xlab, ylab = ylab, + nodePar = list(pch = c(NA, NA), lab.cex = lab.cex)) + dev.off() + } + + if (format_image_out == "pdf") { + pdf(output_file, width = width, height = height) + plot(hc, main = plot_title, xlab = xlab, ylab = ylab, + nodePar = list(pch = c(NA, NA), lab.cex = lab.cex)) + dev.off() + } + } else { + # Color label function ----------------------------- + #--------------------------------------------------- + colLab <- function(dend, gp.member, lab.cex) { + label.colors <- brewer.pal(max(3, nlevels(gp.member)), "Set1") + if(is.leaf(dend)) { + att <- attributes(dend) + labCol <- label.colors[gp.member[which(names(gp.member) == att$label)]] + attr(dend, "nodePar") <- c(att$nodePar, list(lab.col = labCol, pch = c(NA, NA), lab.cex = lab.cex)) + } + dend + } + + names(group_member) <- attr(tab.dist, "Labels") + + + + if (format_image_out == "png") { + png(output_file, width = width, height = height, units = "in", res = ppi) + plot(dendrapply(hc, colLab, group_member, lab.cex), main = plot_title, xlab = xlab, ylab = ylab) + dev.off() + } + + if (format_image_out == "jpeg") { + jpeg(output_file, width = width, height = height, units = "in", res = ppi) + plot(dendrapply(hc, colLab, group_member, lab.cex), main = plot_title, xlab = xlab, ylab = ylab) + dev.off() + } + + if (format_image_out == "tiff") { + tiff(output_file, width = width, height = height, units = "in", res = ppi) + plot(dendrapply(hc, colLab, group_member, lab.cex), main = plot_title, xlab = xlab, ylab = ylab) + dev.off() + } + + if (format_image_out == "pdf") { + pdf(output_file, width = width, height = height) + plot(dendrapply(hc, colLab, group_member, lab.cex), main = plot_title, sub = xlab, ylab = ylab) + dev.off() + } + } + + ########################################################## + # Treatment successfull + ########################################################## + cat("Hierarchical clustering report\n",file=log_file,append=F,sep="") + cat("✓ Your clustering process is successfull !
",file=log_file,append=T,sep="") + cat("\n",file=log_file,append=T,sep="") + + q(save="no",status=0) + +} # end of function + +#### Test clustering #### +#LJO : 13/3/2017 +#setwd("H:/INRA/cati/groupe stats/Galaxy/hclust") +#h_clust(input_file="in/decathlon.txt",plot_title="declathlon",output_file="out/decathlon1") +#h_clust(input_file="in/decathlon.txt",plot_title="declathlon",output_file="out/decathlon2",column_clustering=FALSE, +# xlab="Competitors",ylab="Distance") +#h_clust(input_file="in/decathlon.txt",plot_title="declathlon",output_file="out/decathlon3",column_clustering=FALSE, +# select=5) +#h_clust(input_file="in/decathlon.txt",plot_title="declathlon",output_file="out/decathlon4",column_clustering=FALSE, +# distance_method="correlation",agglomeration_method="average", +# format_image_out="tiff",ppi=100,width=3,height=3 +#) +##Group : competitors +#h_clust(input_file="in/decathlon.txt",plot_title="declathlon",output_file="out/decathlon5",column_clustering=FALSE, +# xlab="Competitors",ylab="Distance",group_member_file="in/competitors_groups - 1 column.txt") +#h_clust(input_file="in/decathlon.txt",plot_title="declathlon",output_file="out/decathlon6",column_clustering=FALSE, +# xlab="Competitors",ylab="Distance",group_member_file="in/competitors_groups - 2 columns.txt") +#h_clust(input_file="in/decathlon.txt",plot_title="declathlon",output_file="out/decathlon7",column_clustering=FALSE, +# xlab="Competitors",ylab="Distance",group_member_file="in/competitors_groups - 1 column with header.txt") +#h_clust(input_file="in/decathlon.txt",plot_title="declathlon",output_file="out/decathlon8",column_clustering=FALSE, +# xlab="Competitors",ylab="Distance",group_member_file="in/competitors_groups - 2 columns with header.txt") +#h_clust(input_file="in/decathlon.txt",plot_title="declathlon",output_file="out/decathlon8",column_clustering=FALSE, +# xlab="Competitors",ylab="Distance",group_member_file="in/competitors_groups - 2 columns - with error.txt") +# +##Group : competitions +#h_clust(input_file="in/decathlon.txt",plot_title="declathlon",output_file="out/decathlon9",column_clustering=TRUE, +# xlab="Competitions",ylab="Distance",group_member_file="in/competitions_groups - 1 column.txt") +#h_clust(input_file="in/decathlon.txt",plot_title="declathlon",output_file="out/decathlon10",column_clustering=TRUE, +# xlab="Competitions",ylab="Distance",group_member_file="in/competitions_groups - 2 columns.txt") +#h_clust(input_file="in/decathlon.txt",plot_title="declathlon",output_file="out/decathlon11",column_clustering=TRUE, +# xlab="Competitions",ylab="Distance",group_member_file="in/competitions_groups - 1 column with header.txt") +#h_clust(input_file="in/decathlon.txt",plot_title="declathlon",output_file="out/decathlon12",column_clustering=TRUE, +# xlab="Competitions",ylab="Distance",group_member_file="in/competitions_groups - 2 columns with header.txt") +#h_clust(input_file="in/decathlon.txt",plot_title="declathlon",output_file="out/decathlon13",column_clustering=TRUE, +# xlab="Competitions",ylab="Distance",group_member_file="in/competitions_groups - 2 columns - with error.txt") +# +##Missing values +#h_clust(input_file="in/decathlon - with NA.txt",plot_title="declathlon",output_file="out/decathlon14",column_clustering=TRUE, +# xlab="Competitions",ylab="Distance",na_encoding="missing_value") +# +##Top 5 competitions +#h_clust(input_file="in/decathlon.txt",plot_title="declathlon",output_file="out/decathlon15",column_clustering=TRUE, +# xlab="Competitions",ylab="Distance",select=5) diff -r 000000000000 -r dc678d2c1976 h_clust.xml --- /dev/null Thu Jan 01 00:00:00 1970 +0000 +++ b/h_clust.xml Thu Jan 18 07:56:33 2018 -0500 @@ -0,0 +1,280 @@ + + + + Generate hierarchical cluster analysis on a numeric data table + + R + r-rcolorbrewer + r-batch + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + @article {Love002832, + author = {Love, Michael I and Huber, Wolfgang and Anders, Simon}, + title = {Moderated estimation of fold change and dispersion for RNA-seq data with DESeq2}, + year = {2014}, + doi = {10.1101/002832}, + publisher = {Cold Spring Harbor Laboratory}, + abstract = {In comparative high-throughput sequencing assays, a fundamental task is the analysis of count data, such as read counts per gene in RNA-seq data, for evidence of systematic changes across experimental conditions. Small replicate numbers, discreteness, large dynamic range and the presence of outliers require a suitable statistical approach. We present DESeq2, a method for differential analysis of count data. DESeq2 uses shrinkage estimation for dispersions and fold changes to improve stability and interpretability of the estimates. This enables a more quantitative analysis focused on the strength rather than the mere presence of differential expression and facilitates downstream tasks such as gene ranking and visualization. DESeq2 is available as an R/Bioconductor package.}, + URL = {https://www.biorxiv.org/content/early/2014/11/17/002832}, + eprint = {https://www.biorxiv.org/content/early/2014/11/17/002832.full.pdf}, + journal = {bioRxiv}} + + + diff -r 000000000000 -r dc678d2c1976 h_clust_galaxy.R --- /dev/null Thu Jan 01 00:00:00 1970 +0000 +++ b/h_clust_galaxy.R Thu Jan 18 07:56:33 2018 -0500 @@ -0,0 +1,79 @@ +#!/usr/local/bioinfo/bin/Rscript --vanilla --slave --no-site-file + +# R Script producing a hierarchical clustering +# Input : a file containing a table with numeric values +# except for the first column containing sample names +# and the first line containing variable names +# separator expected is +# +# Clustering method : +# euclidean, correlation, ... +# +# Ouptut : a file containing the image of the clustering +#----------------------------------------------------------------- +# Authors : sophie.lamarre(at)insa-toulouse.fr +# ignacio.gonzalez(at)toulouse.inra.fr +# luc.jouneau(at)inra.fr +# valentin.marcon(at)inra.fr +# Version : 0.9 +# Date : 06/09/2017 + +##------------------------------ +## Options +##------------------------------ +strAsFacL <- options()$stringsAsFactors +options(stringsAsFactors = FALSE) + +##------------------------------ +## Libraries laoding +##------------------------------ +# For parseCommandArgs function +library(batch) + +# R script call +source_local <- function(fname) +{ + argv <- commandArgs(trailingOnly = FALSE) + base_dir <- dirname(substring(argv[grep("--file=", argv)], 8)) + source(paste(base_dir, fname, sep="/")) +} + +#Import the different functions used for the hierarchical clustering +source_local("h_clust.R") + +##------------------------------ +## Lecture parametres +##------------------------------ +argLs <- parseCommandArgs(evaluate=FALSE) + +group_member_file=argLs[["group_member_file"]] +if (group_member_file=="NO"){ + group_member_file<-NULL +} +select=argLs[["select"]] +if (select=="NULL"){ + select<-NULL +} +column_clustering=argLs[["column_clustering"]] +if (column_clustering=="TRUE"){ + column_clustering<-TRUE +} else { + column_clustering<-FALSE +} + +h_clust(input_file=argLs[["input_file"]], + group_member_file=group_member_file, + output_file=argLs[["output_file"]], + log_file=argLs[["log_file"]], + format_image_out=argLs[["format_image_out"]], + distance_method=argLs[["distance_method"]], + agglomeration_method=argLs[["agglomeration_method"]], + column_clustering=column_clustering, + select=select, + plot_title=argLs[["plot_title"]], + xlab=argLs[["xlab"]], + ylab=argLs[["ylab"]], + width=argLs[["width"]], + height=argLs[["height"]], + ppi=argLs[["ppi"]], + na_encoding=argLs[["NA_code"]]) diff -r 000000000000 -r dc678d2c1976 test-data/decathlon.tsv --- /dev/null Thu Jan 01 00:00:00 1970 +0000 +++ b/test-data/decathlon.tsv Thu Jan 18 07:56:33 2018 -0500 @@ -0,0 +1,42 @@ +"name" "100m" "Long.jump" "Shot.put" "High.jump" "400m" "110m.hurdle" "Discus" "Pole.vault" "Javeline" "1500m" +"SEBRLE" 11.04 7.58 14.83 2.07 49.81 14.69 43.75 5.02 63.19 291.7 +"CLAY" 10.76 7.4 14.26 1.86 49.37 14.05 50.72 4.92 60.15 301.5 +"KARPOV" 11.02 7.3 14.77 2.04 48.37 14.09 48.95 4.92 50.31 300.2 +"BERNARD" 11.02 7.23 14.25 1.92 48.93 14.99 40.87 5.32 62.77 280.1 +"YURKOV" 11.34 7.09 15.19 2.1 50.42 15.31 46.26 4.72 63.44 276.4 +"WARNERS" 11.11 7.6 14.31 1.98 48.68 14.23 41.1 4.92 51.77 278.1 +"ZSIVOCZKY" 11.13 7.3 13.48 2.01 48.62 14.17 45.67 4.42 55.37 268 +"McMULLEN" 10.83 7.31 13.76 2.13 49.91 14.38 44.41 4.42 56.37 285.1 +"MARTINEAU" 11.64 6.81 14.57 1.95 50.14 14.93 47.6 4.92 52.33 262.1 +"HERNU" 11.37 7.56 14.41 1.86 51.1 15.06 44.99 4.82 57.19 285.1 +"BARRAS" 11.33 6.97 14.09 1.95 49.48 14.48 42.1 4.72 55.4 282 +"NOOL" 11.33 7.27 12.68 1.98 49.2 15.29 37.92 4.62 57.44 266.6 +"BOURGUIGNON" 11.36 6.8 13.46 1.86 51.16 15.67 40.49 5.02 54.68 291.7 +"Sebrle" 10.85 7.84 16.36 2.12 48.36 14.05 48.72 5 70.52 280.01 +"Clay" 10.44 7.96 15.23 2.06 49.19 14.13 50.11 4.9 69.71 282 +"Karpov" 10.5 7.81 15.93 2.09 46.81 13.97 51.65 4.6 55.54 278.11 +"Macey" 10.89 7.47 15.73 2.15 48.97 14.56 48.34 4.4 58.46 265.42 +"Warners" 10.62 7.74 14.48 1.97 47.97 14.01 43.73 4.9 55.39 278.05 +"Zsivoczky" 10.91 7.14 15.31 2.12 49.4 14.95 45.62 4.7 63.45 269.54 +"Hernu" 10.97 7.19 14.65 2.03 48.73 14.25 44.72 4.8 57.76 264.35 +"Nool" 10.8 7.53 14.26 1.88 48.81 14.8 42.05 5.4 61.33 276.33 +"Bernard" 10.69 7.48 14.8 2.12 49.13 14.17 44.75 4.4 55.27 276.31 +"Schwarzl" 10.98 7.49 14.01 1.94 49.76 14.25 42.43 5.1 56.32 273.56 +"Pogorelov" 10.95 7.31 15.1 2.06 50.79 14.21 44.6 5 53.45 287.63 +"Schoenbeck" 10.9 7.3 14.77 1.88 50.3 14.34 44.41 5 60.89 278.82 +"Barras" 11.14 6.99 14.91 1.94 49.41 14.37 44.83 4.6 64.55 267.09 +"Smith" 10.85 6.81 15.24 1.91 49.27 14.01 49.02 4.2 61.52 272.74 +"Averyanov" 10.55 7.34 14.44 1.94 49.72 14.39 39.88 4.8 54.51 271.02 +"Ojaniemi" 10.68 7.5 14.97 1.94 49.12 15.01 40.35 4.6 59.26 275.71 +"Smirnov" 10.89 7.07 13.88 1.94 49.11 14.77 42.47 4.7 60.88 263.31 +"Qi" 11.06 7.34 13.55 1.97 49.65 14.78 45.13 4.5 60.79 272.63 +"Drews" 10.87 7.38 13.07 1.88 48.51 14.01 40.11 5 51.53 274.21 +"Parkhomenko" 11.14 6.61 15.69 2.03 51.04 14.88 41.9 4.8 65.82 277.94 +"Terek" 10.92 6.94 15.15 1.94 49.56 15.12 45.62 5.3 50.62 290.36 +"Gomez" 11.08 7.26 14.57 1.85 48.61 14.41 40.95 4.4 60.71 269.7 +"Turi" 11.08 6.91 13.62 2.03 51.67 14.26 39.83 4.8 59.34 290.01 +"Lorenzo" 11.1 7.03 13.22 1.85 49.34 15.38 40.22 4.5 58.36 263.08 +"Karlivans" 11.33 7.26 13.3 1.97 50.54 14.98 43.34 4.5 52.92 278.67 +"Korkizoglou" 10.86 7.07 14.81 1.94 51.16 14.96 46.07 4.7 53.05 317 +"Uldal" 11.23 6.99 13.53 1.85 50.95 15.09 43.01 4.5 60 281.7 +"Casarsa" 11.36 6.68 14.92 1.94 53.2 15.39 48.66 4.4 58.62 296.12 diff -r 000000000000 -r dc678d2c1976 test-data/log_file --- /dev/null Thu Jan 01 00:00:00 1970 +0000 +++ b/test-data/log_file Thu Jan 18 07:56:33 2018 -0500 @@ -0,0 +1,2 @@ +Hierarchical clustering report +✓ Your clustering process is successfull !
diff -r 000000000000 -r dc678d2c1976 test-data/output_file Binary file test-data/output_file has changed