Beefy Boxes and Bandwidth Generously Provided by pair Networks
P is for Practical
 
PerlMonks  

How can one join the shortest and longest strings of different text files?

by supriyoch_2008 (Monk)
on Jul 04, 2013 at 19:04 UTC ( [id://1042508]=perlquestion: print w/replies, xml ) Need Help??

Help for this page

Select Code to Download


  1. or download this
    A
    ,AA
    ...
    ,AAAA
    ,AAAAA
    ,
    
  2. or download this
    T
    ,TT
    ...
    ,TTTT
    ,TTTTT
    ,
    
  3. or download this
    G
    ,GG
    ...
    ,GGGG
    ,GGGGG
    ,
    
  4. or download this
     
    #!/usr/bin/perl  
    use warnings;  
    ...
     
    exit; 
    ########################################
    
  5. or download this
    Microsoft Windows [Version 6.1.7601]
    Copyright (c) 2009 Microsoft Corporation.  All rights reserved.
    ...
     Length 4.0; Seq: GGGG
    
    ######## File 3 ends ##############
    
  6. or download this
    Two shortest strings (small to big): 
     Seq 1: ATG
    ...
    Two longest strings (big to small):
     seq 1: AAAAATTTTTGGGGG 
     seq 2: AAAATTTTGGGG
    

Log In?
Username:
Password:

What's my password?
Create A New User
Domain Nodelet?
Node Status?
node history
Node Type: perlquestion [id://1042508]
Approved by ww
help
Chatterbox?
and the web crawler heard nothing...

How do I use this?Last hourOther CB clients
Other Users?
Others wandering the Monastery: (2)
As of 2024-04-26 02:30 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    No recent polls found