Login or Register to Ask a Question and Join Our Community


Software Releases - RSS News

FastDup 0.2 (Default branch)

Login to Discuss or Reply to this Discussion in Our Community

 
Thread Tools Search this Thread
Special Forums News, Links, Events and Announcements Software Releases - RSS News FastDup 0.2 (Default branch)
# 1  
Old 10-14-2008
FastDup 0.2 (Default branch)
FastDup is a tool to find identical files within directory trees, with a focus on the ability to scan very large trees and files in reasonable amounts of time. The use of clever techniques and optimizations to avoid comparisons allows fastdup to significantly outperform many existing solutions, and has a benefit of being entirely I/O bound (insignificant CPU usage). It is released under a modified BSD license, allowing all use, redistribution, and modification for non-commercial purposes. License: BSD License (revised) Changes:
This release includes vast improvements in memory usage, especially when scanning large numbers of files, and more informative and active output. Numerous internal changes were also made with the aim of cleanliness and future expandability. Image

Image

More...
Login or Register to Ask a Question

Previous Thread | Next Thread
Login or Register to Ask a Question

LEARN ABOUT DEBIAN

tree-puzzle

TREE-PUZZLE(1)						      General Commands Manual						    TREE-PUZZLE(1)

NAME

       tree-puzzle - Reconstruction of phylogenetic trees by maximum likelihood

SYNOPSIS

       tree-puzzle

DESCRIPTION

       This manual page documents briefly the tree-puzzle command.  This manual page was written for the Debian GNU/Linux distribution because the
       original program does not have a manual page.

       TREE-PUZZLE is the new name for the program previously known as PUZZLE!

       tree-puzzle is an interactive console program that implements a fast tree search algorithm, quartet puzzling, that allows analysis of large
       data  sets  and automatically assigns estimations of support to each internal branch. TREE-PUZZLE also computes pairwise maximum likelihood
       distances as well as branch lengths for user specified trees. Branch lengths can also be calculated under the  clock-assumption.  In  addi-
       tion, TREE-PUZZLE offers a novel method, likelihood mapping, to investigate the support of a hypothesized internal branch without computing
       an overall tree and to visualize the phylogenetic content of a sequence alignment.

       There is also a paralellized version tree-ppuzzle available.

OPTIONS

       There are no options. For usage please look at /usr/share/doc/tree-puzzle/tree-puzzle.pdf.

SEE ALSO

       phylip(1), treetool(1).	tree-ppuzzle(1).

       This manual page was written by Dr. Guenter Bechly <gbechly@debian.org>, for the Debian GNU/Linux system (but may be used by others).

								  April 20, 2001						    TREE-PUZZLE(1)